Spectrum estimation for large dimensional covariance matrices using random matrix theory
利用随机矩阵理论估计高维协方差矩阵的谱AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要讨论一般高维协方差谱估计，主成分分析的提及不足以归入宏观或金融因子模型。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
利用随机矩阵理论估计高维协方差矩阵的谱
- 研究问题
- 当变量数与样本量处于同一数量级时，如何从样本协方差矩阵的特征值估计总体谱，处理样本谱作为估计量的偏差问题？
- 方法与思路
- 作者利用 Marčenko–Pastur 方程估计总体谱，以概率测度描述高维特征值，并采用凸优化实现非线性收缩式估计。
- 材料陈述的贡献
- 摘要称，估计量具有一致性，扩展模拟中计算较快且表现良好；同时提出以概率测度而非直接估计向量来组织问题。
- 阅读关注点
- 应核对维数与样本量的渐近关系、总体谱条件、凸优化的具体构造，以及一致性度量和模拟比较使用的基准。
- 阅读边界
- 仅据版本未注明的 OpenAlex 摘要；弱假设、速度和模拟表现均缺少具体条件或数值，不能认定普遍优越或推断刊本变化。
原文摘要
Estimating the eigenvalues of a population covariance matrix from a sample covariance matrix is a problem of fundamental importance in multivariate statistics; the eigenvalues of covariance matrices play a key role in many widely used techniques, in particular in principal component analysis (PCA). In many modern data analysis problems, statisticians are faced with large datasets where the sample size, n, is of the same order of magnitude as the number of variables p. Random matrix theory predicts that in this context, the eigenvalues of the sample covariance matrix are not good estimators of the eigenvalues of the population covariance. We propose to use a fundamental result in random matrix theory, the Marčenko–Pastur equation, to better estimate the eigenvalues of large dimensional covariance matrices. The Marčenko–Pastur equation holds in very wide generality and under weak assumptions. The estimator we obtain can be thought of as “shrinking” in a nonlinear fashion the eigenvalues of the sample covariance matrix to estimate the population eigenvalues. Inspired by ideas of random matrix theory, we also suggest a change of point of view when thinking about estimation of high-dimensional vectors: we do not try to estimate directly the vectors but rather a probability measure that describes them. We think this is a theoretically more fruitful way to think about these problems. Our estimator gives fast and good or very good results in extended simulations. Our algorithmic approach is based on convex optimization. We also show that the proposed estimator is consistent.