arXiv:2602.19240cs.AI2026-02

用拓扑结构增强大模型推理,解决图问答中环路关系遗漏问题。

Topology of Reasoning: Retrieved Cell Complex-Augmented Generation for Textual Graph Question Answering

  • 将文本图升维为细胞复形,建模多维拓扑关系
  • 检索相关拓扑子复形,提供紧凑的上下文信息
  • 支持闭环推理,适合复杂逻辑问答任务

检索增强生成(RAG)通过动态整合外部知识提升大语言模型(LLM)的推理能力,缓解幻觉并加强结构化数据如图谱的上下文关联。然而,现有针对文本图的RAG方法多聚焦低维结构——将节点视为0维实体,边或路径视为1维关系,却忽视了对环路等高维拓扑结构的建模。这类环路在涉及相似对象或相对位置的闭合推理问题中至关重要。该局限常导致上下文关联不完整,推理能力受限。本文提出拓扑增强型检索增强生成(TopoRAG),一种新型文本图问答框架,有效捕捉高维拓扑与关系依赖。具体而言,TopoRAG首先将文本图升维为细胞复形,以建模多维拓扑结构;基于这些表示,设计拓扑感知的子复形检索机制,提取与查询相关的细胞复形,提供紧凑且信息丰富的拓扑上下文;最后,通过多维拓扑推理机制在复形上传播关系信息,引导LLM进行结构化、逻辑感知的推理。实证评估表明,该方法在多种文本图任务上持续优于现有基线。

原文摘要 · Abstract (English)

Retrieval-Augmented Generation (RAG) enhances the reasoning ability of Large Language Models (LLMs) by dynamically integrating external knowledge, thereby mitigating hallucinations and strengthening contextual grounding for structured data such as graphs. Nevertheless, most existing RAG variants for textual graphs concentrate on low-dimensional structures -- treating nodes as entities (0-dimensional) and edges or paths as pairwise or sequential relations (1-dimensional), but overlook cycles, which are crucial for reasoning over relational loops. Such cycles often arise in questions requiring closed-loop inference about similar objects or relative positions. This limitation often results in incomplete contextual grounding and restricted reasoning capability. In this work, we propose Topology-enhanced Retrieval-Augmented Generation (TopoRAG), a novel framework for textual graph question answering that effectively captures higher-dimensional topological and relational dependencies. Specifically, TopoRAG first lifts textual graphs into cellular complexes to model multi-dimensional topological structures. Leveraging these lifted representations, a topology-aware subcomplex retrieval mechanism is proposed to extract cellular complexes relevant to the input query, providing compact and informative topological context. Finally, a multi-dimensional topological reasoning mechanism operates over these complexes to propagate relational information and guide LLMs in performing structured, logic-aware inference. Empirical evaluations demonstrate that our method consistently surpasses existing baselines across diverse textual graph tasks.

图问答拓扑推理RAG

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。