Algorithmic pure states for the negative spherical perceptron

DOI10.1007/s10955-022-02976-6OpenAlexW3096771845WikidataQ114225297 ScholiaQ114225297MaRDI QIDQ2675362

Ahmed El Alaoui, Mark Sellke

Publication date: 23 September 2022

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

constraint satisfactionmessage passing algorithmsfull replica symmetry breakingspherical perceptron

Mathematics Subject Classification ID

Equilibrium statistical mechanics (82Bxx) Time-dependent statistical mechanics (dynamic and nonequilibrium) (82Cxx) Applications of statistical mechanics to specific types of physical systems (82Dxx)

Related Items (2)

Optimization algorithms for multi-species spherical spin glasses ⋮ Optimizing mean field spin glasses with external field

Cites Work

• Unnamed Item
• An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
• Rigorous solution of the Gardner problem
• Optimization of mean-field spin glasses
• The algorithmic hardness threshold for continuous random energy models
• Exact bounds on the inverse Mills ratio and its derivatives
• Universality in polytope phase transitions and message passing algorithms
• 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
• Constructive Discrepancy Minimization for Convex Sets
• The simplest model of jamming
• A Morita Type Proof of the Replica-Symmetric Formula for SK
• Exact theory of dense amorphous hard spheres in high dimension. III. The full replica symmetry breaking solution
• On‐line balancing of random inputs
• Six Standard Deviations Suffice
• Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses
• State evolution for approximate message passing with non-separable functions
• Storage capacity in symmetric binary perceptrons
• An improved cutting plane method for convex optimization, convex-concave games, and its applications
• Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
• Optimization of the Sherrington--Kirkpatrick Hamiltonian
• State evolution for general approximate message passing algorithms, with applications to spatial coupling
• Capacity lower bound for the Ising perceptron
• The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
• The space of interactions in neural network models
• Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
• Some Inequalities on Mill's Ratio and Related Functions
• Surfing on minima of isostatic landscapes: avalanches and unjamming transition
• Mean Field Models for Spin Glasses
• Frozen 1-RSB structure of the symmetric Ising perceptron

This page was built for publication: Algorithmic pure states for the negative spherical perceptron