arXiv Machine Learning By Mark Bl\"umel, Andreas C. Schneider, Valentin Neuhaus, David A. Ehrlich, Marcel Graetz, Michael Wibral, Abdullah Makkeh, Viola Priesemann

Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks

Read the original on arXiv Machine Learning →

arXiv:2511. 02584v2 Announce Type: replace-cross Abstract: Associative memory, traditionally modeled by Hopfield networks, enables the retrieval of previously stored patterns from partial or noisy cues.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 25

ELiSe: Efficient Learning of Sequences in Structured Recurrent Networks

The paper introduces ELiSe, a model that leverages cortical network scaffolds and dendritic compartments to learn complex non‑Markovian spatio‑temporal patterns using only local, always‑on, phase‑free synaptic plasticity. It demonstrates the model’s ability to acquire and replay intricate sequences, exemplified by a birdsong learning mock‑up, and shows robustness to external disturbances and flexibility in parameter settings.

By Laura Kriener, Kristin V\"olk, Ben von H\"unerbein, Federico Benitez, Walter Senn, Mihai A. Petrovici
arXiv Machine Learning
Sep 11

Phases in a class of associative memories via hidden neurons

The paper investigates associative memory in a bipartite Hopfield–Krotov architecture, termed class H, where hidden neurons serve as the retrieval order parameter. Using the replica method, it derives replica‑symmetric phase diagrams and closed‑form capacities for polynomial load, showing that crosstalk statistics are similar for Ising and spherical visible neurons. With a softmax hidden layer, the load becomes exponential, mapping the thermodynamics onto a random‑energy‑model that exhibits paramagnetic, condensed, and frozen phases, and revealing that heating destabilizes retrieval through quantized attention reassignments while Gaussian patterns remain metastable at all loads.

By Toshihiro Ota, Masato Taki
arXiv Machine Learning
Sep 14

Hierarchical Prototype Emergence in Modern Hopfield Models

The paper studies how hierarchical correlations in data can be learned by a dense Hopfield network with polynomial activation. It analytically derives conditions for each level of a hierarchical memory model to be locally stable, meaning they correspond to local energy minima. Using prototype reconstruction as a minimal generalization test, the authors show that only a quasi‑polynomial amount of information is needed to generalize beyond specific memories or groups, and they observe a similar phase diagram for Fashion‑MNIST data.

By Aditya Cowsik, Adithya Sriram