Computational barriers to estimation from low-degree polynomials
低次多项式估计的计算障碍AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：植入子图属于通用结构恢复问题，摘要未涉及经济网络互动、干扰或所列因子模型。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
低次多项式估计的计算障碍
- 研究问题
- 在带噪高维数据中恢复隐藏结构时，低次多项式估计能够达到怎样的均方误差，恢复是否可能比检测更困难？
- 方法与思路
- 作者将低次多项式分析从检测扩展到估计和恢复，为一大类信号加噪声问题推导任意指定次数多项式的误差下界。
- 材料陈述的贡献
- 摘要称，文章刻画植入子矩阵和稠密子图问题的低次最小均方误差，并展示检测容易但恢复具有低次计算障碍的情形。
- 阅读关注点
- 应核对信号与噪声模型、多项式次数如何增长、上下界匹配范围，以及低次计算限制与一般算法复杂度的关系。
- 阅读边界
- 仅据 OpenAlex 索引摘要，稿件版本未注明；结论限定于低次多项式框架，不能据此证明所有多项式时间算法都失败。
原文摘要
One fundamental goal of high-dimensional statistics is to detect or recover planted structure (such as a low-rank matrix) hidden in noisy data. A growing body of work studies low-degree polynomials as a restricted model of computation for such problems: it has been demonstrated in various settings that low-degree polynomials of the data can match the statistical performance of the best known polynomial-time algorithms. Prior work has studied the power of low-degree polynomials for the task of detecting the presence of hidden structures. In this work, we extend these methods to address problems of estimation and recovery (instead of detection). For a large class of “signal plus noise” problems, we give a user-friendly lower bound for the best possible mean squared error achievable by any degree-D polynomial. To our knowledge, these are the first results to establish low-degree hardness of recovery problems for which the associated detection problem is easy. As applications, we give a tight characterization of the low-degree minimum mean squared error for the planted submatrix and planted dense subgraph problems, resolving (in the low-degree framework) open problems about the computational complexity of recovery in both cases.