Hugging Face Trending Papers

Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite

Agents for long term reasoning require a memory that can be efficiently and effectively updated over time, as new facts and external feedback continue to arrive. Recently, graph memory has been adopted to offer structural organization for multi-hop retrieval and reasoning.

arXiv AI
Sep 10

EdgeMem: LLM-Free Agent Memory Construction and Retrieval via Evidence-Preserving Multi-Anchor Hypergraph

EdgeMem is a new agent-memory method that preserves original interaction turns and organizes them using complementary content, temporal, and episodic cues via a multi‑anchor hypergraph. It performs lightweight local processing, returning source evidence directly and reserving LLM use only for final answer generation. Experiments on LoCoMo and LongMemEval‑S demonstrate strong retrieval and memory‑grounded question answering, with EdgeMem achieving the highest strict‑judge score among seven systems on LoCoMo while requiring no generative‑LLM calls for construction and retrieval.

By Zeyang Cui, Jiannong Cao, Zhiyuan Wen, Bo Yuan, Junlan Feng, Shengyuan Chen
arXiv Computation and Language
Sep 15

Where to Look and What to Use: Retrieve-Localize-Generate for Long-Term Conversational Memory Question Answering

arXiv:2609.07093v2 Announce Type: replace Abstract: Retrieval-augmented generation (RAG) enables large language models (LLMs) to answer questions by accessing external knowledge and has been widely a...

By Yifan Wang, Xinkui Lin, Yongxiu Xu, Shen Gao, Ruochen Yang, Kun Huang, Yubin Wang, Jie Wu, Wei Liu, Jian Luan, Hongbo Xu, Shuo Shang
arXiv AI
Sep 10

AMA: Adaptive Memory via Multi-Agent Collaboration

The paper introduces AMA, a framework that uses multiple agents—Constructor, Retriever, Judge, and Refresher—to manage memory for large language model agents. AMA’s hierarchical memory design dynamically adjusts retrieval granularity to match task complexity, while the Judge and Refresher ensure relevance, consistency, and timely updates. Experiments on long-context benchmarks show AMA outperforms existing baselines and cuts token usage by about 80% compared to full-context approaches.

By Weiquan Huang, Zixuan Wang, Hehai Lin, Sudong Wang, Bo Xu, Qian Li, Beier Zhu, Linyi Yang, Chengwei Qin
arXiv Machine Learning
Sep 4

MemoryLACE: Memory Lifecycle-Aware Consolidation and Evidence Retrieval

MemoryLACE (MemLACE) is a lightweight memory framework that explicitly models the lifecycle of textual evidence—capturing sparse merge, supersession, and contradiction relations—while preserving atomic natural‑language memories and their provenance. Unlike traditional systems that retrieve memories independently, MemLACE reconstructs relation‑aware evidence units that expose current, historical, supporting, and conflicting evidence for downstream reasoning. In benchmark evaluations (BEAM and StructMemEval) using both open‑weight and proprietary LLM backbones, MemLACE achieves the highest overall performance among same‑backbone comparisons and reduces BEAM runtime by 66.6% compared to the strongest reflective‑memory baseline, Hindsight.

By Meriem Yacoubi, Pia Schmidt, Nenad Petrovic, Ahmed Frikha, Martin Kirchhoff, Alois Knoll