Metraipolis › archive › dc_a87c5099f2aa

Agent Memory as Recommendation: Recommender-System Design for Long-Term Memory of LLM Agents — arXiv:2610.34673

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.34673
License (as archived)
CC0-1.0
Archived
2026-10-27T08:01:36.568Z
SHA-256 of the archived text
98abd3630061eb8a3395f943143a63c7e49bdac7d2fc179e67e248c64de1c56b
Stable URL of this page
https://metraipolis.com/documento/dc_a87c5099f2aa

How to cite

Agent Memory as Recommendation: Recommender-System Design for Long-Term Memory of LLM Agents — arXiv:2610.34673 — arXiv (en), https://arxiv.org/abs/2610.34673 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a87c5099f2aa (Metraipolis archive dc_a87c5099f2aa, sha256 98abd3630061eb8a3395f943143a63c7e49bdac7d2fc179e67e248c64de1c56b)
BibTeX
@misc{dca87c5099f2aa,
  title = {Agent Memory as Recommendation: Recommender-System Design for Long-Term Memory of LLM Agents — arXiv:2610.34673},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.34673},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a87c5099f2aa; sha256 98abd3630061eb8a3395f943143a63c7e49bdac7d2fc179e67e248c64de1c56b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.34673. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Large language model (LLM) agents that serve users across many sessions must choose, for every request, the few stored memories that enter a limited context window. This choice largely decides whether the agent answers correctly, and it runs on every request at Web scale. This selection faces three challenges: a large and growing store, a per-request cost budget, and multi-session questions that need all of their evidence. Many memory systems build notes or graphs with hundreds to thousands of LLM calls per history, and each is designed on its own, so it is unclear which component yields the accuracy. These challenges mirror the properties of recommendation, so we formalize agent memory as budgeted slate recommendation, with the request as the user, stored memories as items and the context window as a slate. The formalization places memory systems in one design space of recommender cascades and factorizes accuracy into the completeness that each stage controls. Guided by it, we propose AgentMemRec, which adapts candidate generation, learning to rank and slate construction from recommender systems and selects memories without any LLM call. On multi-session questions of LongMemEval, AgentMemRec outperforms memory and context-selection methods, including A-Mem, HippoRAG 2, DynamicRAG and T-Mem, by 10 to 31 points of accuracy. It matches an LLM reranker that makes 64 calls per query at 3.2 times lower serving cost, and on LoCoMo it outperforms Mem0 and Zep without any LLM call at write time. The factorization attributes the gains to slates that more often hold all of the evidence, so recommender-system design offers an effective and efficient foundation for the long-term memory of LLM agents.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Information Retrieval (cs.IR) ; Artificial Intelligence (cs.AI); Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2610.34673 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-27T07:55:30.928Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).