Fetching the paper…
Reading the bibliography…
We consider the Hamiltonians of mean-field spin glasses, which are certain random functions $H_N$ defined on high-dimensional cubes or spheres in $\mathbb R^N$.
Solvable model of a spin-glass
David Sherrington and Scott Kirkpatrick · 1975
Earlier work this paper cites.
The spherical p-spin interaction spin glass model: the statics
Andrea Crisanti and H-J Sommers · 1992
Earlier work this paper cites.
Recovering symbolically dated, rooted trees from symbolic ultrametrics
Sebastian Böcker and Andreas WM Dress · 1998
Earlier work this paper cites.
On non-approximability for quadratic programs
Sanjeev Arora, Eli Berger, Hazan Elad, Guy Kindler, and Muli Safra · 2005
Earlier work this paper cites.
Clustering of solutions in the random satisfiability problem
Marc Mézard, Thierry Mora, and Riccardo Zecchina · 2005
Earlier work this paper cites.
Free energy of the spherical mean field model
Michel Talagrand · 2006
Earlier work this paper cites.
The Parisi formula
Michel Talagrand · 2006
Earlier work this paper cites.
Disorder chaos and multiple valleys in spin glasses
Sourav Chatterjee · 2009
Earlier work this paper cites.
On the solution-space geometry of random constraint satisfaction problems
Dimitris Achlioptas, Amin Coja-Oghlan, and Federico Ricci-Tersenghi · 2011
Earlier work this paper cites.
The dynamics of message passing on dense graphs, with applications to compressed sensing
Mohsen Bayati and Andrea Montanari · 2011
Earlier work this paper cites.
Hypercontractivity, sum-of-squares proofs, and their applications
Boaz Barak, Fernando GSL Brandao, Aram W Harrow, Jonathan Kelner, David Steurer, and Yuan Zhou · 2012
Earlier work this paper cites.
Complexity of random smooth functions on the high-dimensional sphere
Antonio Auffinger and Gérard Ben Arous · 2013
Earlier work this paper cites.
Random matrices and complexity of spin glasses
Auffinger, Antonio and Ben Arous, Gérard and Cernỳ, Jirí · 2013
Earlier work this paper cites.
The Aizenman-Sims-Starr scheme and Parisi formula for mixed
Wei-Kuo Chen · 2013
Earlier work this paper cites.
State evolution for general approximate message passing algorithms, with applications to spatial coupling
Adel Javanmard and Andrea Montanari · 2013
Earlier work this paper cites.
An iterative construction of solutions of the TAP equations for the Sherrington–Kirkpatrick model
Erwin Bolthausen · 2014
Earlier work this paper cites.
Exact theory of dense amorphous hard spheres in high dimension. iii. the full replica symmetry breaking solution
Patrick Charbonneau, Jorge Kurchan, Giorgio Parisi, Pierfrancesco Urbani, and Francesco Zamponi · 2014
Earlier work this paper cites.
Limits of local algorithms over sparse random graphs
David Gamarnik and Madhu Sudan · 2014
Earlier work this paper cites.
The Parisi formula for mixed
Dmitry Panchenko · 2014
Earlier work this paper cites.
The Parisi formula has a unique minimizer
Antonio Auffinger and Wei-Kuo Chen · 2015
Earlier work this paper cites.
Universality in polytope phase transitions and message passing algorithms
Mohsen Bayati, Marc Lelarge, and Andrea Montanari · 2015
Earlier work this paper cites.
On multiple peaks and moderate deviations for the supremum of a gaussian field
Jian Ding, Ronen Eldan, Alex Zhai, et al · 2015
Earlier work this paper cites.
A dynamic programming approach to the Parisi functional
Aukosh Jagannath and Ian Tobasco · 2016
Cited alongside, same era.
Finding approximate local minima faster than gradient descent
Naman Agarwal, Zeyuan Allen-Zhu, Brian Bullins, Elad Hazan, and Tengyu Ma · 2017
Cited alongside, same era.
Parisi formula for the ground state energy in the mixed
Antonio Auffinger and Wei-Kuo Chen · 2017
Cited alongside, same era.
“Convex until proven guilty”: Dimension-free acceleration of gradient descent on non-convex functions
Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford · 2017
Cited alongside, same era.
Parisi formula, disorder chaos and fluctuation for the ground state energy in the spherical mixed p-spin models
Wei-Kuo Chen and Arnab Sen · 2017
Cited alongside, same era.
Asymptotic mutual information for the balanced binary stochastic block model
Suboptimality of local algorithms for a class of max-cut problems
Wei-Kuo Chen, David Gamarnik, Dmitry Panchenko, and Mustazee Rahman · 2019
Later among the works it cites.
The landscape of the planted clique problem: Dense subgraphs and the overlap gap property
David Gamarnik and Ilias Zadik · 2019
Later among the works it cites.
Optimization of the Sherrington-Kirkpatrick Hamiltonian
Andrea Montanari · 2019
Later among the works it cites.
The SK model is infinite step replica symmetry breaking at zero temperature
Antonio Auffinger, Wei-Kuo Chen, and Qiang Zeng · 2020
Later among the works it cites.
Algorithmic thresholds in mean field spin glasses
Ahmed El Alaoui and Andrea Montanari · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yash Deshpande, Emmanuel Abbe, and Andrea Montanari · 2017
Cited alongside, same era.
Performance of sequential local algorithms for the random NAE-K-SAT problem
David Gamarnik and Madhu Sudan · 2017
Cited alongside, same era.
Sparse high-dimensional linear regression. algorithmic barriers and a local search algorithm
David Gamarnik and Ilias Zadik · 2017
Cited alongside, same era.
Approximate ultrametricity for random measures and applications to spin glasses
Aukosh Jagannath · 2017
Cited alongside, same era.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Cited alongside, same era.
Low temperature asymptotics of spherical mean field spin glasses
Aukosh Jagannath and Ian Tobasco · 2017
Cited alongside, same era.
Local algorithms for independent sets are half-optimal
Mustazee Rahman and Balint Virag · 2017
Cited alongside, same era.
Ahmed El Alaoui and Mark Sellke · 2020
Later among the works it cites.
Geometry and temperature chaos in mixed spherical spin glasses at low temperature: the perturbative regime
Gérard Ben Arous, Eliran Subag, and Ofer Zeitouni · 2020
Later among the works it cites.
Free energy wells and overlap gap property in sparse PCA
Gérard Ben Arous, Alexander S Wein, and Ilias Zadik · 2020
Later among the works it cites.
Low-degree hardness of random optimization problems
David Gamarnik, Aukosh Jagannath, and Alexander S Wein · 2020
Later among the works it cites.
Optimization of mean-field spin glasses
Ahmed El Alaoui, Andrea Montanari, and Mark Sellke · 2021
Closest in time.
Universality of approximate message passing algorithms
Wei-Kuo Chen and Wai-Kit Lam · 2021
Closest in time.
The generalized TAP free energy
Wei-Kuo Chen, Dmitry Panchenko, and Eliran Subag · 2021
Closest in time.
The generalized TAP free energy II
Wei-Kuo Chen, Dmitry Panchenko, and Eliran Subag · 2021
Closest in time.
Average Gromov hyperbolicity and the Parisi ansatz
Sourav Chatterjee and Leila Sloman · 2021
Closest in time.
The overlap gap property and approximate message passing algorithms for
David Gamarnik and Aukosh Jagannath · 2021
Closest in time.
The overlap gap property in principal submatrix recovery
David Gamarnik, Aukosh Jagannath, and Subhabrata Sen · 2021
Closest in time.
Tight Lipschitz Hardness for Optimizing Mean Field Spin Glasses
Brice Huang and Mark Sellke · 2021
Closest in time.
Approximate ground states of hypercube spin glasses are near corners
Mark Sellke · 2021
Closest in time.
Following the ground states of full-RSB spherical spin glasses
Eliran Subag · 2021
Closest in time.
Approximate message passing algorithms for rotationally invariant matrices
Zhou Fan · 2022
Closest in time.
Optimal low-degree hardness of maximum independent set
Alexander S Wein · 2022
Closest in time.