Algorithmic pure states for the negative spherical perceptron
From MaRDI portal
Publication:2675362
Cites work
- A dynamic programming approach to the Parisi functional
- A Morita type proof of the replica-symmetric formula for SK
- An improved cutting plane method for convex optimization, convex-concave games, and its applications
- An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
- Analysis of the -replica symmetry breaking solution of the Sherrington-Kirkpatrick model
- Capacity lower bound for the Ising perceptron
- Constructive Discrepancy Minimization for Convex Sets
- Exact bounds on the inverse Mills ratio and its derivatives
- Exact theory of dense amorphous hard spheres in high dimension. III: The full replica symmetry breaking solution
- Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses
- Frozen 1-RSB structure of the symmetric Ising perceptron
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Mean field models for spin glasses. Volume I: Basic examples.
- On-line balancing of random inputs
- Optimization of mean-field spin glasses
- Optimization of the Sherrington--Kirkpatrick Hamiltonian
- Rigorous solution of the Gardner problem
- Six Standard Deviations Suffice
- Some Inequalities on Mill's Ratio and Related Functions
- Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
- State evolution for approximate message passing with non-separable functions
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- Storage capacity in symmetric binary perceptrons
- Surfing on minima of isostatic landscapes: avalanches and unjamming transition
- The algorithmic hardness threshold for continuous random energy models
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The simplest model of jamming
- The space of interactions in neural network models
- Universality in polytope phase transitions and message passing algorithms
Cited in
(6)- Optimization algorithms for multi-species spherical spin glasses
- Optimizing mean field spin glasses with external field
- Algorithmic pure states for the negative spherical perceptron
- Capacity lower bound for the Ising perceptron
- Exact full-RSB SAT/UNSAT transition in infinitely wide two-layer neural networks
- A CLuP algorithm to practically achieve 0.76 SK-model ground state free energy
This page was built for publication: Algorithmic pure states for the negative spherical perceptron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675362)
