Issue |
EPL
Volume 141, Number 1, January 2023
|
|
---|---|---|
Article Number | 11001 | |
Number of page(s) | 6 | |
Section | Statistical physics and networks | |
DOI | https://doi.org/10.1209/0295-5075/aca55f | |
Published online | 04 January 2023 |
Supervised Hebbian learning
1 Dipartimento di Matematica e Fisica, Università del Salento - Campus Ecotekne, via Monteroni, Lecce 73100, Italy
2 Istituto Nazionale di Fisica Nucleare, Sezione di Lecce - Campus Ecotekne, via Monteroni, Lecce 73100, Italy
3 Dipartimento di Matematica, Sapienza Università di Roma - P.le A. Moro 5, 00185, Rome, Italy
4 Istituto Nazionale d'Alta Matematica (GNFM) “F. Severi” - P.le A. Moro 5, 00185, Rome, Italy
5 Department of Physics, Bar-Ilan University - Ramat-Gan, 52900, Israel
(a) E-mail: adriano.barra@gmail.com (corresponding author)
Received: 8 September 2022
Accepted: 23 November 2022
In neural network's literature, Hebbian learning traditionally refers to the procedure by which the Hopfield model and its generalizations store archetypes (i.e., definite patterns that are experienced just once to form the synaptic matrix). However, the term learning in machine learning refers to the ability of the machine to extract features from the supplied dataset (e.g., made of blurred examples of these archetypes), in order to make its own representation of the unavailable archetypes. Here, given a sample of examples, we define a supervised learning protocol based on Hebb's rule and by which the Hopfield network can infer the archetypes. By an analytical inspection, we detect the correct control parameters (including size and quality of the dataset) that tune the system performance and we depict its phase diagram. We also prove that, for structureless datasets, the Hopfield model equipped with this supervised learning rule is equivalent to a restricted Boltzmann machine and this suggests an optimal and interpretable training routine. Finally, this approach is generalized to structured datasets: we highlight an ultrametric-like organization (reminiscent of replica-symmetry-breaking) in the analyzed datasets and, consequently, we introduce an additional broken-replica hidden layer for its (partial) disentanglement, which is shown to improve MNIST classification from to , and to offer a new perspective on deep architectures.
© 2023 EPLA
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.