The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity

The description of a random field by means of conditional probabilities and conditions of its regularity

Roland Lvovich Dobrushin · 1968

Earlier work this paper cites.

The statistics of curie-weiss models

Richard S Ellis and Charles M Newman · 1978

Earlier work this paper cites.

A mean field theory learning algorithm for neural networks

James Anderson and Carsten Peterson · 1987

Earlier work this paper cites.

Statistical field theory

Giorgio Parisi · 1988

Earlier work this paper cites.

Polynomial-time approximation algorithms for ising model (extended abstract)

M. Jerrum and A. Sinclair · 1990

Earlier work this paper cites.

Improving the mean field approximation via the use of mixture distributions

Tommi S Jaakkola and Michael I Jordan · 1998

Earlier work this paper cites.

Quick approximation to matrices and applications

Alan Frieze and Ravi Kannan · 1999

Earlier work this paper cites.

Sublinear time algorithms for metric space problems

Piotr Indyk · 1999

Earlier work this paper cites.

An introduction to variational methods for graphical models

Michael I Jordan, Zoubin Ghahramani, Tommi S Jaakkola, and Lawrence K Saul · 1999

Earlier work this paper cites.

Statistical mechanics, three-dimensionality and np-completeness: I. universality of intracatability for the partition function of the ising model across non-planar surfaces (extended abstract)

Sorin Istrail · 2000

Earlier work this paper cites.

Random sampling and approximation of MAX-CSP problems

Noga Alon, Fernandez de la Vega, Ravi Kannan, and Marek Karpinski · 2002

Cited alongside, same era.

Loopy belief propagation and gibbs measures

S. Tatikonda and M. I. Jordan · 2002

Cited alongside, same era.

Random sampling and approximation of MAX-CSPs

Noga Alon, Fernandez de la Vega, Ravi Kannan, and Marek Karpinski · 2003

Cited alongside, same era.

Hardness of fully dense problems

Nir Ailon and Noga Alon · 2007

Cited alongside, same era.

Entropy, large deviations, and statistical mechanics

Richard S. Ellis · 2007

Cited alongside, same era.

The complexity of ferromagnetic ising with local fields

Eslie Ann Goldberg and Mark Jerrum · 2007

Cited alongside, same era.

Geometric algorithms and combinatorial optimization

Martin Grötschel, László Lovász, and Alexander Schrijver · 2012

Later among the works it cites.

The computational hardness of counting in two-spin models on d-regular graphs

Allan Sly and Nike Sun · 2012

Later among the works it cites.

A new regularity lemma and faster approximation algorithms for low threshold rank graphs

Shayan Oveis Gharan and Luca Trevisan · 2013

Later among the works it cites.

Exact thresholds for ising–gibbs samplers on general graphs

Elchanan Mossel and Allan Sly · 2013

Later among the works it cites.

How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods

Andrej Risteski · 2016

Later among the works it cites.

Universality of the mean-field for the potts model

Anirban Basak and Sumit Mukherjee · 2017