Overlap gap and computational thresholds in the square wave perceptron

Cites work

A Max-Sum algorithm for training discrete neural networks
Algorithms and barriers in the symmetric binary perceptron model
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
Capacity lower bound for the Ising perceptron
Capacity threshold for the Ising perceptron
Coin flipping by telephone a protocol for solving impossible problems
Critical Behavior in the Satisfiability of Random Boolean Expressions
Determining computational complexity from characteristic ``phase transitions
Exact full-RSB SAT/UNSAT transition in infinitely wide two-layer neural networks
Frozen 1-RSB structure of the symmetric Ising perceptron
Fundamental limits of weak recovery with applications to phase retrieval
Generalization learning in a perceptron with binary synapses
Gibbs states and the set of solutions of random constraint satisfaction problems
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
scientific article; zbMATH DE number 1273988 (Why is no real title available?)
scientific article; zbMATH DE number 7526266 (Why is no real title available?)
Information, Physics, and Computation
Low-degree hardness of random optimization problems
On the complexity of random satisfiability problems with planted solutions (extended abstract)
On the solution-space geometry of random constraint satisfaction problems
On-line balancing of random inputs
Optimal errors and phase transitions in high-dimensional generalized linear models
Optimal low-degree hardness of maximum independent set
Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization
Self averaging and the space of interactions in neural networks
Shaping the learning landscape in neural networks around wide flat minima
Six Standard Deviations Suffice
Statistical mechanics of learning
Statistical Physics of Spin Glasses and Information Processing
Storage capacity in symmetric binary perceptrons
The Nishimori line and Bayesian statistics
The overlap gap property and approximate message passing algorithms for \(p\)-spin models
The simplest model of jamming
The space of interactions in neural network models

This page was built for publication: Overlap gap and computational thresholds in the square wave perceptron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293888)