Generative diffusion for perceptron problems: statistical physics analysis and efficient algorithms
From MaRDI portal
Cites work
- A Connection Between Score Matching and Denoising Autoencoders
- A Max-Sum algorithm for training discrete neural networks
- Algorithms and barriers in the symmetric binary perceptron model
- An Information-Theoretic View of Stochastic Localization
- Biased landscapes for random constraint satisfaction problems
- Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
- Handbook of Markov Chain Monte Carlo
- Hardness of sampling solutions from the symmetric binary perceptron
- How to escape atypical regions in the symmetric binary perceptron: a journey through connected-solutions states
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- Information, Physics, and Computation
- Local entropy as a measure for sampling solutions in constraint satisfaction problems
- MCMC using Hamiltonian dynamics
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- On the atypical solutions of the symmetric binary perceptron
- Optimal errors and phase transitions in high-dimensional generalized linear models
- Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization
- Spin Glass Theory and Far Beyond
- Statistical mechanics of learning
- Storage capacity in symmetric binary perceptrons
- The Nishimori line and Bayesian statistics
- The simplest model of jamming
- Thin shell implies spectral gap up to polylog via a stochastic localization scheme
This page was built for publication: Generative diffusion for perceptron problems: statistical physics analysis and efficient algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357323)
