@inproceedings{
hu2024provably,
title={Provably Optimal Memory Capacity for  Modern Hopfield Models:   Transformer-Compatible   Dense Associative Memories as Spherical Codes},
author={Jerry Yao-Chieh Hu and Dennis Wu and Han Liu},
booktitle={The Thirty-eighth Annual Conference on Neural Information Processing Systems},
year={2024},
url={https://openreview.net/forum?id=4UReW4Ez6s}
}
We study the optimal memorization capacity of modern Hopfield models and Kernelized Hopfield Models (KHMs), a transformer-compatible class of Dense Associative Memories.
We present a tight analysis by establishing a connection between the memory configuration of KHMs and spherical codes from information theory. 
Specifically, we treat the stored memory set as a specialized spherical code.
This enables us to cast the memorization problem in KHMs into a point arrangement problem on a hypersphere.
We show that the optimal capacity of KHMs occurs when the feature space allows memories to form an optimal spherical code.
This unique perspective leads to: 
1. An analysis of how KHMs achieve optimal memory capacity, and identify corresponding necessary conditions. 
Importantly, we establish an upper capacity bound that matches the well-known exponential lower bound in the literature. 
This provides the first tight and optimal asymptotic memory capacity  for modern Hopfield models.
2. A sub-linear time algorithm $\mathtt{U}\text{-}\mathtt{Hop}$+ to reach KHMs' optimal capacity. 
3. An analysis of the scaling behavior of the required feature dimension relative to the number of stored memories.

These efforts improve both the retrieval capability of KHMs and the representation learning of corresponding transformers.
Experimentally, we provide thorough numerical results to back up theoretical findings.
Provably Optimal Memory Capacity for  Modern Hopfield Models:   Transformer-Compatible   Dense Associative Memories as Spherical Codes
Jerry Yao-Chieh Hu Dennis Wu Han Liu