Notes on computational-to-statistical gaps: predictions using statistical physics

03/29/2018
by   Afonso S. Bandeira, et al.
0

In these notes we describe heuristics to predict computational-to-statistical gaps in certain statistical problems. These are regimes in which the underlying statistical problem is information-theoretically possible although no efficient algorithm exists, rendering the problem essentially unsolvable for large instances. The methods we describe here are based on mature, albeit non-rigorous, tools from statistical physics. These notes are based on a lecture series given by the authors at the Courant Institute of Mathematical Sciences in New York City, on May 16th, 2017.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2023

Kernels, Data Physics

Lecture notes from the course given by Professor Julia Kempe at the summ...
research
06/14/2018

The committee machine: Computational to statistical gaps in learning a two-layers neural network

Heuristic tools from statistical physics have been used in the past to l...
research
06/28/2023

Sparse Representations, Inference and Learning

In recent years statistical physics has proven to be a valuable tool to ...
research
06/22/2021

Large N limit of the knapsack problem

In the simplest formulation of the knapsack problem, one seeks to maximi...
research
08/28/2019

Lecture Notes: Selected topics on robust statistical learning theory

These notes gather recent results on robust statistical learning theory....
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
01/03/2023

Deep Learning and Computational Physics (Lecture Notes)

These notes were compiled as lecture notes for a course developed and ta...

Please sign up or login with your details

Forgot password? Click here to reset