Binary perceptron computational gap: a parametric fl-RDT view
From MaRDI portal
Cites work
- A Problem in Geometric Probability.
- Algorithmic pure states for the negative spherical perceptron
- 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 of neural networks with discrete synaptic couplings
- Capacity threshold for the Ising perceptron
- Clustering of solutions in the symmetric binary perceptron
- Constructive discrepancy minimization by walking on the edges
- Constructive Discrepancy Minimization for Convex Sets
- Covering cubes by random half cubes, with applications to binary neural networks
- Critical window of the symmetric perceptron
- Discrepancy minimization via a self-balancing walk
- Disordered systems insights on computational hardness
- Distribution of the threshold for the symmetric perceptron
- Entropy landscape of solutions in the binary perceptron problem
- Enumeration of Seven-Argument Threshold Functions
- Exact full-RSB SAT/UNSAT transition in infinitely wide two-layer neural networks
- Following the Ground States of <scp>Full‐RSB</scp> Spherical Spin Glasses
- Free energy landscapes in spherical spin glasses
- Frozen 1-RSB structure of the symmetric Ising perceptron
- Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
- How to escape atypical regions in the symmetric binary perceptron: a journey through connected-solutions states
- Limits of local algorithms over sparse random graphs
- Local algorithms for independent sets are half-optimal
- Local entropy as a measure for sampling solutions in constraint satisfaction problems
- Mean Field Models for Spin Glasses
- Mean field models for spin glasses. Volume I: Basic examples.
- On the atypical solutions of the symmetric binary perceptron
- On the solution-space geometry of random constraint satisfaction problems
- On the solution-space geometry of random constraint satisfaction problems
- On the volume of the intersection of a sphere with random half spaces
- On-line balancing of random inputs
- Optimal low-degree hardness of maximum independent set
- Optimization of mean-field spin glasses
- Optimization of the Sherrington-Kirkpatrick Hamiltonian
- Pairs of SAT-assignments in random Boolean formulæ
- Performance of sequential local algorithms for the random NAE-K-SAT problem
- Probabilistic analysis of optimum partitioning
- Proof of the contiguity conjecture and lognormal limit for the symmetric perceptron
- Quenches in the Sherrington-Kirkpatrick model
- Rigorous solution of the Gardner problem
- Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization
- Sharp threshold for the Ising perceptron model
- Sharp threshold sequence and universality for Ising perceptron models
- Six Standard Deviations Suffice
- Storage capacity in symmetric binary perceptrons
- The complexity of spherical p-spin models: a second moment approach
- The Generic Chaining
- The geometry of the Gibbs measure of pure spherical spin glasses
- The simplest model of jamming
- The space of interactions in neural network models
- Tight Lipschitz hardness for optimizing mean field spin glasses
- Un-inverting the Parisi formula
This page was built for publication: Binary perceptron computational gap: a parametric fl-RDT view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296851)
