Statistical Mechanics of Learning via Reverberation in Bidirectional Associative Memories
Not on the map. Why?
Abstract (arXiv)
We study bi-directional associative neural networks that, exposed to noisy examples of an extensive number of random archetypes, learn the latter (with or without the presence of a teacher) when the supplied information is enough: in this setting, learning is heteroassociative -- involving couples of patterns -- and it is achieved by reverberating the information depicted from the examples through the layers of the network. By adapting Guerra's interpolation technique, we provide a full statistical mechanical picture of supervised and unsupervised learning processes (at the replica symmetric level of description) obtaining analytically phase diagrams, thresholds for learning, a picture of the ground-state in plain agreement with Monte Carlo simulations and signal-to-noise outcomes. In the large dataset limit, the Kosko storage prescription as well as its statistical mechanical picture provided by Kurchan, Peliti, and Saber in the eighties is fully recovered. Computational advantages in dealing with information reverberation, rather than storage, are discussed for natural test cases. In particular, we show how this network admits an integral representation in terms of two coupled restricted Boltzmann machines, whose hidden layers are entirely built of by grand-mother neurons, to prove that by coupling solely these grand-mother neurons we can correlate the patterns they are related to: it is thus possible to recover Pavlov's Classical Conditioning by adding just one synapse among the correct grand-mother neurons (hence saving an extensive number of these links for further information storage w.r.t. the classical autoassociative setting).
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 69 references that are in the map. First posted on arXiv 17 Jul 2023.
Builds on
18 of 69 references.
References · 18
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
- 2016Dense Associative Memory for Pattern Recognitioncited by 230
- 2020Restricted Boltzmann Machine, recent advances and mean-field theorycited by 31
- 2017Phase Diagram of Restricted Boltzmann Machines and Generalised Hopfield Networks with Arbitrary Priorscited by 25
- 2016Emergence of Compositional Representations in Restricted Boltzmann Machinescited by 23
- 2016Phase transitions in Restricted Boltzmann Machines with generic priorscited by 20
- 2021The emergence of a concept in shallow neural networkscited by 20
- 2022Supervised Hebbian Learningcited by 16
- 2018Dreaming neural networks: forgetting spurious memories and reinforcing pure onescited by 15
- 2023Storage and Learning phase transitions in the Random-Features Hopfield Modelcited by 11
- 2022Dense Hebbian neural networks: a replica symmetric picture of unsupervised learningcited by 10
6 more
- 2022Dense Hebbian neural networks: a replica symmetric picture of supervised learningcited by 10
- 2023Hopfield model with planted patterns: a teacher-student self-supervised learning modelcited by 7
- 2022Power-law Scaling to Assist with Key Challenges in Artificial Intelligencecited by 6
- 2022Efficient shallow learning as an alternative to deep learningcited by 6
- 2014From Dyson to Hopfield: Processing on hierarchical networkscited by 5
- 2022Thermodynamics of bidirectional associative memoriescited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.