Cover Image

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barnfield, Nicholas, Kim, Juno, Nichani, Eshaan, Lee, Jason D., Lu, Yue M.
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Understanding Factual Recall in Transformers via Associative Memories
by: Nichani, Eshaan, et al.
Published: (2024)

Sharp Capacity Scaling of Spectral Optimizers in Learning Associative Memory
by: Kim, Juno, et al.
Published: (2026)

How Transformers Learn Causal Structure with Gradient Descent
by: Nichani, Eshaan, et al.
Published: (2024)

Learning Hierarchical Polynomials of Multiple Nonlinear Features with Three-Layer Networks
by: Fu, Hengyu, et al.
Published: (2024)

Quantitative Bounds for Length Generalization in Transformers
by: Izzo, Zachary, et al.
Published: (2025)

Provable Guarantees for Nonlinear Feature Learning in Three-Layer Neural Networks
by: Nichani, Eshaan, et al.
Published: (2023)

Dynamic Thresholding Algorithm with Memory for Linear Inverse Problems
by: Sun, Zhong-Feng, et al.
Published: (2024)

The Exponential Capacity of Dense Associative Memories
by: Lucibello, Carlo, et al.
Published: (2023)

Beyond Winner-Take-All Procurement Auctions
by: Garimidi, Pranav, et al.
Published: (2026)

Ziv-Merhav estimation for hidden-Markov processes
by: Barnfield, Nicholas, et al.
Published: (2024)

Matrix Completion with Hypergraphs:Sharp Thresholds and Efficient Algorithms
by: Ma, Zhongtian, et al.
Published: (2024)

Rate-Adaptive Spatially Coupled MacKay-Neal Codes with Thresholds Close to Capacity
by: Zahr, Ayman, et al.
Published: (2025)

Emergence and scaling laws in SGD learning of shallow neural networks
by: Ren, Yunwei, et al.
Published: (2025)

On the Statistical Query Complexity of Learning Semiautomata: a Random Walk Approach
by: Giapitzakis, George, et al.
Published: (2025)

Fine-Tuning Dynamics of In-Context Factual Recall in Transformers
by: Huang, Ruomin, et al.
Published: (2026)

The Capacity of 3 User Linear Computation Broadcast
by: Yao, Yuhang, et al.
Published: (2022)

On Secrecy Capacity of Binary Beampointing Channels with Block Memory and Feedback
by: Li, Siyao, et al.
Published: (2025)

On the Zero-Error Capacity of Semantic Channels with Input and Output Memories
by: Cao, Qi, et al.
Published: (2024)

On the Generic Capacity of $K$-User Symmetric Linear Computation Broadcast
by: Yao, Yuhang, et al.
Published: (2022)

On the Ziv-Merhav theorem beyond Markovianity
by: Barnfield, Nicholas, et al.
Published: (2023)

On the Sensing Capacity of Gaussian "Beam-Pointing" Channels with Block Memory and Feedback
by: Li, Siyao, et al.
Published: (2025)

Thresholds for Reconstruction of Random Hypergraphs From Graph Projections
by: Bresler, Guy, et al.
Published: (2025)

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Adversarial Servers
by: Miki, Atsushi, et al.
Published: (2025)

Does Privacy Always Harm Fairness? Data-Dependent Trade-offs via Chernoff Information Neural Estimation
by: Nichani, Arjun, et al.
Published: (2026)

ListT5: Listwise Reranking with Fusion-in-Decoder Improves Zero-shot Retrieval
by: Yoon, Soyoung, et al.
Published: (2024)

Permutation Capacity Region of Adder Multiple-Access Channels
by: Lu, William, et al.
Published: (2023)

Constrained Coding and Deep Learning Aided Threshold Detection for Resistive Memories
by: Zhong, Xingwei, et al.
Published: (2024)

On the Ziv-Merhav theorem beyond Markovianity II: leveraging the thermodynamic formalism
by: Barnfield, Nicholas, et al.
Published: (2023)

Max-Linear Regression by Convex Programming
by: Kim, Seonho, et al.
Published: (2021)

Local Approximation of Secrecy Capacity
by: Athanasakos, Emmanouil M., et al.
Published: (2024)

A Linear Programming Approach to Private Information Retrieval
by: Heidarzadeh, Anoosheh, et al.
Published: (2025)

Super-Linear Growth of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel
by: Wang, Haiyang
Published: (2025)

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Non-Colluding and Colluding Servers
by: Miki, Atsushi, et al.
Published: (2024)

Capacity-Maximizing Dynamic User Association in Double RIS-Aided Broadcast Networks
by: Vahid, Alireza
Published: (2024)

From Bayesian Asymptotics to General Large-Scale MIMO Capacity
by: Yang, Sheng, et al.
Published: (2025)

Quantum $X$-Secure $T$-Private Information Retrieval From MDS Coded Storage With Unresponsive and Byzantine Servers
by: Lu, Yuxiang, et al.
Published: (2023)

On the Capacity of Hierarchical Secure Aggregation with Groupwise Keys
by: Lu, Minyang, et al.
Published: (2026)

6G Takes Shape
by: Andrews, Jeffrey G., et al.
Published: (2024)

On the Capacity of Vector Linear Computation over a Noiseless Quantum Multiple Access Channel with Entangled Transmitters
by: Yao, Yuhang, et al.
Published: (2024)

On Listwise Reranking for Corpus Feedback
by: Yoon, Soyoung, et al.
Published: (2025)