Optimization of mean-field spin glasses
From MaRDI portal
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Dynamics of disordered systems (random Ising systems, etc.) in time-dependent statistical mechanics (82C44)
Recommendations
- Optimizing mean field spin glasses with external field
- Optimization algorithms for multi-species spherical spin glasses
- Recent results on the energy landscapes of mean field spin glasses
- Optimization on sparse random hypergraphs and spin glasses
- The overlap gap property and approximate message passing algorithms for \(p\)-spin models
Cites work
- A dynamic programming approach to the Parisi functional
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
- An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
- Approximate ground states of hypercube spin glasses are near corners
- Course 7 Computing the number of metastable states in infinite-range models
- Determining computational complexity from characteristic ``phase transitions
- Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses
- Gibbs states and the set of solutions of random constraint satisfaction problems
- Gradient descent dynamics in the mixed p-spin spherical model: finite-size simulations and comparison with mean-field integration
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 1751767 (Why is no real title available?)
- Hypercontractivity, sum-of-squares proofs, and their applications
- Information, Physics, and Computation
- Lifting sum-of-squares lower bounds: degree-2 to degree-4
- Limits of local algorithms over sparse random graphs
- On the energy landscape of the mixed even \(p\)-spin model
- On the out-of-equilibrium relaxation of the Sherrington-Kirkpatrick model
- Parisi formula for the ground state energy in the mixed \(p\)-spin model
- Performance of sequential local algorithms for the random NAE-K-SAT problem
- Random matrices and complexity of spin glasses
- State evolution for approximate message passing with non-separable functions
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- Suboptimality of local algorithms for a class of max-cut problems
- Sum-of-squares certificates for maxima of random tensors on the sphere
- The Aizenman-Sims-Starr scheme and Parisi formula for mixed \(p\)-spin spherical models
- The algorithmic hardness threshold for continuous random energy models
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The overlap gap property and approximate message passing algorithms for \(p\)-spin models
- The Parisi formula
- The Parisi formula has a unique minimizer
- The Parisi ultrametricity conjecture
- The Sherrington-Kirkpatrick model
- Universality in polytope phase transitions and message passing algorithms
Cited in
(38)- Spin glasses and nonlinear constraints in portfolio optimization
- Optimal low-degree hardness of maximum independent set
- Approximate message passing algorithms for rotationally invariant matrices
- Approximate ground states of hypercube spin glasses are near corners
- Algorithmic pure states for the negative spherical perceptron
- Disordered systems insights on computational hardness
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- Generalized TAP Free Energy
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree
- Optimization algorithms for multi-species spherical spin glasses
- Shattering versus metastability in spin glasses
- Optimizing mean field spin glasses with external field
- Tractability from overparametrization: the example of the negative perceptron
- On the TAP equations via the cavity approach in the generic mixed \(p\)-spin models
- Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
- Optimization of Mean-field Spin Glasses
- A review on quantum approximate optimization algorithm and its variants
- On weak ergodicity breaking in mean-field spin glasses
- The threshold energy of low temperature Langevin dynamics for pure spherical spin glasses
- Tight Lipschitz hardness for optimizing mean field spin glasses
- On the free energy of vector spin glasses with nonconvex interactions
- Strong topological trivialization of multi-species spherical spin glasses
- Near-optimal shattering in the Ising pure p-spin and rarity of solutions returned by stable algorithms
- The spherical p+s spin glass at zero temperature
- Un-inverting the Parisi formula
- Shattering in the Ising p-spin glass model
- A leave-one-out approach to approximate message passing
- On marginal stability in low temperature spherical spin glasses
- Sampling from mean-field Gibbs measures via diffusion processes
- On the topology of solutions to random continuous constraint satisfaction problems
- On the Parisi measures of the spherical mixed p-spin glass at zero temperature
- Efficient approximation of the CREM Gibbs measure and the hardness threshold
- Injectivity of ReLU networks: perspectives from statistical physics
- Stein's method for the TAP equations an iterative scheme for the SK model
- Pseudo-maximum likelihood theory for high-dimensional rank one inference
- Sharp phase transitions for the overlap gap property
- Sharp thresholds for the overlap gap property: Ising p-spin Glass and random k-SAT
- Fourier analysis of iterative algorithms
This page was built for publication: Optimization of mean-field spin glasses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072085)
