The swapping algorithm for the Hopfield model with two patterns (Q734648)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5614625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The swapping algorithm for the Hopfield model with two patterns |
scientific article; zbMATH DE number 5614625 |
Statements
The swapping algorithm for the Hopfield model with two patterns (English)
0 references
13 October 2009
0 references
The swapping algorithm based on Metropolis - Hastings chain is introduced. The aim is to analyze the speed of convergence. The main result of the paper is that the swapping algorithm is rapidly mixing for a Hopfield network with two independent identical patterns. Some bounds for the spectral gap of the corresponding Markov chain are proved.
0 references
swapping algorithm
0 references
Metropolis algorithm
0 references
Hopfield model
0 references
Markov chain Monte Carlo method
0 references
spin glasses
0 references
0.8522230982780457
0 references
0.7883945107460022
0 references
0.7613306045532227
0 references
0.7563021779060364
0 references
0.7299913763999939
0 references
