AutoGraph-R1: End-to-End Reinforcement Learning for Knowledge Graph Construction

arXiv:2510.15339v3 Announce Type: replace Abstract: Building effective knowledge graphs (KGs) for Retrieval-Augmented Generation (RAG) is pivotal for advancing question answering (QA) systems. However, its effectiveness is hindered by a fundamental disconnect: the knowledge graph (KG) construction process is decoupled from its downstream application, yielding suboptimal graph structures. To bridge this gap, we introduce AutoGraph-R1, the first framework to directly optimize KG construction for task performance using Reinforcement Learning (RL). AutoGraph-R1 trains an LLM constructor by framing graph generation as a policy learning problem, where the reward is derived from the graph's functional utility in a RAG pipeline. We design two novel, task-aware reward functions, one for graphs as knowledge carriers and another as knowledge indices. Across multiple QA benchmarks, AutoGraph-R1 consistently enables graph RAG methods to achieve significant performance gains over using task-agnostic baseline graphs. Our work shows it is possible to close the loop between construction and application, shifting the paradigm from building intrinsically good'' graphs to building demonstrably useful'' ones.

Related

• HyperGraphPro: Progress-Aware Reinforcement Learning for Structure-Guided Hypergraph RAG
• Advancing Multi-Agent RAG Systems with Minimalist Reinforcement Learning
• IG-Search: Step-Level Information Gain Rewards for Search-Augmented Reasoning
• AAPO: Enhancing the Reasoning Capabilities of LLMs with Advantage Margin
• Evidence-Augmented Policy Optimization with Reward Co-Evolution for Long-Context Reasoning

Source: arXiv cs.CL | 2026-04-21