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

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

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

Tensor decompositions and sparse log-linear models

张量分解与稀疏对数线性模型

Contingency table analysis routinely relies on log-linear models, with latent structure analysis providing a common alternative. Latent structure models lead to a reduced rank tensor factorization of the probability mass function for multivariate categorical data, while log-linear models achieve dimensionality reduction through sparsity. Little is known about the relationship between these notions of dimensionality reduction in the two paradigms. We derive several results…

AI 解读阅读原文 ↗BibTeX ↓

Monge–Kantorovich depth, quantiles, ranks and signs

Monge–Kantorovich 深度、分位数、秩与符号

We propose new concepts of statistical depth, multivariate quantiles, vector quantiles and ranks, ranks and signs, based on canonical transportation maps between a distribution of interest on $\mathbb{R}^{d}$ and a reference distribution on the $d$-dimensional unit ball. The new depth concept, called Monge–Kantorovich depth, specializes to halfspace depth for $d=1$ and in the case of spherical distributions, but for more general distributions, differs from the latter in the…

AI 解读阅读原文 ↗BibTeX ↓

A general theory of hypothesis tests and confidence regions for sparse high dimensional models

稀疏高维模型中假设检验与置信域的一般理论

We consider the problem of uncertainty assessment for low dimensional components in high dimensional models. Specifically, we propose a novel decorrelated score function to handle the impact of high dimensional nuisance parameters. We consider both hypothesis tests and confidence regions for generic penalized M-estimators. Unlike most existing inferential methods which are tailored for individual models, our method provides a general framework for high dimensional inference…

AI 解读阅读原文 ↗BibTeX ↓

Statistical guarantees for the EM algorithm: From population to sample-based analysis

EM 算法的统计保证:从总体到有限样本分析

The EM algorithm is a widely used tool in maximum-likelihood estimation in incomplete data problems. Existing theoretical work has focused on conditions under which the iterates or likelihood values converge, and the associated rates of convergence. Such guarantees do not distinguish whether the ultimate fixed point is a near global optimum or a bad local optimum of the sample likelihood, nor do they relate the obtained fixed point to the global optima of the idealized…

AI 解读阅读原文 ↗BibTeX ↓

Global rates of convergence in log-concave density estimation

对数凹密度估计的全局收敛速率

The estimation of a log-concave density on $\mathbb{R}^{d}$ represents a central problem in the area of nonparametric inference under shape constraints. In this paper, we study the performance of log-concave density estimators with respect to global loss functions, and adopt a minimax approach. We first show that no statistical procedure based on a sample of size $n$ can estimate a log-concave density with respect to the squared Hellinger loss function with supremum risk…

AI 解读阅读原文 ↗BibTeX ↓

Discussion of “Influential feature PCA for high dimensional clustering”

对《高维聚类中的重要特征主成分分析》的讨论

We would like to congratulate the authors for an interesting paper and a novel proposal for clustering high-dimensional Gaussian mixtures with a diagonal covariance matrix.The proposed two-stage procedure first selects features based on the Kolmogorov-Smirnov statistics and then applies a spectral clustering method to the post-selected data.A rigorous theoretical analysis for the clustering error is given and the results are supported by a competitive performance in…

AI 解读阅读原文 ↗BibTeX ↓

Discussion of “Influential features PCA for high dimensional clustering”

《高维聚类的影响特征主成分分析》讨论

I commend Jin and Wang on a very interesting paper introducing a novel approach to feature selection within clustering and a detailed analysis of its clustering performance under a Gaussian mixture model.I shall divide my discussion into several parts: (i) prior work on feature selection and clustering; (ii) theoretical aspects; (iii) practical aspects; and finally (iv) some questions and directions for future research.On feature selection and clustering.Jin and Wang write…

AI 解读阅读原文 ↗BibTeX ↓

Faithful variable screening for high-dimensional convex regression

We study the problem of variable selection in convex nonparametric regression. Under the assumption that the true regression function is convex and sparse, we develop a screening procedure to select a subset of variables that contains the relevant variables. Our approach is a two-stage quadratic programming method that estimates a sum of one-dimensional convex functions, followed by one-dimensional concave regression fits on the residuals. In contrast to previous methods for…

阅读原文 ↗BibTeX ↓

On marginal sliced inverse regression for ultrahigh dimensional model-free feature selection

用于超高维无模型特征选择的边际切片逆回归

Model-free variable selection has been implemented under the sufficient dimension reduction framework since the seminal paper of Cook [Ann. Statist. 32 (2004) 1062–1092]. In this paper, we extend the marginal coordinate test for sliced inverse regression (SIR) in Cook (2004) and propose a novel marginal SIR utility for the purpose of ultrahigh dimensional feature selection. Two distinct procedures, Dantzig selector and sparse precision matrix estimation, are incorporated to…

AI 解读阅读原文 ↗BibTeX ↓

Influential features PCA for high dimensional clustering

高维聚类中的重要特征主成分分析

We consider a clustering problem where we observe feature vectors $X_{i}\in R^{p}$, $i=1,2,\ldots,n$, from $K$ possible classes. The class labels are unknown and the main interest is to estimate them. We are primarily interested in the modern regime of $p\gg n$, where classical clustering methods face challenges. We propose Influential Features PCA (IF-PCA) as a new clustering procedure. In IF-PCA, we select a small fraction of features with the largest Kolmogorov–Smirnov…

AI 解读阅读原文 ↗BibTeX ↓

Minimax optimal rates of estimation in high dimensional additive models

高维加性模型估计的极小极大最优收敛率

We establish minimax optimal rates of convergence for estimation in a high dimensional additive model assuming that it is approximately sparse. Our results reveal a behavior universal to this class of high dimensional problems. In the sparse regime when the components are sufficiently smooth or the dimensionality is sufficiently large, the optimal rates are identical to those for high dimensional linear regression and, therefore, there is no additional cost to entertain a…

AI 解读阅读原文 ↗BibTeX ↓

Family-Wise Separation Rates for multiple testing

多重检验的族级分离率

Starting from a parallel between some minimax adaptive tests of a single null hypothesis, based on aggregation approaches, and some tests of multiple hypotheses, we propose a new second kind error-related evaluation criterion, as the core of an emergent minimax theory for multiple tests. Aggregation-based tests, proposed for instance by Baraud [Bernoulli 8 (2002) 577–606], Baraud, Huet and Laurent [Ann. Statist. 31 (2003) 225–251] or Fromont and Laurent [Ann. Statist. 34…

AI 解读阅读原文 ↗BibTeX ↓

On the computational complexity of high-dimensional Bayesian variable selection

高维贝叶斯变量选择的计算复杂度

We study the computational complexity of Markov chain Monte Carlo (MCMC) methods for high-dimensional Bayesian linear regression under sparsity constraints. We first show that a Bayesian approach can achieve variable-selection consistency under relatively mild conditions on the design matrix. We then demonstrate that the statistical criterion of posterior concentration need not imply the computational desideratum of rapid mixing of the MCMC algorithm. By introducing a…

AI 解读阅读原文 ↗BibTeX ↓

Nonparametric estimation of dynamics of monotone trajectories

单调轨迹动力学的非参数估计

We study a class of nonlinear nonparametric inverse problems. Specifically, we propose a nonparametric estimator of the dynamics of a monotonically increasing trajectory defined on a finite time interval. Under suitable regularity conditions, we show that in terms of $L^{2}$-loss, the optimal rate of convergence for the proposed estimator is the same as that for the estimation of the derivative of a function. We conduct simulation studies to examine the finite sample…

AI 解读阅读原文 ↗BibTeX ↓

Convergence rates of parameter estimation for some weakly identifiable finite mixtures

若干弱可识别有限混合模型的参数估计收敛速率

We establish minimax lower bounds and maximum likelihood convergence rates of parameter estimation for mean-covariance multivariate Gaussian mixtures, shape-rate Gamma mixtures and some variants of finite mixture models, including the setting where the number of mixing components is bounded but unknown. These models belong to what we call “weakly identifiable” classes, which exhibit specific interactions among mixing parameters driven by the algebraic structures of the class…

AI 解读阅读原文 ↗BibTeX ↓

Sub-Gaussian mean estimators

次高斯均值估计量

We discuss the possibilities and limitations of estimating the mean of a real-valued random variable from independent and identically distributed observations from a nonasymptotic point of view. In particular, we define estimators with a sub-Gaussian behavior even for certain heavy-tailed distributions. We also prove various impossibility results for mean estimators.

AI 解读阅读原文 ↗BibTeX ↓

High-dimensional generalizations of asymmetric least squares regression and their applications

非对称最小二乘回归的高维推广及其应用

Asymmetric least squares regression is an important method that has wide applications in statistics, econometrics and finance. The existing work on asymmetric least squares only considers the traditional low dimension and large sample setting. In this paper, we systematically study the Sparse Asymmetric LEast Squares (SALES) regression under high dimensions where the penalty functions include the Lasso and nonconvex penalties. We develop a unified efficient algorithm for…

AI 解读阅读原文 ↗BibTeX ↓

Consistent model selection criteria for quadratically supported risks

二次支撑风险下的一致模型选择准则

In this paper, we study asymptotic properties of model selection criteria for high-dimensional regression models where the number of covariates is much larger than the sample size. In particular, we consider a class of loss functions called the class of quadratically supported risks which is large enough to include the quadratic loss, Huber loss, quantile loss and logistic loss. We provide sufficient conditions for the model selection criteria, which are applicable to the…

AI 解读阅读原文 ↗BibTeX ↓

Causal inference with a graphical hierarchy of interventions

通过图示干预层级统一因果推断

Identifying causal parameters from observational data is fraught with subtleties due to the issues of selection bias and confounding. In addition, more complex questions of interest, such as effects of treatment on the treated and mediated effects may not always be identified even in data where treatment assignment is known and under investigator control, or may be identified under one causal model but not another. Increasingly complex effects of interest, coupled with a…

AI 解读阅读原文 ↗BibTeX ↓

Peter Hall’s work on high-dimensional data and classification

Peter Hall 在高维数据与分类研究中的工作

In this article, I summarise Peter Hall’s contributions to high-dimensional data, including their geometric representations and variable selection methods based on ranking. I also discuss his work on classification problems, concluding with some personal reflections on my own interactions with him. This article complements [Ann. Statist. 44 (2016) 1821–1836; Ann. Statist. 44 (2016) 1837–1853; Ann. Statist. 44 (2016) 1854–1866 and Ann. Statist. 44 (2016) 1867–1887], which…

AI 解读阅读原文 ↗BibTeX ↓

Peter Hall’s main contributions to deconvolution

Peter Hall对反卷积研究的主要贡献

Peter Hall died in Melbourne on January 9, 2016. He was an extremely prolific researcher and contributed to many different areas of statistics. In this paper, I talk about my experience with Peter and I summarise his main contributions to deconvolution, which include measurement error problems and problems in image analysis.

AI 解读阅读原文 ↗BibTeX ↓

Peter Hall’s contributions to nonparametric function estimation and modeling

Peter Hall 对非参数函数估计与建模的贡献

Peter Hall made wide-ranging and far-reaching contributions to nonparametric modeling. He was one of the leading figures in the developments of nonparametric techniques with over 300 published papers in the field alone. This article gives a selective overview on the contributions of Peter Hall to nonparametric function estimation and modeling. The focuses are on density estimation, nonparametric regression, bandwidth selection, boundary corrections, inference under shape…

AI 解读阅读原文 ↗BibTeX ↓