arXiv (All)
open access
LAM: Efficient Lossy Agent Memory Framework With A Retrieval-Score Error Bound
Agent memory grows as agents read inputs, reason, and call tools. Longer histories increase inference cost and eventually exceed the context window. LLM-based summarization reduces this history but adds latency and provides no explicit bound on information loss. We propose LAM, a Lossy Agent Memory
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
- MemoryLACE: Memory Lifecycle-Aware Consolidation and Evidence Retrieval#925562
- REVA: Reusable Evidence View Aggregation for Context-Efficient RAG Serving#998757
- Factual recall in linear associative memories: sharp asymptotics and mechanistic insights#1118562
- TEMPS: Temporal Sentence Embeddings for Temporal Information Retrieval#1064592
- Navigating Sparse Evidence: Agentic Visual RAG via Explicit Context Selection and Consolidation#1109846
Record · ID 1116587
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