Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval
arXiv:2605.05189v1 Announce Type: new
Abstract: How many key-value associations can a $d\times d$ linear memory store? We show that the answer depends not only on the $d^2$ degrees of freedom in the memory matrix, but also on the retrieval criterion. …