A Non-Asymptotic Class of Dense Precision Matrix Estimators: Complexity, Signal and Double Descent
稠密精度矩阵估计的非渐近框架:复杂度、信号与双重下降AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要核心是通用精度矩阵理论;标普指数和夏普比率应用不足以确定其属于资产定价、金融因子或风险细分。
稠密精度矩阵估计的非渐近框架:复杂度、信号与双重下降AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Precision matrix estimation is a cornerstone concept in statistics, economics, and finance. Despite advances in recent years, estimation methods that are simultaneously (i) dense, (ii) consistent, and (iii) model-free are lacking. While each of these targets can be met separately, achieving them together is challenging.We address this gap by introducing a general class of estimators that unifies these features within a nonasymptotic framework, allowing for explicit characterization of the computational complexity, signal-to-noise ratio trade-off. Our analysis identifies three fundamental random quantities, complexity, signal magnitude, and method bias that jointly determine estimation error. A particularly striking result is that ridgeless regression, a tuning-free special case within our class, exhibits the double descent phenomenon. This establishes the first formal precision matrix analogue to the well-known double descent behavior in linear regression. Our theoretical analysis is supported by a thorough empirical study of the S\&P 500 index, where we observe a doubly ascending Sharpe ratio pattern, which complements the double descent phenomenon.