Optimization of the Sherrington--Kirkpatrick Hamiltonian

DOI10.1137/20M132016XMaRDI QIDQ5149754

No author found.

Publication date: 8 February 2021

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

spin glassesmessage passing algorithmsreplica symmetry breakingSherrington-Kirkpatrick

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)

Related Items (13)

The Random QUBO ⋮ Algorithmic pure states for the negative spherical perceptron ⋮ Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree ⋮ Ultrametricity in spin glasses ⋮ Optimization algorithms for multi-species spherical spin glasses ⋮ Shattering versus metastability in spin glasses ⋮ Replica-symmetry breaking transitions in the large deviations of the ground-state of a spherical spin-glass ⋮ Tractability from overparametrization: the example of the negative perceptron ⋮ On the TAP equations via the cavity approach in the generic mixed \(p\)-spin models ⋮ Approximate ground states of hypercube spin glasses are near corners ⋮ Computing the partition function of the Sherrington-Kirkpatrick model is hard on average ⋮ On convergence of the cavity and Bolthausen's TAP iterations to the local magnetization ⋮ The overlap gap property in principal submatrix recovery

Cites Work

• Unnamed Item
• An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
• Variational representations for the Parisi functional and the two-dimensional Guerra-Talagrand bound
• Parisi formula for the ground state energy in the mixed \(p\)-spin model
• Construction of pure states in mean field models for spin glasses
• Broken replica symmetry bounds in the mean field spin glass model
• The Parisi ultrametricity conjecture
• The algorithmic hardness threshold for continuous random energy models
• The Parisi formula has a unique minimizer
• Universality in polytope phase transitions and message passing algorithms
• Parisi measures
• Extremal cuts of sparse random graphs
• Universality in Sherrington-Kirkpatrick's spin glass model
• The Parisi formula
• Statistical Mechanics of Learning
• A dynamic programming approach to the Parisi functional
• Analysis of the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>∞</mml:mi></mml:math>-replica symmetry breaking solution of the Sherrington-Kirkpatrick model
• Information, Physics, and Computation
• An Introduction to Random Matrices
• Statistical Physics of Spin Glasses and Information Processing
• On the out-of-equilibrium relaxation of the Sherrington-Kirkpatrick model
• The Sherrington-Kirkpatrick Model
• State evolution for approximate message passing with non-separable functions
• The SK Model Is Infinite Step Replica Symmetry Breaking at Zero Temperature
• State evolution for general approximate message passing algorithms, with applications to spatial coupling
• The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
• Semidefinite programs on sparse random graphs and their application to community detection
• A CDMA multiuser detection algorithm on the basis of belief propagation
• Limits of local algorithms over sparse random graphs
• Optimal Transport
• Stochastic differential equations. An introduction with applications.

This page was built for publication: Optimization of the Sherrington--Kirkpatrick Hamiltonian