Skip to content
NewA calmer, faster ZeroHour

Bias-Induced Crossover in Absolute Capacity of Dense Associative Memory

arXiv cs.AI / cs.LG / cs.CLby Yuto Sakurai ()1 min read3
AI summary · glm-5.3Summaries by Vani AI

Analysis shows biased patterns cut dense associative memory capacity from N^(n-1)/ln N to O(N^(n/2)), with a bias-induced crossover.

The paper analyzes dense associative memory capacity for biased centered binary patterns under the Krotov-Hopfield single-site criterion. Unbiased patterns (q=1/2) with order-n polynomial interactions yield capacity of order N^(n-1)/ln N, while fixed bias q<1/2 reduces capacity to O(N^(n/2)) for even n>=4 and O(N^((n+1)/2)) for odd n>=5. A bias-dependent crosstalk mean destabilizes sites carrying the frequent value, and an activity-dependent control potential restores the higher capacity within the conditioned-Gaussian approximation.

Key facts
  • Fixed pattern bias cuts capacity from N^(n-1)/ln N to O(N^(n/2))
  • Crossover region near 1-2q = O(ln N / N^(floor(n/2)-1))
  • Bias-dependent crosstalk mean destabilizes sites holding the frequent value
  • Activity-dependent control potential restores full capacity for fixed bias
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at arxiv.org

The absolute capacity of dense associative memory has mainly been analyzed for unbiased patterns. Here we examine the effect of bias in centered binary patterns under the Krotov-Hopfield single-site criterion $P_{\mathrm{error}}=1/N$, where $P_{\mathrm{error}}$ is the probability that a single-site flip lowers the energy of a stored pattern and $N$ is the number of neurons.

arXiv cs.AI / cs.LG / cs.CL

By Yuto Sakurai · arxiv.org

Read the full article at arXiv cs.AI / cs.LG / cs.CL

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.