On the atypical solutions of the symmetric binary perceptron
From MaRDI portal
Publication:6562957
Recommendations
Cites work
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- A Max-Sum algorithm for training discrete neural networks
- A new look at survey propagation and its generalizations
- Asymptotic Statistics
- Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
- Clustering of solutions in the symmetric binary perceptron
- Concentration inequalities. A nonasymptotic theory of independence
- Covering cubes by random half cubes, with applications to binary neural networks
- Entropy landscape of solutions in the binary perceptron problem
- Frozen 1-RSB structure of the symmetric Ising perceptron
- Gibbs states and the set of solutions of random constraint satisfaction problems
- Local entropy as a measure for sampling solutions in constraint satisfaction problems
- Mean field models for spin glasses. Volume I: Basic examples.
- On-line balancing of random inputs
- Royen’s Proof of the Gaussian Correlation Inequality
- Sharp threshold sequence and universality for Ising perceptron models
- Storage capacity in symmetric binary perceptrons
- Survey propagation as local equilibrium equations
- The asymptotics of the clustering transition for random constraint satisfaction problems
- The cavity method at zero temperature
Cited in
(2)
This page was built for publication: On the atypical solutions of the symmetric binary perceptron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562957)