Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems
From MaRDI portal
Cites work
- Capacity threshold for the Ising perceptron
- Clustering of solutions in the symmetric binary perceptron
- Disordered systems insights on computational hardness
- Efficiency of quantum vs. classical annealing in nonconvex learning problems
- Entropy landscape of solutions in the binary perceptron problem
- Gibbs states and the set of solutions of random constraint satisfaction problems
- 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?)
- Local entropy as a measure for sampling solutions in constraint satisfaction problems
- Neural networks and physical systems with emergent collective computational abilities
- On the atypical solutions of the symmetric binary perceptron
- On the solution-space geometry of random constraint satisfaction problems
- On-line balancing of random inputs
- Quasi equilibrium construction for the long time limit of glassy dynamics
- Shaping the learning landscape in neural networks around wide flat minima
- Storage capacity in symmetric binary perceptrons
- Temperature evolution and bifurcations of metastable states in mean-field spin glasses, with connections with structural glasses
- The asymptotics of the clustering transition for random constraint satisfaction problems
- Wide flat minima and optimal generalization in classifying high-dimensional Gaussian mixtures
This page was built for publication: Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357312)
