On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysis
<|reference_start|>On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysis: We investigate the computational limits of the memory retrieval dynamics of modern Hopfield models from the fine-grained complexity analysis. Our key contribution is the characterization of a phase transition behavior in the efficiency of all possible modern Hopfield models based on the norm of patterns. Specifically, we establish an upper bound criterion for the norm of input query patterns and memory patterns. Only below this criterion, sub-quadratic (efficient) variants of the modern Hopfield model exist, assuming the Strong Exponential Time Hypothesis (SETH). To showcase our theory, we provide a formal example of efficient constructions of modern Hopfield models using low-rank approximation when the efficient criterion holds. This includes a derivation of a lower bound on the computational time, scaling linearly with $\max\{$# of stored memory patterns, length of input query sequence$\}$. In addition, we prove its memory retrieval error bound and exponential memory capacity.<|reference_end|>
@article{hu2024on,
    title={On Computational Limits of Modern Hopfield Models: A Fine-Grained
  Complexity Analysis},
    author={Jerry Yao-Chieh Hu, Thomas Lin, Zhao Song, Han Liu},
    journal={arXiv preprint arXiv:2402.04520},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.04520},
    primaryClass={cs.LG cs.AI stat.ML}
}