Inferring Concepts from Noisy Examples in Hopfield-like Neural Networks
Marco Benedetti, Giulia Fischetti, Enzo Marinari, Gleb Oshanin, Victor Dotsenko
TL;DR
The paper addresses how attractor networks can generalize from limited, noisy examples by inferring archetypal concepts rather than memorizing instances. It introduces a hierarchical two-level pattern structure and a learning rule based on average correlations, analyzed with Replica Symmetric and 1RSB mean-field theory. Key findings include six solution classes, three of which generalize (FS, CR, OE), with rich zero-temperature bifurcation diagrams; 1RSB corrections significantly improve agreement with simulations and raise capacity thresholds. The work demonstrates that a subtle shift in learning rules and pattern structure can enhance generalization while preserving locality, with implications for neural computation and machine learning frameworks dealing with concept extraction from noisy data.
Abstract
We study a variant of the pseudo-inverse learning rule for Hopfield-like Neural Networks, which allows the network to infer archetypal concepts on the basis of a limited number of examples. The mean-field replica theory for this model reveals how this generalization ability is mediated by a multitude of states, with diverse thermodynamic properties, coexisting with the standard Hopfield ones. They appear and vanish through smooth transitions or discontinuous jumps and, interestingly, show much stronger Replica Symmetry Breaking (RSB) effects than the standard Hopfield model, as captured by our 1RSB analysis. Our results, in excellent agreement with numerical simulations, provide deeper insight into the interplay between memory storage and generalization in attractor neural networks.
