ScreeNOT: Exact MSE-optimal singular value thresholding in correlated noise
ScreeNOT：相关噪声下精确 MSE 最优的奇异值阈值化AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要研究一般低秩矩阵恢复与随机矩阵理论，未明确建立宏观或金融因子模型。
反馈分类问题正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
ScreeNOT：相关噪声下精确 MSE 最优的奇异值阈值化
- 研究问题
- 在加性噪声存在相关性、协方差结构未知或无法独立估计时，如何选择恢复低秩矩阵的奇异值硬阈值？
- 方法与思路
- 作者推导最优硬阈值公式，并提出处理其中不可观测量的 ScreeNOT 方法；理论依赖噪声奇异值经验分布的紧支撑极限。
- 材料陈述的贡献
- 摘要称该方法通常在大型有限样本中逐实例达到硬阈值选择范围内的最低恢复 MSE，并报告计算效率、模拟与软件实现。
- 阅读关注点
- 应核对精确达到最优值的适用条件与比较范围、噪声谱假设、不可观测量的处理，以及中等矩阵规模下的表现。
- 阅读边界
- 仅据版本未注明的 OpenAlex 索引摘要；所称最优性限于摘要描述的硬阈值选择范围，不能扩展为所有矩阵恢复方法的最优性。
原文摘要
We derive a formula for optimal hard thresholding of the singular value decomposition in the presence of correlated additive noise; although it nominally involves unobservables, we show how to apply it even where the noise covariance structure is not a priori known or is not independently estimable. The proposed method, which we call ScreeNOT, is a mathematically solid alternative to Cattell’s ever-popular but vague scree plot heuristic from 1966. ScreeNOT has a surprising oracle property: it typically achieves exactly, in large finite samples, the lowest possible MSE for matrix recovery, on each given problem instance, that is, the specific threshold it selects gives exactly the smallest achievable MSE loss among all possible threshold choices for that noisy data set and that unknown underlying true low rank model. The method is computationally efficient and robust against perturbations of the underlying covariance structure. Our results depend on the assumption that the singular values of the noise have a limiting empirical distribution of compact support; this property, which is standard in random matrix theory, is satisfied by many models exhibiting either cross-row correlation structure or cross-column correlation structure, and also by many situations with more general, interelement correlation structure. Simulations demonstrate the effectiveness of the method even at moderate matrix sizes. The paper is supplemented by ready-to-use software packages implementing the proposed algorithm: package ScreeNOT in Python (via PyPI) and R (via CRAN).