Fetching the paper…
Reading the bibliography…
The free energy is a key quantity of interest in Ising models, but unfortunately, computing it in general is computationally intractable.
On the distribution of the roots of certain symmetric matrices
Wigner, E. P. (1958) · 1958
Earlier work this paper cites.
Solvable model of a spin-glass
Kirkpatrick, S. and Sherrington, D. (1975) · 1975
Earlier work this paper cites.
The statistics of curie-weiss models
Ellis, R. S. and Newman, C. M. (1978) · 1978
Earlier work this paper cites.
Some rigorous results on the sherrington-kirkpatrick spin glass model
Aizenman, M., Lebowitz, J. L., and Ruelle, D. (1987) · 1987
Earlier work this paper cites.
A mean field theory learning algorithm for neural networks
Anderson, J. and Peterson, C. (1987) · 1987
Earlier work this paper cites.
Spin glass theory and beyond: An Introduction to the Replica Method and Its Applications
Mézard, M., Parisi, G., and Virasoro, M. (1987) · 1987
Earlier work this paper cites.
Statistical field theory
Parisi, G. (1988) · 1988
Earlier work this paper cites.
Optimization, approximation, and complexity classes
Papadimitriou, C. H. and Yannakakis, M. (1991) · 1991
Earlier work this paper cites.
Quick approximation to matrices and applications
Frieze, A. and Kannan, R. (1999) · 1999
Earlier work this paper cites.
An introduction to variational methods for graphical models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., and Saul, L. K. (1999) · 1999
Earlier work this paper cites.
A note on the decay of correlations under δ \delta -pinning
Ioffe, D. and Velenik, Y. (2000) · 2000
Earlier work this paper cites.
Approximation complexity of nondense instances of max-cut
de la Vega, F. and Karpinski, M. (2006) · 2006
Cited alongside, same era.
Hardness of fully dense problems
Ailon, N. and Alon, N. (2007) · 2007
Cited alongside, same era.
Linear programming relaxations of maxcut
de la Vega, W. F. and Kenyon-Mathieu, C. (2007) · 2007
Cited alongside, same era.
The pcp theorem by gap amplification
Dinur, I. (2007) · 2007
Cited alongside, same era.
Yet another algorithm for dense max cut: Go greedy
Mathieu, C. and Schudy, W. (2008) · 2008
Cited alongside, same era.
Graphical models, exponential families, and variational inference
Wainwright, M. J. and Jordan, M. I. (2008) · 2008
Cited alongside, same era.
Approximating csps with global cardinality constraints using sdp hierarchies
Raghavendra, P. and Tan, N. (2012) · 2012
Later among the works it cites.
The computational hardness of counting in two-spin models on d-regular graphs
Sly, A. and Sun, N. (2012) · 2012
Later among the works it cites.
The Sherrington-Kirkpatrick model
Panchenko, D. (2013) · 2013
Later among the works it cites.
Approximation schemes via sherali-adams hierarchy for dense constraint satisfaction problems and assignment problems
Yoshida, Y. and Zhou, Y. (2014) · 2014
Later among the works it cites.
Conditioning and covariance on caterpillars
Allen, S. R. and O’Donnell, R. (2015) · 2015
Later among the works it cites.
Gaussian-width gradient complexity, reverse log-sobolev inequalities and nonlinear large deviations
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dembo, A. and Montanari, A. (2010) · 2010
Cited alongside, same era.
Rounding semidefinite programming hierarchies via global correlation
Barak, B., Raghavendra, P., and Steurer, D. (2011) · 2011
Cited alongside, same era.
Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with PSD objectives
Guruswami, V. and Sinop, A. K. (2011) · 2011
Cited alongside, same era.
Convergent sequences of dense graphs ii. multiway cuts and statistical physics
Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T., and Vesztergombi, K. (2012) · 2012
Cited alongside, same era.
Geometric algorithms and combinatorial optimization
Grötschel, M., Lovász, L., and Schrijver, A. (2012) · 2012
Cited alongside, same era.
The mean-field approximation: Information inequalities, algorithms, and complexity
Jain, V., Koehler, F., and Mossel, E. (2018a)
Cited in the paper.
Eldan, R. (2016) · 2016
Later among the works it cites.
Sub-exponential approximation schemes for csps: From dense to almost sparse
Fotakis, D., Lampis, M., and Paschos, V. T. (2016) · 2016
Later among the works it cites.
How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods
Risteski, A. (2016) · 2016
Later among the works it cites.
Universality of the mean-field for the potts model
Basak, A. and Mukherjee, S. (2017) · 2017
Later among the works it cites.
Bethe states of random factor graphs
Coja-Oghlan, A. and Perkins, W. (2017) · 2017
Later among the works it cites.
A birthday repetition theorem and complexity of approximating dense csps
Manurangsi, P. and Raghavendra, P. (2017) · 2017
Later among the works it cites.