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

05/19/2022
by   Afonso S. Bandeira, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/08/2022

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes

We study the complexity of the reachability problem for Vector Addition ...
research
10/15/2022

Disordered Systems Insights on Computational Hardness

In this review article, we discuss connections between the physics of di...
research
09/13/2020

Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent

Researchers currently use a number of approaches to predict and substant...
research
07/26/2019

Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio

These notes survey and explore an emerging method, which we call the low...
research
11/10/2022

Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials

Suppose we are given an n-dimensional order-3 symmetric tensor T ∈ (ℝ^n)...
research
06/18/2020

Free Energy Wells and Overlap Gap Property in Sparse PCA

We study a variant of the sparse PCA (principal component analysis) prob...
research
02/21/2018

Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling

Pebble games were originally formulated to study time-space tradeoffs in...

Please sign up or login with your details

Forgot password? Click here to reset