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

日期精度:到日 5104 篇 · 到月 0 篇 · 到年 0 篇

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

Convergence of covariance and spectral density estimates for high-dimensional locally stationary processes

高维局部平稳过程的协方差与谱密度估计收敛性

Covariances and spectral density functions play a fundamental role in the theory of time series. There is a well-developed asymptotic theory for their estimates for low-dimensional stationary processes. For high-dimensional nonstationary processes, however, many important problems on their asymptotic behaviors are still unanswered. This paper presents a systematic asymptotic theory for the estimates of time-varying second-order statistics for a general class of…

AI 解读阅读原文 ↗BibTeX ↓

Optimal change point detection and localization in sparse dynamic networks

稀疏动态网络中变点的最优检测与定位

We study the problem of change point localization in dynamic networks models. We assume that we observe a sequence of independent adjacency matrices of the same size, each corresponding to a realization of an unknown inhomogeneous Bernoulli model. The underlying distribution of the adjacency matrices are piecewise constant, and may change over a subset of the time points, called change points. We are concerned with recovering the unknown number and positions of the change…

AI 解读阅读原文 ↗BibTeX ↓

Transfer learning for nonparametric classification: Minimax rate and adaptive classifier

非参数分类的迁移学习:极小极大速率与自适应分类器

Human learners have the natural ability to use knowledge gained in one setting for learning in a different but related setting. This ability to transfer knowledge from one task to another is essential for effective learning. In this paper, we study transfer learning in the context of nonparametric classification based on observations from different distributions under the posterior drift model, which is a general framework and arises in many practical problems. We first…

AI 解读阅读原文 ↗BibTeX ↓

Asymptotic optimality in stochastic optimization

随机优化中的渐近最优性

We study local complexity measures for stochastic convex optimization problems, providing a local minimax theory analogous to that of Hájek and Le Cam for classical statistical problems. We give complementary optimality results, developing fully online methods that adaptively achieve optimal convergence guarantees. Our results provide function-specific lower bounds and convergence results that make precise a correspondence between statistical difficulty and the geometric…

AI 解读阅读原文 ↗BibTeX ↓

Robust Bayes-like estimation: Rho-Bayes estimation

稳健类贝叶斯估计:Rho-Bayes 估计

We observe $n$ independent random variables with joint distribution ${\mathbf{P}}$ and pretend that they are i.i.d. with some common density $s$ (with respect to a known measure $\mu $) that we wish to estimate. We consider a density model $\overline{S}$ for $s$ that we endow with a prior distribution $\pi $ (with support in $\overline{S}$) and build a robust alternative to the classical Bayes posterior distribution which possesses similar concentration properties around $s$…

AI 解读阅读原文 ↗BibTeX ↓

Isotonic regression in multi-dimensional spaces and graphs

多维空间与图上的保序回归

In this paper, we study minimax and adaptation rates in general isotonic regression. For uniform deterministic and random designs in $[0,1]^{d}$ with ${d\ge2}$ and $N(0,1)$ noise, the minimax rate for the $\ell_{2}$ risk is known to be bounded from below by $n^{-1/d}$ when the unknown mean function $f$ is nondecreasing and its range is bounded by a constant, while the least squares estimator (LSE) is known to nearly achieve the minimax rate up to a factor $(\log n)^{\gamma}$…

AI 解读阅读原文 ↗BibTeX ↓

Beyond Gaussian approximation: Bootstrap for maxima of sums of independent random vectors

超越高斯近似:独立随机向量之和最大值的自助法

The Bonferroni adjustment, or the union bound, is commonly used to study rate optimality properties of statistical methods in high-dimensional problems. However, in practice, the Bonferroni adjustment is overly conservative. The extreme value theory has been proven to provide more accurate multiplicity adjustments in a number of settings, but only on an ad hoc basis. Recently, Gaussian approximation has been used to justify bootstrap adjustments in large scale simultaneous…

AI 解读阅读原文 ↗BibTeX ↓

Analysis of a two-layer neural network via displacement convexity

通过位移凸性分析两层神经网络

Fitting a function by using linear combinations of a large number $N$ of “simple” components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is nonconvex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches. Here,…

AI 解读阅读原文 ↗BibTeX ↓

Optimal estimation of variance in nonparametric regression with random design

随机设计非参数回归中的最优方差估计

Consider the heteroscedastic nonparametric regression model with random design \begin{equation*}Y_{i}=f(X_{i})+V^{1/2}(X_{i})\varepsilon _{i},\quad i=1,2,\ldots ,n,\end{equation*} with $f(\cdot )$ and $V(\cdot )$ $\alpha $- and $\beta $-Hölder smooth, respectively. We show that the minimax rate of estimating $V(\cdot )$ under both local and global squared risks is of the order \begin{equation*}n^{-\frac{8\alpha \beta }{4\alpha \beta +2\alpha +\beta }}\vee n^{-\frac{2\beta }{2\beta +1}},\end{equation*}…

AI 解读阅读原文 ↗BibTeX ↓

Test for high dimensional covariance matrices

高维协方差矩阵检验

The paper introduces a new test for testing structures of covariances for high dimensional vectors and the data dimension can be much larger than the sample size. Under proper normalization, central and noncentral limit theorems are established. The asymptotic theory is attained without imposing any explicit restriction between data dimension and sample size. To facilitate the related statistical inference, we propose the balanced Rademacher weighted differencing scheme,…

AI 解读阅读原文 ↗BibTeX ↓

Model selection and local geometry

模型选择与局部几何

We consider problems in model selection caused by the geometry of models close to their points of intersection. In some cases—including common classes of causal or graphical models, as well as time series models—distinct models may nevertheless have identical tangent spaces. This has two immediate consequences: first, in order to obtain constant power to reject one model in favour of another we need local alternative hypotheses that decrease to the null at a slower rate than…

AI 解读阅读原文 ↗BibTeX ↓

Simultaneous high-probability bounds on the false discovery proportion in structured, regression and online settings

结构化、回归及在线场景中错误发现比例的同时高概率界

While traditional multiple testing procedures prohibit adaptive analysis choices made by users, Goeman and Solari (Statist. Sci. 26 (2011) 584–597) proposed a simultaneous inference framework that allows users such flexibility while preserving high-probability bounds on the false discovery proportion (FDP) of the chosen set. In this paper, we propose a new class of such simultaneous FDP bounds, tailored for nested sequences of rejection sets. While most existing simultaneous…

AI 解读阅读原文 ↗BibTeX ↓

Inference for conditional value-at-risk of a predictive regression

预测回归中条件风险价值的统计推断

Conditional value-at-risk is a popular risk measure in risk management. We study the inference problem of conditional value-at-risk under a linear predictive regression model. We derive the asymptotic distribution of the least squares estimator for the conditional value-at-risk. Our results relax the model assumptions made in (Oper. Res. 60 (2012) 739–756) and correct their mistake in the asymptotic variance expression. We show that the asymptotic variance depends on the…

AI 解读阅读原文 ↗BibTeX ↓

Robust multivariate nonparametric tests via projection averaging

通过投影平均构造稳健的多元非参数检验

In this work, we generalize the Cramér–von Mises statistic via projection averaging to obtain a robust test for the multivariate two-sample problem. The proposed test is consistent against all fixed alternatives, robust to heavy-tailed data and minimax rate optimal against a certain class of alternatives. Our test statistic is completely free of tuning parameters and is computationally efficient even in high dimensions. When the dimension tends to infinity, the proposed test…

AI 解读阅读原文 ↗BibTeX ↓

The distance standard deviation

距离标准差

The distance standard deviation, which arises in distance correlation analysis of multivariate data, is studied as a measure of spread. The asymptotic distribution of the empirical distance standard deviation is derived under the assumption of finite second moments. Applications are provided to hypothesis testing on a data set from materials science and to multivariate statistical quality control. The distance standard deviation is compared to classical scale measures for…

AI 解读阅读原文 ↗BibTeX ↓

Distance-based and RKHS-based dependence metrics in high dimension

高维情形下基于距离与再生核希尔伯特空间的依赖度量

In this paper, we study distance covariance, Hilbert–Schmidt covariance (aka Hilbert–Schmidt independence criterion [In Advances in Neural Information Processing Systems (2008) 585–592]) and related independence tests under the high dimensional scenario. We show that the sample distance/Hilbert–Schmidt covariance between two random vectors can be approximated by the sum of squared componentwise sample cross-covariances up to an asymptotically constant factor, which indicates…

AI 解读阅读原文 ↗BibTeX ↓

Nonparametric drift estimation for i.i.d. paths of stochastic differential equations

基于独立同分布随机微分方程路径的非参数漂移估计

We consider $N$ independent stochastic processes $(X_{i}(t),t\in [0,T])$, $i=1,\ldots ,N$, defined by a one-dimensional stochastic differential equation, which are continuously observed throughout a time interval $[0,T]$ where $T$ is fixed. We study nonparametric estimation of the drift function on a given subset $A$ of ${\mathbb{R}}$. Projection estimators are defined on finite dimensional subsets of ${\mathbb{L}}^{2}(A,dx)$. We stress that the set $A$ may be compact or not…

AI 解读阅读原文 ↗BibTeX ↓

Fréchet change-point detection

Fréchet 变点检测

We propose a method to infer the presence and location of change-points in the distribution of a sequence of independent data taking values in a general metric space, where change-points are viewed as locations at which the distribution of the data sequence changes abruptly in terms of either its Fréchet mean, Fréchet variance or both. The proposed method is based on comparisons of Fréchet variances before and after putative change-point locations and does not require a…

AI 解读阅读原文 ↗BibTeX ↓

Optimal rates of entropy estimation over Lipschitz balls

Lipschitz 球上熵估计的最优收敛速度

We consider the problem of minimax estimation of the entropy of a density over Lipschitz balls. Dropping the usual assumption that the density is bounded away from zero, we obtain the minimax rates $(n\ln n)^{-s/(s+d)}+n^{-1/2}$ for $0

AI 解读阅读原文 ↗BibTeX ↓

Towards optimal estimation of bivariate isotonic matrices with unknown permutations

未知排列下双变量保序矩阵的最优估计探索

Many applications, including rank aggregation, crowd-labeling and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating an unknown matrix in this class, based on noisy observations of (possibly, a subset of) its entries. We design and analyze polynomial-time algorithms that improve upon the state of the art in two distinct metrics, showing, in particular,…

AI 解读阅读原文 ↗BibTeX ↓

Singularity, misspecification and the convergence rate of EM

奇异性、模型误设与EM算法的收敛速度

A line of recent work has analyzed the behavior of the Expectation-Maximization (EM) algorithm in the well-specified setting, in which the population likelihood is locally strongly concave around its maximizing argument. Examples include suitably separated Gaussian mixture models and mixtures of linear regressions. We consider over-specified settings in which the number of fitted components is larger than the number of components in the true distribution. Such mis-specified…

AI 解读阅读原文 ↗BibTeX ↓

Asymptotic joint distribution of extreme eigenvalues and trace of large sample covariance matrix in a generalized spiked population model

广义尖峰总体模型中大样本协方差矩阵极端特征值与迹的联合渐近分布

This paper studies the joint limiting behavior of extreme eigenvalues and trace of large sample covariance matrix in a generalized spiked population model, where the asymptotic regime is such that the dimension and sample size grow proportionally. The form of the joint limiting distribution is applied to conduct Johnson–Graybill-type tests, a family of approaches testing for signals in a statistical model. For this, higher order correction is further made, helping alleviate…

AI 解读阅读原文 ↗BibTeX ↓

Empirical Bayes oracle uncertainty quantification for regression

回归中的经验贝叶斯预言机不确定性量化

We propose an empirical Bayes method for high-dimensional linear regression models. Following an oracle approach that quantifies the error locally for each possible value of the parameter, we show that an empirical Bayes posterior contracts at the optimal rate at all parameters and leads to uniform size-optimal credible balls with guaranteed coverage under an “excessive bias restriction” condition. This condition gives rise to a new slicing of the entire space that is…

AI 解读阅读原文 ↗BibTeX ↓

Limit distribution theory for block estimators in multiple isotonic regression

多元保序回归块估计量的极限分布理论

We study limit distributions for the tuning-free max–min block estimator originally proposed in (Fokianos, Leucht and Neumann (2017)) in the problem of multiple isotonic regression, under both fixed lattice design and random design settings. We show that, if the regression function $f_{0}$ admits vanishing derivatives up to order $\alpha_{k}$ along the $k$th dimension ($k=1,\ldots,d$) at a fixed point $x_{0}\in(0,1)^{d}$, and the errors have variance $\sigma^{2}$, then the…

AI 解读阅读原文 ↗BibTeX ↓