跳到正文
收录说明
收录范围
保留计量方法研究、相关统计基础,以及实质涉及计量方法的应用、教程、比较和综述。书评、刊务及明确无关内容不公开;身份或相关性证据不足的记录保留待核,补充可靠材料后可重新判断。
当前期刊来源见下方官网链接及期刊目录。综合经济学与金融期刊逐篇筛查计量方向,证据不足时暂不公开。正刊、在线优先论文和已核实接收稿合并展示;按标题、可靠摘要、目录及身份匹配的出版社 JEL 分类核验相关性;计量类 JEL 与摘要相互印证,无 JEL 不直接排除。历史回补以可取得的注册题录和目录为准,不等于覆盖全部纸本。
日期与排序
默认按最近发表排序:正刊使用刊期,待刊使用上线日期;缺少上线日期时,排序参考登记或首次收录时间,并在卡片注明。更多筛选可选择出版状态和日期口径;卷期依据出版社元数据,不因待刊时间较长而推定已编入正刊。仅有月份或年份时,日期区间相交也会纳入。

日期精度:到日 8722 篇 · 到月 10901 篇 · 到年 1550 篇 · 未提供 13 篇

分类与引用
领域和方法依据题名、摘要初步分类,可人工修正;分类不代表论文质量。引用数采用 OpenAlex 单条关联记录,不合计版本。
检验与推断:假设检验、置信集、自助法与稳健推断。
更新与 AI 解读
正常题录、可靠摘要与引用同步继续;日、周、月简报按核实的发表与修订日期汇总,历史补录保留在文献库。AI 解读依据可靠摘要或已核实原文片段,已有解读保留供阅读参考;缺少可靠材料的条目保持待解读,浏览页面不会触发生成。
21,186 篇论文
导出
BibTeX ↓RIS ↓RSS 订阅 ↗

Unbiased Markov Chain Monte Carlo Methods with Couplings

利用耦合构造无偏马尔可夫链蒙特卡洛方法

Summary Markov chain Monte Carlo (MCMC) methods provide consistent approximations of integrals as the number of iterations goes to ∞. MCMC estimators are generally biased after any fixed number of iterations. We propose to remove this bias by using couplings of Markov chains together with a telescopic sum argument of Glynn and Rhee. The resulting unbiased estimators can be computed independently in parallel. We discuss practical couplings for popular MCMC algorithms. We…

AI 解读阅读原文 ↗BibTeX ↓

On Bandwidth Choice for Spatial Data Density Estimation

空间数据密度估计的带宽选择

Summary Bandwidth choice is crucial in spatial kernel estimation in exploring non-Gaussian complex spatial data. The paper investigates the choice of adaptive and non-adaptive bandwidths for density estimation given data on a spatial lattice. An adaptive bandwidth depends on local data and hence adaptively conforms with local features of the spatial data. We propose a spatial cross-validation (SCV) choice of a global bandwidth. This is done first with a pilot density…

AI 解读阅读原文 ↗BibTeX ↓

Optimal, Two-Stage, Adaptive Enrichment Designs for Randomized Trials, using Sparse Linear Programming

利用稀疏线性规划优化两阶段自适应富集随机试验设计

Summary Adaptive enrichment designs involve preplanned rules for modifying enrolment criteria based on accruing data in a randomized trial. We focus on designs where the overall population is partitioned into two predefined subpopulations, e.g. based on a biomarker or risk score measured at baseline. The goal is to learn which populations benefit from an experimental treatment. Two critical components of adaptive enrichment designs are the decision rule for modifying…

AI 解读阅读原文 ↗BibTeX ↓

Robust Estimation via Robust Gradient Estimation

通过稳健梯度估计实现稳健估计

Summary We provide a new computationally efficient class of estimators for risk minimization. We show that these estimators are robust for general statistical models, under varied robustness settings, including in the classical Huber ε-contamination model, and in heavy-tailed settings. Our workhorse is a novel robust variant of gradient descent, and we provide conditions under which our gradient descent variant provides accurate estimators in a general convex risk…

AI 解读阅读原文 ↗BibTeX ↓

Causal Mediation Analysis for Stochastic Interventions

随机干预的因果中介分析

Summary Mediation analysis in causal inference has traditionally focused on binary exposures and deterministic interventions, and a decomposition of the average treatment effect in terms of direct and indirect effects. We present an analogous decomposition of the population intervention effect, defined through stochastic interventions on the exposure. Population intervention effects provide a generalized framework in which a variety of interesting causal contrasts can be…

AI 解读阅读原文 ↗BibTeX ↓

A coupled component DCS-EGARCH model for intraday and overnight volatility

日内与隔夜波动率的耦合成分 DCS-EGARCH 模型

We propose a semi-parametric coupled component exponential GARCH model for intraday and overnight returns that allows the two series to have different dynamical properties. We adopt a dynamic conditional score model with t-distributed innovations that captures the very heavy tails of overnight returns. We propose a several-step estimation procedure that captures the nonparametric slowly moving components by kernel estimation and the dynamic parameters by maximum likelihood.…

AI 解读阅读原文 ↗BibTeX ↓

Frequency domain estimation of cointegrating vectors with mixed frequency and mixed sample data

混合频率与混合样本数据的协整向量频域估计

This paper proposes a simple method for exploiting the information contained in mixed frequency and mixed sample data in the estimation of cointegrating vectors. The asymptotic properties of easy-to-compute spectral regression estimators of the cointegrating vectors are derived and these estimators are shown to belong to the class of optimal cointegration estimators. Furthermore, Wald statistics based on these estimators have asymptotic chi-square distributions which enable…

AI 解读阅读原文 ↗BibTeX ↓

Posterior distribution of nondifferentiable functions

不可微函数的后验分布

This paper examines the asymptotic behavior of the posterior distribution of a possibly nondifferentiable function g(θ), where θ is a finite-dimensional parameter of either a parametric or semiparametric model. The main assumption is that the distribution of a suitable estimator θ̂n, its bootstrap approximation, and the Bayesian posterior for θ all agree asymptotically.

AI 解读阅读原文 ↗BibTeX ↓

Relevant parameter changes in structural break models

结构突变模型中的相关参数变化

Structural break time series models, which are commonly used in macroeconomics and finance, capture unknown structural changes by allowing for abrupt changes to model parameters. However, many specifications suffer from an over-parametrization issue, since typically all parameters have to change when a break occurs. We introduce a sparse change-point model to detect which parameters change over time. We propose a shrinkage prior distribution, which controls model parsimony…

AI 解读阅读原文 ↗BibTeX ↓

Inference for high-dimensional instrumental variables regression

高维工具变量回归的统计推断

This paper concerns statistical inference for the components of a high-dimensional regression parameter despite possible endogeneity of each regressor. Given a first-stage linear model for the endogenous regressors and a second-stage linear model for the dependent variable, we develop a novel adaptation of the parametric one-step update to a generic second-stage estimator. We provide conditions under which the scaled update is asymptotically normal. We then introduce a…

AI 解读阅读原文 ↗BibTeX ↓

Classification with imperfect training labels

训练标签不完美时的分类

Summary We study the effect of imperfect training data labels on the performance of classification methods. In a general setting, where the probability that an observation in the training dataset is mislabelled may depend on both the feature vector and the true label, we bound the excess risk of an arbitrary classifier trained with imperfect labels in terms of its excess risk for predicting a noisy label. This reveals conditions under which a classifier trained with…

AI 解读阅读原文 ↗BibTeX ↓

Estimation from cross-sectional data under a semiparametric truncation model

半参数截断模型下基于横截面数据的估计

Summary Cross-sectional sampling is often used when investigating inter-event times, resulting in left-truncated and right-censored data. In this paper, we consider a semiparametric truncation model in which the truncating variable is assumed to belong to a certain parametric family. We examine two methods of estimating both the truncation and the lifetime distributions. We obtain asymptotic representations of the estimators for the lifetime distribution and establish their…

AI 解读阅读原文 ↗BibTeX ↓

Network cross-validation by edge sampling

通过边抽样进行网络交叉验证

Summary While many statistical models and methods are now available for network analysis, resampling of network data remains a challenging problem. Cross-validation is a useful general tool for model selection and parameter tuning, but it is not directly applicable to networks since splitting network nodes into groups requires deleting edges and destroys some of the network structure. In this paper we propose a new network resampling strategy, based on splitting node pairs…

AI 解读阅读原文 ↗BibTeX ↓

Discontinuous Hamiltonian Monte Carlo for discrete parameters and discontinuous likelihoods

用于离散参数与不连续似然的非连续哈密顿蒙特卡洛

Summary Hamiltonian Monte Carlo has emerged as a standard tool for posterior computation. In this article we present an extension that can efficiently explore target distributions with discontinuous densities. Our extension in particular enables efficient sampling from ordinal parameters through the embedding of probability mass functions into continuous spaces. We motivate our approach through a theory of discontinuous Hamiltonian dynamics and develop a corresponding…

AI 解读阅读原文 ↗BibTeX ↓

The essential histogram

本质直方图

Summary The histogram is widely used as a simple, exploratory way of displaying data, but it is usually not clear how to choose the number and size of the bins. We construct a confidence set of distribution functions that optimally deal with the two main tasks of the histogram: estimating probabilities and detecting features such as increases and modes in the distribution. We define the essential histogram as the histogram in the confidence set with the fewest bins. Thus the…

AI 解读阅读原文 ↗BibTeX ↓

On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction

放宽容差并作事后校正的近似贝叶斯计算马尔可夫链蒙特卡洛

Summary Approximate Bayesian computation enables inference for complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation is often sensitive to the tolerance parameter: low tolerance leads to poor mixing and large tolerance entails excess bias. We propose an approach that involves using a relatively large tolerance for the Markov chain Monte Carlo sampler to ensure…

AI 解读阅读原文 ↗BibTeX ↓

Robust empirical Bayes small area estimation with density power divergence

基于密度幂散度的稳健经验贝叶斯小区域估计

Summary A two-stage normal hierarchical model called the Fay–Herriot model and the empirical Bayes estimator are widely used to obtain indirect and model-based estimates of means in small areas. However, the performance of the empirical Bayes estimator can be poor when the assumed normal distribution is misspecified. This article presents a simple modification that makes use of density power divergence and proposes a new robust empirical Bayes small area estimator. The mean…

AI 解读阅读原文 ↗BibTeX ↓

On the marginal likelihood and cross-validation

边际似然与交叉验证的关系

Summary In Bayesian statistics, the marginal likelihood, also known as the evidence, is used to evaluate model fit as it quantifies the joint probability of the data under the prior. In contrast, non-Bayesian models are typically compared using cross-validation on held-out data, either through $k$-fold partitioning or leave-$p$-out subsampling. We show that the marginal likelihood is formally equivalent to exhaustive leave-$p$-out crossvalidation averaged over all values of $p$…

AI 解读阅读原文 ↗BibTeX ↓

An adaptable generalization of Hotelling’s $T^{2}$ test in high dimension

高维 Hotelling T² 检验的自适应推广

We propose a two-sample test for detecting the difference between mean vectors in a high-dimensional regime based on a ridge-regularized Hotelling’s $T^{2}$. To choose the regularization parameter, a method is derived that aims at maximizing power within a class of local alternatives. We also propose a composite test that combines the optimal tests corresponding to a specific collection of local alternatives. Weak convergence of the stochastic process corresponding to the…

AI 解读阅读原文 ↗BibTeX ↓

Local nearest neighbour classification with applications to semi-supervised learning

局部最近邻分类及其半监督学习应用

We derive a new asymptotic expansion for the global excess risk of a local-$k$-nearest neighbour classifier, where the choice of $k$ may depend upon the test point. This expansion elucidates conditions under which the dominant contribution to the excess risk comes from the decision boundary of the optimal Bayes classifier, but we also show that if these conditions are not satisfied, then the dominant contribution may arise from the tails of the marginal distribution of the…

AI 解读阅读原文 ↗BibTeX ↓

On the optimal reconstruction of partially observed functional data

We propose a new reconstruction operator that aims to recover the missing parts of a function given the observed parts. This new operator belongs to a new, very large class of functional operators which includes the classical regression operators as a special case. We show the optimality of our reconstruction operator and demonstrate that the usually considered regression operators generally cannot be optimal reconstruction operators. Our estimation theory allows for…

阅读原文 ↗BibTeX ↓

Robust inference via multiplier bootstrap

通过乘子自助法进行稳健推断

This paper investigates the theoretical underpinnings of two fundamental statistical inference problems, the construction of confidence sets and large-scale simultaneous hypothesis testing, in the presence of heavy-tailed data. With heavy-tailed observation noise, finite sample properties of the least squares-based methods, typified by the sample mean, are suboptimal both theoretically and empirically. In this paper, we demonstrate that the adaptive Huber regression,…

AI 解读阅读原文 ↗BibTeX ↓

Segmentation and estimation of change-point models: False positive control and confidence regions

变点模型的分割与估计:假阳性控制和置信区域

To segment a sequence of independent random variables at an unknown number of change-points, we introduce new procedures that are based on thresholding the likelihood ratio statistic, and give approximations for the probability of a false positive error when there are no change-points. We also study confidence regions based on the likelihood ratio statistic for the change-points and joint confidence regions for the change-points and the parameter values. Applications to…

AI 解读阅读原文 ↗BibTeX ↓

Statistical and computational limits for sparse matrix detection

稀疏矩阵检测的统计与计算极限

This paper investigates the fundamental limits for detecting a high-dimensional sparse matrix contaminated by white Gaussian noise from both the statistical and computational perspectives. We consider $p\times p$ matrices whose rows and columns are individually $k$-sparse. We provide a tight characterization of the statistical and computational limits for sparse matrix detection, which precisely describe when achieving optimal detection is easy, hard or impossible,…

AI 解读阅读原文 ↗BibTeX ↓