pith. machine review for the scientific record. sign in

arxiv: 1803.11132 · v2 · submitted 2018-03-29 · 📊 stat.ML · cs.DS· cs.LG

Recognition: unknown

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

Authors on Pith no claims yet
classification 📊 stat.ML cs.DScs.LG
keywords statisticalnotescomputational-to-statisticaldescribegapsphysicsproblemalbeit
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

    cs.DS 2026-05 unverdicted novelty 7.0

    Online algorithms achieve multiplicative approximation r^{1/(r-1)} for maximum independent sets in dense r-uniform ER hypergraphs and (max γ_i)^{-1/(r-1)} for balanced sets in r-partite versions, with matching lower bounds.