Hugging Face Trending Papers

MemShift: Separating Detection from Repair in LLM-Derived Personal Memory

arXiv AI
Oct 16

MemScope: Evolving Agent Memory Architectures through Localized Code Repair

MemScope introduces a framework for evolving large language model (LLM) agent memory architectures by using localized code repair guided by detailed execution traces and runtime memory states. The Patch Agent identifies precise repair targets and applies bounded, in-place edits while respecting provider identity and memory compatibility constraints. Experiments on GAIA, xBench, and ALFWorld show that MemScope improves accuracy and correct answer rates, achieving higher success rates with a modest median code‑change ratio of 4.4%.

By Miao Su, Yucan Guo, Zixuan Li, Long Bai, Zhongni Hou, Xiaolong Jin, Jiafeng Guo
arXiv AI
Oct 9

MemTrace: State-Consistent Memory for Long-Horizon Coding Agents

MemTrace is a provenance‑aware memory system designed to help coding agents handle long‑horizon software evolution tasks that span multiple files and stages. It stores execution history as immutable Memory Traces linked to key artifacts (files, symbols, tests) and organizes them in a Memory Trace Graph to track execution order and dependencies. When context budgets are limited, the system keeps only compact Memory Anchors, from which the agent can reconstruct the latest execution state and retrieve only valid, relevant evidence, improving performance on three long‑horizon coding benchmarks. "whyItMatters":"By preserving consistent task state and verifying evidence validity, MemTrace enables coding agents to outperform existing baselines on long‑horizon benchmarks, achieving significant gains in pass@1, resolved rate, and milestone scores."

By Hongming Xu, Le Zhou, ZhongHe Jin, Xiang Zhang, Bo Tang, Zhiyu Li, Xuanhe Zhou, Juncheng Zhang
arXiv AI
Oct 2

Mem++: Non-Destructive Memory for Long-Term Organizational LLM Agents

Mem++ is a non‑destructive memory framework for large language model agents that records every document in full, along with its date and author, instead of compressing it at write time. At read time, it retrieves only documents up to the requested time and fuses lexical and semantic rankings, leaving the choice of which version to use to the answering model. Evaluations on OrgMemBench show Mem++ outperforms the strongest baseline by 8.0 to 13.1 points and achieves the best overall score with gpt‑4.1‑mini, while also ranking highly on other benchmarks such as LoCoMo and LongMemEval‑S.

By Ahmad Yehia, Aly O. Abdelkareem, Islam Ahmed, Hesham Omran, Khaled Alashmouny, Christian Claudel, Abduallah Mohamed
arXiv Computation and Language
Oct 27

FlexA-Mem: Budget-Adaptive Agentic Memory for LLM Agents

arXiv:2610.33274v1 Announce Type: new Abstract: Large language model (LLM) agents work in scenarios with very different memory needs. A question about past conversations needs the exact facts it name...

By Wujiang Xu, Jiaojiao Han, Xi Zhu, Qizheng Zhang, Kaiqu Liang, Yutong Yin, Kai Mei, Dimitris N. Metaxas
arXiv Computation and Language
Sep 23

MoM: Memory of Memory

arXiv:2609.25054v1 Announce Type: new Abstract: For a long-horizon LLM agent, the memory question is not what was once recorded but what \emph{currently holds}. Most designs answer it only indirectly...

By Bowen Qin, Yao Lu
arXiv AI
Aug 24

Temporal Validity on Real Software Histories: Eliminating Stale-Fact Errors in Code-Assistant Memory over GitHub Fixes

The paper evaluates a deterministic supersession memory, MemStrata, for retrieval‑augmented generation (RAG) systems on real software history. Using 707 GitHub issues, the authors extracted 130 clean atomic state transitions where a single value changes from pre‑fix to post‑fix. MemStrata achieved 0.91 answer accuracy versus 0.57–0.59 for standard RAG, eliminating stale‑fact errors that RAG returned 36–38% of the time, while maintaining comparable retrieval latency.

By Neeraj Yadav