On-Line Learning with Restricted Training Sets: An Exactly Solvable Case
H. C. Rae, P. Sollich, A. C. C. Coolen
Abstract
We solve the dynamics of on-line Hebbian learning in large perceptrons exactly, for the regime where the size of the training set scales linearly with the number of inputs. We consider both noiseless and noisy teachers. Our calculation cannot be extended to non-Hebbian rules, but the solution provides a convenient and welcome benchmark with which to test more general and advanced theories for solving the dynamics of learning with restricted training sets.
Create a lesson
Related papers
Low-temperature magnetism and spin dynamics in the disordered triangular-lattice Yb3+ compound LiCaYb5(BO3)6
Monika Jawale, Saikat Nandi, Prashanta K. Mukharjee et al.
Neural Renormalization Group Flow for Percolation
Anaclara Alvez, Luca Camagna, Sergio Chibbaro et al.
Dynamical phase selection controls compute scaling in looped transformers
Gunn Kim
Semi-localized ground state in a 1D system with long-range hopping
Murod S. Bahovadinov, Faridun N. Jalolov, Vladimir E. Kravtsov et al.
Defect states in three-dimensional diamond photonic band gap crystals
Julia Rocha, Bart A. van Tiggelen, Ad Lagendijk et al.
Disorder-induced conducting edges on Kagomé lattice
A. Chmeruk, D. Jones, L. Chioncel