Optimizing mean field spin glasses with external field

DOI10.1214/23-ejp1066arXiv2105.03506OpenAlexW3163256724MaRDI QIDQ6186448

Mark Sellke

Publication date: 2 February 2024

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.03506

zbMATH Keywords

optimizationspin glassesapproximate message passing

Mathematics Subject Classification ID

Gaussian processes (60G15)

Related Items

Optimization algorithms for multi-species spherical spin glasses

Cites Work

• The Aizenman-Sims-Starr scheme and Parisi formula for mixed \(p\)-spin spherical models
• An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
• Parisi formula, disorder chaos and fluctuation for the ground state energy in the spherical mixed \(p\)-spin models
• Low temperature asymptotics of spherical mean field spin glasses
• Parisi formula for the ground state energy in the mixed \(p\)-spin model
• Free energy of the spherical mean field model
• Recovering symbolically dated, rooted trees from symbolic ultrametrics
• On the energy landscape of the mixed even \(p\)-spin model
• Spectral gap estimates in mean field spin glasses
• The complexity of spherical \(p\)-spin models: a second moment approach
• Finding a large submatrix of a Gaussian random matrix
• Local algorithms for independent sets are half-optimal
• Universality of approximate message passing algorithms
• The overlap gap property in principal submatrix recovery
• Optimization of mean-field spin glasses
• Optimal low-degree hardness of maximum independent set
• Approximate message passing algorithms for rotationally invariant matrices
• Average Gromov hyperbolicity and the Parisi ansatz
• The generalized TAP free energy. II
• The overlap gap property and approximate message passing algorithms for \(p\)-spin models
• Approximate ground states of hypercube spin glasses are near corners
• The Parisi formula has a unique minimizer
• Universality in polytope phase transitions and message passing algorithms
• Suboptimality of local algorithms for a class of max-cut problems
• Complexity of random smooth functions on the high-dimensional sphere
• The Parisi formula for mixed \(p\)-spin models
• The Parisi formula
• Algorithmic pure states for the negative spherical perceptron
• A dynamic programming approach to the Parisi functional
• Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem
• Approximate Ultrametricity for Random Measures and Applications to Spin Glasses
• Exact theory of dense amorphous hard spheres in high dimension. III. The full replica symmetry breaking solution
• Accelerated Methods for NonConvex Optimization
• Asymptotic mutual information for the balanced binary stochastic block model
• Random Matrices and Complexity of Spin Glasses
• Finding approximate local minima faster than gradient descent
• Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses
• On Nonconvex Optimization for Machine Learning
• The SK Model Is Infinite Step Replica Symmetry Breaking at Zero Temperature
• Geometry and Temperature Chaos in Mixed Spherical Spin Glasses at Low Temperature: The Perturbative Regime
• State evolution for general approximate message passing algorithms, with applications to spatial coupling
• The Landscape of the Spiked Tensor Model
• The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
• Hypercontractivity, sum-of-squares proofs, and their applications
• On the solution‐space geometry of random constraint satisfaction problems
• On multiple peaks and moderate deviations for the supremum of a Gaussian field