From Graphical Lasso to Atomic Norms: High-Dimensional Pattern Recovery
从图套索到原子范数:高维模式恢复AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论高维精度矩阵估计与原子范数惩罚的统计理论,属于高维统计方法,未涉及所给微观、宏观或金融领域细分的具体应用场景,故不选择。
从图套索到原子范数:高维模式恢复AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study high-dimensional precision-matrix estimation with polyhedral atomic-norm penalties on the off-diagonal entries. This framework covers the graphical lasso, $\ell_\infty$-type penalties, SLOPE/OWL penalties, and penalties motivated by colored graphical models. We define the target pattern through the subdifferential face of the dual ball and derive sufficient conditions for exact pattern recovery from the sample covariance matrix. Our analysis introduces two geometric thresholds, a generalized irrepresentability condition, and extends the primal-dual witness method beyond the $\ell_1$ setting. For the graphical lasso, our results yield weaker covariance-deviation requirements and a less restrictive irrepresentability condition than existing theory, leading to sharper asymptotic guarantees. Numerical experiments for several graph topologies show that the resulting bounds are often close to the empirical recovery threshold.