Tight Lipschitz hardness for optimizing mean field spin glasses
From MaRDI portal
Publication:6641018
DOI10.1002/cpa.22222MaRDI QIDQ6641018
Publication date: 20 November 2024
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parisi formula, disorder chaos and fluctuation for the ground state energy in the spherical mixed \(p\)-spin models
- 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
- Free energy of the spherical mean field model
- Differentiability of stochastic flow of reflected Brownian motions
- Lipschitz selections of set-valued mappings and Helly's theorem
- Sharp finiteness principles for Lipschitz selections
- On the energy landscape of the mixed even \(p\)-spin model
- The complexity of spherical \(p\)-spin models: a second moment approach
- A mathematical reformulation of Derrida's REM and GREM
- Lipschitz retracts, selectors, and extensions
- The Parisi ultrametricity conjecture
- Local algorithms for independent sets are half-optimal
- Triviality of the geometry of mixed \(p\)-spin spherical Hamiltonians with external field
- Optimization of mean-field spin glasses
- Optimal low-degree hardness of maximum independent set
- A spectral condition for spectral gap: fast mixing in high-temperature Ising models
- Average Gromov hyperbolicity and the Parisi ansatz
- The overlap gap property and approximate message passing algorithms for \(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
- Bounding flows for spherical spin glass dynamics
- The Parisi formula has a unique minimizer
- Hierarchical exchangeability of pure states in mean field spin glass models
- Extremal cuts of sparse random graphs
- A multi-scale spin-glass mean-field model
- Suboptimality of local algorithms for a class of max-cut problems
- Cugliandolo-Kurchan equations for dynamics of spin-glasses
- Complexity of random smooth functions on the high-dimensional sphere
- The Parisi formula for mixed \(p\)-spin models
- The Parisi formula
- 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
- On independent sets in random graphs
- Stochastic differential equations with reflecting boundary conditions
- On the K‐sat model with large number of clauses
- On the out-of-equilibrium relaxation of the Sherrington-Kirkpatrick model
- The Sherrington-Kirkpatrick Model
- Random Matrices and Complexity of Spin Glasses
- Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses
- Concentration of the complexity of spherical pure p-spin models at arbitrary energies
- 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
- Geometry and Temperature Chaos in Mixed Spherical Spin Glasses at Low Temperature: The Perturbative Regime
- Capacity lower bound for the Ising perceptron
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- Gibbs states and the set of solutions of random constraint satisfaction problems
- Hypercontractivity, sum-of-squares proofs, and their applications
- On lipschitz continuity of the solution mapping to the skorokhod problem, with applications
- Mean Field Models for Spin Glasses
- Mean Field Models for Spin Glasses
- Almost all graphs with average degree 4 are 3-colorable
- On multiple peaks and moderate deviations for the supremum of a Gaussian field
- Generalized TAP Free Energy
- Frozen 1-RSB structure of the symmetric Ising perceptron
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree
- Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
- The ground state energy and concentration of complexity in spherical bipartite models
- Complexity of bipartite spherical spin glasses
- Algorithmic obstructions in the random number partitioning problem
- Optimizing mean field spin glasses with external field
This page was built for publication: Tight Lipschitz hardness for optimizing mean field spin glasses