# Optimization of Mean-field Spin Glasses

arXiv: https://arxiv.org/abs/2001.00904 · HTML: https://mlsanity.com/paper/2001.00904/

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Jan 2020.

## Built on by (most cited first, 9 of 9)

- [The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials](https://mlsanity.com/paper/2106.02129/) (2021)
- [Injectivity of ReLU networks: perspectives from statistical physics](https://mlsanity.com/paper/2302.14112/) (2023)
- [High-dimensional manifold of solutions in neural networks: insights from statistical physics](https://mlsanity.com/paper/2309.09240/) (2023)
- [Unifying AMP Algorithms for Rotationally-Invariant Models](https://mlsanity.com/paper/2412.01574/) (2024)
- [Jailbreak Scaling Laws for Large Language Models: Polynomial-Exponential Crossover](https://mlsanity.com/paper/2603.11331/) (2026)
- [Binary perceptron computational gap -- a parametric fl RDT view](https://mlsanity.com/paper/2511.01037/) (2025)
- [Random Function Descent](https://mlsanity.com/paper/2305.01377/) (2023)
- [Bayesian Inference with Nonlinear Generative Models: Comments on Secure Learning](https://mlsanity.com/paper/2201.09986/) (2022)
- [Ultrametric OGP - parametric RDT symmetric binary perceptron connection](https://mlsanity.com/paper/2604.19712/) (2026)

## Abstract (arXiv)

Mean-field spin glasses are families of random energy functions (Hamiltonians) on high-dimensional product spaces. In this paper we consider the case of Ising mixed p-spin models, namely Hamiltonians HN:SigmaN→ mathbb R on the Hamming hypercube SigmaN = ± 1N, which are defined by the property that HN(boldsymbol σ)_boldsymbol σ∈ SigmaN is a centered Gaussian process with covariance mathbb EHN(boldsymbol σ1)HN(boldsymbol σ2) depending only on the scalar product langle boldsymbol σ1,boldsymbol σ2rangle. The asymptotic value of the optimum max_boldsymbol σ∈ SigmaNHN(boldsymbol σ) was characterized in terms of a variational principle known as the Parisi formula, first proved by Talagrand and, in a more general setting, by Panchenko. The structure of superlevel sets is extremely rich and has been studied by a number of authors. Here we ask whether a near optimal configuration boldsymbol σ can be computed in polynomial time. We develop a message passing algorithm whose complexity per-iteration is of the same order as the complexity of evaluating the gradient of HN, and characterize the typical energy value it achieves. When the p-spin model HN satisfies a certain no-overlap gap assumption, for any varepsilon>0, the algorithm outputs boldsymbol σ∈SigmaN such that HN(boldsymbol σ)≥ (1-varepsilon)max_boldsymbol σ' HN(boldsymbol σ'), with high probability. The number of iterations is bounded in N and depends uniquely on varepsilon. More generally, regardless of whether the no-overlap gap assumption holds, the energy achieved is given by an extended variational principle, which generalizes the Parisi formula.