HackerPapers

arXiv:1702.01929math.PR

On a model of associative memory with huge storage capacity

Mete Demircigil, Judith Heusel, Matthias Löwe, Sven Upgang, Franck Vermet

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

In [7] Krotov and Hopfield suggest a generalized version of the well-known Hopfield model of associative memory. In their version they consider a polynomial interaction function and claim that this increases the storage capacity of the model. We prove this claim and take the "limit" as the degree of the polynomial becomes infinite, i.e. an exponential interaction function. With this interaction we prove that model has an exponential storage capacity in the number of neurons, yet the basins of attraction are almost as large as in the standard Hopfield model.

arXiv comments
13 pages
Journal reference
J. Stat. Phys. 168 (2), 288-299 (2017)
DOI
doi:10.1007/s10955-017-1806-y
Subjects
math.PRProbability

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Sep 2022 to Sep 2022.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Transformer networks have deeper connections to dense associative memory. For example, the update rule to minimize the energy functional of these Hopfield networks converges in a single iteration and coincides with the attention mechanism [1]. [1] https://arxiv.org/abs/1702.01929

      macrolocalView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.