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.

翻译：在实现联想记忆的Hopfield型网络的性能增强方法中，赫布反学习（或称"梦境"过程）因简洁性和明确的生物学解释而引人注目。然而，该方法难以获得清晰的解析理解。本文揭示了赫布反学习如何通过耦合矩阵的谱与特征向量的简单演化进行有效描述。基于这些思想，我们设计了新的梦境算法，这些算法在计算层面高效，且在解析层面比原始方案透明得多。