analiza aiqbench
This research investigates how dense Hopfield networks with polynomial activations can learn hierarchical data correlations and generalize to construct new images, offering theoretical insights into the mechanisms underlying complex architectures like diffusion models. By analytically deriving stability conditions for memory hierarchies, the study demonstrates that generalization beyond specific memories requires only a quasi-polynomial amount of information, bridging associative memory theory with modern generative AI capabilities.
Hierarchical Prototype Emergence in Modern Hopfield Models
arXiv:2609.12079v1 Announce Type: cross Abstract: Hierarchical correlations are a universal feature of any realistic model of data, and the question of how associative memory models may learn these correlations and generalize beyond them to construct new sensible images is an important step towards understanding more complex modern architectures such as diffusion models. We consider a hierarchical model for memories which are sampled and stored in a dense Hopfield network with polynomial activation. We analytically derive conditions for each level of this hierarchy to be locally stable - that is they are local energy minima. We use prototype reconstruction as a minimal model of generalization and we find that it takes only a quasi-polynomial amount of information to generalize beyond particular memories and even particular groups in the hierarchy. We observe a qualitatively analogous phase diagram in the number of memories, sharpness of the activation function (polynomial degree) for data from Fashion-MNIST.
Abstract:Hierarchical correlations are a universal feature of any realistic model of data, and the question of how associative memory models may learn these correlations and generalize beyond them to construct new sensible images is an important step towards understanding more complex modern architectures such as diffusion models. We consider a hierarchical model for memories which are sampled and stored in a dense Hopfield network with polynomial activation. We analytically derive conditions for each level of this hierarchy to be locally stable - that is they are local energy minima. We use prototype reconstruction as a minimal model of generalization and we find that it takes only a quasi-polynomial amount of information to generalize beyond particular memories and even particular groups in the hierarchy. We observe a qualitatively analogous phase diagram in the number of memories, sharpness of the activation function (polynomial degree) for data from Fashion-MNIST.
5 pages, 19 page supplementary information. Additional citation requests welcome
Disordered Systems and Neural Networks (cond-mat.dis-nn); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
arXiv:2609.12079 [cond-mat.dis-nn]
(or arXiv:2609.12079v1 [cond-mat.dis-nn] for this version)
https://doi.org/10.48550/arXiv.2609.12079 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 259 cuvinte
Subiecte conexe
Vision Hopfield Memory Networks for Image Recognition
arXiv · 9 iun. 2026

Article: Governing AI in the Cloud: A Practical Guide for Architects
InfoQ · 15 iun. 2026

News
Quantum Computing Report · 25 iul. 2026

Choosing the Right Vector Database for RAG and AI Applications
Analytics Vidhya · 8 iun. 2026