arXiv:2605.18765cs.IRcs.AI2026-05

STAR提升图增强生成的检索效果,解决语义偏差和长尾路径问题。

STAR: Semantic-Tuned and Tail-Adaptive Retriever for Graph-Augmented Generation

论文配图:STAR: Semantic-Tuned and Tail-Adaptive Retriever for Graph-Augmented Generation
图 1 · 摘自论文原文
  • 通过交叉注意力与路径挖掘,联合建模查询与路径信息。
  • 引入尾部自适应加权对比学习,提升长尾路径检索效果。
  • 在多个基准上实现检索与问答性能双提升,适合图增强任务使用。

为增强大语言模型在多跳问答中的表现,主流的图检索增强生成(GraphRAG)方法依赖轻量级检索器从知识图谱中高效提取信息。然而,现有方法常忽视图结构中固有的语义稀疏问题。实验表明,这些方法存在语义捷径偏差和长尾路径偏差,导致语义建模不足,影响GraphRAG效果。为此,本文提出STAR:一种语义调优且尾部自适应的检索器。STAR融合两种学习范式:词元级交互学习与路径加权对比学习。前者采用交叉注意力架构与硬路径挖掘机制,联合建模查询与路径,缓解语义捷径偏差;后者设计尾部自适应路径加权的对比学习目标,优化训练过程,缓解长尾路径偏差。大量实验证明,STAR持续优于基线,在所有基准数据集上平均检索性能提升1.8%,大语言模型问答性能提升2.2%。代码已公开于https://anonymous.4open.science/r/STAR-C583。

原文摘要 · Abstract (English)

To augment Large Language Models (LLMs) for multi-hop question answering, a mainstream solution within Graph Retrieval Augmented Generation (GraphRAG) leverages lightweight retrievers to efficiently extract information from a given Knowledge Graph (KG). However, existing methods often overlook the inherent challenge of sparse semantic information in graphs. Specifically, our experiments reveal that these methods produce biased retrieval Semantic Shortcut Bias and Long-Tail Path Bias, leading to inadequate semantic modeling and limited GraphRAG effectiveness. To address these issues, we propose STAR, a semantic-tuned and tail-adaptive retriever for GraphRAG. STAR integrates two key learning paradigms: token-level interaction learning and path-weighted contrastive learning. The former employs a cross-attention architecture and a hard path mining mechanism to jointly model the query and path, thereby mitigating the Semantic Shortcut Bias. The latter introduces a tailored contrastive learning objective that utilizes tail-adaptive path weighting, designed to optimize the training process and ease the Long-Tail Path Bias. Extensive experiments demonstrate that STAR consistently outperforms baselines, achieving average retrieval performance gains of 1.8\% and LLM QA performance improvements of 2.2\% across all benchmark datasets. Our code is available at https://anonymous.4open.science/r/STAR-C583.

图检索大模型问答系统

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