跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2601.17755 · v3

HyperGraphPro: Progress-Aware Reinforcement Learning for Structure-Guided Hypergraph RAG

首次提交 2026-01-25 16:58
版本更新 2026-11-05 19:08
雷达观测 2026-11-06 12:09
arXiv ↗PDF ↗

摘要

Multi-hop question answering requires retrieval agents to construct a connected evidence path across reasoning turns rather than retrieve isolated relevant evidence for a single query. However, in existing GraphRAG methods, retrieval and reinforcement learning are often optimized with mismatched signals: retrieval is driven by local semantic relevance, while outcome-level reinforcement learning assigns the reward by assessing the final answer without identifying which retrieval actions progress the reasoning path. We introduce HyperGraphPro, a progress-aware hypergraph RAG framework that focuses on evidence-path progress as the shared objective for retrieval and policy optimization. For retrieval, HyperGraphPro reranks candidate hyperedges using query-conditioned structural distinctiveness, combining entity-query relevance with a local-vs-global hypergraph incidence signal to favor entities that are informative in the current graph neighborhood. For policy optimization, HyperGraphPro augments uniform trajectory-level reward assignment with stepwise progress-aware policy optimization, which assigns step-level rewards according to the coverage of answer-guided target hyperedges. Experiments on multi-hop question answering benchmarks demonstrate that HyperGraphPro consistently improves reasoning accuracy over existing GraphRAG methods.

作者备注:In progress

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-05 19:08 · 最新观测版本

HyperGraphPro: Progress-Aware Reinforcement Learning for Structure-Guided Hypergraph RAG

Multi-hop question answering requires retrieval agents to construct a connected evidence path across reasoning turns rather than retrieve isolated relevant evidence for a single query. However, in existing GraphRAG methods, retrieval and reinforcement learning are often optimized with mismatched signals: retrieval is driven by local semantic relevance, while outcome-level reinforcement learning assigns the reward by assessing the final answer without identifying which retrieval actions progress the reasoning path. We introduce HyperGraphPro, a progress-aware hypergraph RAG framework that focuses on evidence-path progress as the shared objective for retrieval and policy optimization. For retrieval, HyperGraphPro reranks candidate hyperedges using query-conditioned structural distinctiveness, combining entity-query relevance with a local-vs-global hypergraph incidence signal to favor entities that are informative in the current graph neighborhood. For policy optimization, HyperGraphPro augments uniform trajectory-level reward assignment with stepwise progress-aware policy optimization, which assigns step-level rewards according to the coverage of answer-guided target hyperedges. Experiments on multi-hop question answering benchmarks demonstrate that HyperGraphPro consistently improves reasoning accuracy over existing GraphRAG methods.

查看此版本解读 →查看此版本原文 ↗