arXiv Computation and Language By Shumao Sun

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

Read the original on arXiv Computation and Language →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

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 Computation and Language
Sep 7

CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generation

CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generation introduces a reranking framework that evaluates and enhances the coherence of retrieved passages across four dimensions—Intra-Domain Relevance, Noise Resistance, Informational Bonding, and Factual Consistency. The method transforms passages into directed heterogeneous entity graphs, reweights factual anchors, encodes structural patterns with a Relational Graph Convolutional Network, and fuses inter-chunk coherence with query relevance to produce a final ranking. Evaluations on four multi‑hop benchmarks show that CAGE matches or surpasses strong baselines, improving Recall@5 on bridge‑dominated datasets and consistently boosting downstream Exact Match scores, indicating that structurally coherent context leads to more precise answers even when retrieval recall is similar or lower.

By Tong Qi, Jingyu Wu, Youbing Yin, Spencer Hong, Daben Liu, Erin Babinsky
arXiv AI
Sep 4

When Users Don't Ask: Benchmarking Context-Driven Memory Retrieval in Conversational Agents

The paper introduces LOCOMO-CONV, a conversational memory benchmark that expands on the existing LoCoMo dataset with four query styles—dialog, implicit, counterfactual, and composed—designed to evaluate memory systems in realistic conversational settings. Experiments across five memory systems reveal that conversational framing uncovers significant retrieval gaps missed by traditional QA benchmarks, particularly for implicit and composed queries, and that strong retrieval does not necessarily translate into higher response quality. The study also highlights silent grounding in implicit queries, where memory enhances contextual grounding without explicitly presenting the gold fact, suggesting a need for reasoning-based memory elaboration.

By Wen-Yu Chang, Yun-Nung Chen
arXiv Computation and Language
Oct 12

Beyond the Final Embedding: Retrieving Memories from Token-Level Evidence

The paper introduces a memory-augmented retrieval method that leverages token-level evidence instead of relying solely on single-vector embeddings. By performing sparse token matching and aggregating scores with whole-memory similarity, the approach improves retrieval performance across eight benchmarks and various model families without extra training. An optional low-rank query adapter can further boost results when supervised.

By Han Luo, Zhan Zhuang, Xu He, Jujia Zhao, Yu Li, Suqin Yuan, Dong Li, Lei Feng