Dense associative memory retrieval converges geometrically with O(log N) time and tolerates adversarial corruptions under separation and bounded-interference conditions, achieving capacity scaling Θ(N^{n-1}).
Empirically, the tightestCsuch thatT emp ≤C·logN ranges fromC= 0.19 (15% corruption,α= 0.03) toC= 5.79 (33% corruption,α= 0.02)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Algorithmic Analysis of Dense Associative Memory: Finite-Size Guarantees and Adversarial Robustness
Dense associative memory retrieval converges geometrically with O(log N) time and tolerates adversarial corruptions under separation and bounded-interference conditions, achieving capacity scaling Θ(N^{n-1}).