← Back to all news
arXiv Computation and Language By Tong Qi, Jingyu Wu, Youbing Yin, Spencer Hong, Daben Liu, Erin Babinsky

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

Read the original on arXiv Computation and Language →

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.

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.

Related stories

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
llmsragnlp
More like this →
arXiv Computation and Language
Oct 22

Graph Topology Meets Energy-Driven Pathfinding: Preserving Contextual Consistency in Retrieval-Augmented Generation

ThreadRAG is a retrieval‑augmented generation framework that preserves contextual consistency by structuring retrieved documents into Semantic Nodes and building a Semantic Topology Graph (STG). It uses Energy‑Driven Pathfinding (EDP) to identify query‑relevant subgraphs and linearize them into coherent textual evidence paths. Experiments on HotpotQA, 2WikiMultihop, and another benchmark show ThreadRAG outperforms strong baselines, achieving a 14.4% EM gain on HotpotQA and a 5.8% EM lead on 2WikiMultihop while cutting token cost to 23.3% of the strongest baseline.

By Yufeng Li, Zaijing Li, Fuchen Zhang, Zongzong Wu, Ming Zhao, Fengxiao Tang
llmsragdiffusionnlpbenchmarks
More like this →