mlsanityData to 14 Oct 2026

A Waddington landscape for prototype learning in generalized Hopfield networks

arXiv 2312.03012 ↗First posted 4 Dec 2023cond-mat.dis-nn cs.LG cs.NEcited by 2

Not on the map. Why?

Abstract (arXiv)

Networks in machine learning offer examples of complex high-dimensional dynamical systems reminiscent of biological systems. Here, we study the learning dynamics of Generalized Hopfield networks, which permit a visualization of internal memories. These networks have been shown to proceed through a 'feature-to-prototype' transition, as the strength of network nonlinearity is increased, wherein the learned, or terminal, states of internal memories transition from mixed to pure states. Focusing on the prototype learning dynamics of the internal memories we observe a strong resemblance to the canalized, or low-dimensional, dynamics of cells as they differentiate within a Waddingtonian landscape. Dynamically, we demonstrate that learning in a Generalized Hopfield Network proceeds through sequential 'splits' in memory space. Furthermore, order of splitting is interpretable and reproducible. The dynamics between the splits are canalized in the Waddington sense -- robust to variations in detailed aspects of the system. In attempting to make the analogy a rigorous equivalence, we study smaller subsystems that exhibit similar properties to the full system. We combine analytical calculations with numerical simulations to study the dynamical emergence of the feature-to-prototype transition, and the behaviour of splits in the landscape, saddles points, visited during learning. We exhibit regimes where saddles appear and disappear through saddle-node bifurcations, qualitatively changing the distribution of learned memories as the strength of the nonlinearity is varied -- allowing us to systematically investigate the mechanisms that underlie the emergence of Waddingtonian dynamics. Memories can thus differentiate in a predictive and controlled way, revealing new bridges between experimental biology, dynamical systems theory, and machine learning.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 25 references that are in the map. First posted on arXiv 4 Dec 2023.

Builds on

6 of 25 references.

References · 6

  1. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
  2. 2016Dense Associative Memory for Pattern Recognitioncited by 236
  3. 2017Dense Associative Memory is Robust to Adversarial Inputscited by 45
  4. 2020Memorizing without overfitting: Bias, variance, and interpolation in over-parameterized modelscited by 27
  5. 2023The Training Process of Many Deep Networks Explores the Same Low-Dimensional Manifoldcited by 21
  6. 2023Memory in Plain Sight: Surveying the Uncanny Resemblances of Associative Memories and Diffusion Modelscited by 13

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.