arXiv (All)
open access
Factual recall in linear associative memories: sharp asymptotics and mechanistic insights
Large language models demonstrate remarkable ability in factual recall, yet the fundamental limits of storing and retrieving input--output associations with neural networks remain unclear. We study these limits in a minimal setting: a linear associative memory that maps $p$ input embeddings in $\mat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Factual recall in linear associative memories: sharp asymptotics and mechanistic insights#175272
- MemoryLACE: Memory Lifecycle-Aware Consolidation and Evidence Retrieval#925562
- Structural Order and Memory Encoding: A Recall Advantage for Postnominal Modifiers#444265
- Rethinking Memorization Mitigation in Diffusion Models: Reinforcing Text Conditioning#1156994
- Memory Updating Following Episodic and Semantic Retrieval: Evidence for Shared Mechanisms#29851
Record · ID 1118562
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive