arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.09727math.STcond-mat.stat-mechcs.CCcs.DSstat.MLstat.TH
收藏

高维统计中的Franz-Parisi准则与计算折衷

The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics

Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik

摘要:

许多高维统计推断问题被认为具有固有的计算困难。已经提出了各种框架来为这种困难提供严格的证据,包括针对限制计算模型(如低次函数)的下界,以及基于自由能景观的统计物理学方法。本文旨在建立一个严格的连接之间的看似不同的低程度和自由能为基础的方法。我们定义了一个基于自由能的硬度标准,并正式将其连接到广泛的一类统计问题,即所有高斯加性模型和某些模型与稀疏种植信号的低硬度的既定概念。通过利用这些严格的连接,我们能够:建立高斯加性模型的“代数”概念的低度硬度意味着失败的“几何”本地MCMC算法,并提供新的低度下界稀疏线性回归,这似乎很难直接证明。这些结果提供了概念上的见解不同的硬度概念之间的联系,以及具体的技术工具,如新的方法证明低度下界。

英文摘要:

Many high-dimensional statistical inference problems are believed to possess inherent computational hardness. Various frameworks have been proposed to give rigorous evidence for such hardness, including lower bounds against restricted models of computation (such as low-degree functions), as well as methods rooted in statistical physics that are based on free energy landscapes. This paper aims to make a rigorous connection between the seemingly different low-degree and free-energy based approaches. We define a free-energy based criterion for hardness and formally connect it to the well-established notion of low-degree hardness for a broad class of statistical problems, namely all Gaussian additive models and certain models with a sparse planted signal. By leveraging these rigorous connections we are able to: establish that for Gaussian additive models the "algebraic" notion of low-degree hardness implies failure of "geometric" local MCMC algorithms, and provide new low-degree lower bounds for sparse linear regression which seem difficult to prove directly. These results provide both conceptual insights into the connections between different notions of hardness, as well as concrete technical tools such as new methods for proving low-degree lower bounds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑