arXiv · 2308.13445
Eigenvector Dreaming
Abstract
Among the performance-enhancing procedures for Hopfield-type networks that implement associative memory, Hebbian Unlearning (or dreaming) strikes for its simplicity and its clear biological interpretation. Yet, it does not easily lend itself to a clear analytical understanding. Here we show how Hebbian Unlearning can be effectively described in terms of a simple evolution of the spectrum and the eigenvectors of the coupling matrix. We use these ideas to design new dreaming algorithms that are effective from a computational point of view, and are analytically far more transparent than the original scheme.
Explore related subjects
Keep this discovery
Marco Benedetti, Louis Carillo, Enzo Marinari, Marc Mèzard. 2023-08-09. Eigenvector Dreaming. https://arxiv.org/abs/2308.13445
Cite the original work for its findings. Save a collection to share your selection of sources.