The swapping algorithm for the Hopfield model with two patterns
From MaRDI portal
Publication:734648
DOI10.1016/j.spa.2009.06.007zbMath1178.82060OpenAlexW2078348206MaRDI QIDQ734648
Publication date: 13 October 2009
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spa.2009.06.007
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Neural nets applied to problems in time-dependent statistical mechanics (82C32)
Related Items (3)
Equi-energy sampling does not converge rapidly on the mean-field Potts model with three colors close to the critical temperature ⋮ Some remarks on replicated simulated annealing ⋮ Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some rigorous results on the Hopfield neural network model
- Geometric bounds for eigenvalues of Markov chains
- What do we know about the Metropolis algorithm?
- On the storage capacity of Hopfield models with correlated patterns
- Comparison theorems for reversible Markov chains
- Gibbs states of the Hopfield model in the regime of perfect memory
- The capacity of \(q\)-state Potts neural networks with parallel retrieval dynamics
- The storage capacity of the Hopfield model and moderate deviations
- Logarithmic Sobolev inequalities for finite Markov chains
- The capacity of the Hopfield associative memory
- On the swapping algorithm
- Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
- Equation of State Calculations by Fast Computing Machines
- Neural networks and physical systems with emergent collective computational abilities.
This page was built for publication: The swapping algorithm for the Hopfield model with two patterns
