Hugging Face Trending Papers

GraphMemix: Query-Aware Evidence Forests for Long-Term Multimodal Agent Memory

GraphMemix introduces a combinatorial‑optimization graph memory framework that organizes long‑term multimodal agent memory as query‑aware evidence forests. It constructs candidate graphs by expanding seed memories through schema and semantic relations, then decouples evidence utility from anchor‑conditioned relation verification to reduce redundancy, and finally optimizes a forest‑format memory context within a maximum evidence budget. Experiments on four benchmarks show significant accuracy gains and a new Pareto frontier between accuracy and lifecycle cost.

arXiv AI
Aug 28

GraphMemix: Query-Aware Evidence Forests for Long-Term Multimodal Agent Memory

GraphMemix introduces a combinatorial‑optimization graph memory framework that constructs query‑aware evidence forests for long‑term multimodal agent memory. It expands seed memories via schema and semantic relations, decouples memory support from relation verification to reduce redundancy, and optimizes a forest‑format context within a maximum evidence budget. Experiments on four benchmarks show significant accuracy gains and a new Pareto frontier between accuracy and lifecycle cost.

By Geng Li, Yuhao Wang, Dong Li, Jianye Hao, Yuxin Peng
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
Aug 31

Entity-Memory Graph Retrieval Improves Evidence Coverage in Long-Conversation Question Answering

Entity-Memory graph retrieval preserves dialogue turns as verbatim memory nodes, links repeated mentions via shared entities, and connects adjacent memories with chronological edges. During retrieval, the system gates through entities, fuses semantics, and performs one‑hop chronological recovery before dense backfill, allowing it to keep neighboring memories that dense cosine ranking might miss. On 1,986 questions from ten LoCoMo conversations, this graph retrieval method increases official evidence recall at top‑k 25 from 79.7468 % to 84.4842 %, with the advantage extending from top‑k 5 to 50, though it does not improve overall final‑answer F1.

By Shumao Sun
arXiv AI
Sep 25

C3M: Cross-Session Multimodal Memory Maintenance for Long-Horizon Tasks

C3M is a cross‑session multimodal memory system designed for long‑horizon tasks that must preserve and retrieve evidence across sessions within a limited, query‑blind memory budget. It maintains a bounded active index of source text‑image evidence, using relation‑aware updates to keep safe redundancy while preserving complementary and incompatible records. At query time, budgeted routing selects useful index pages and expands their associated source evidence under a fixed reader budget, creating a compact, provenance‑preserving memory that retains temporal distinctions and source links for reliable downstream reasoning.

By Xueshu Chen, Yan Wang, Zihao Xue, Jiefu Li, Zhenfang Liu, Jayden Chen, Zhen Bi, Jungang Lou