analiza aiqbench
Graph-R1 introduces an agentic framework that replaces static chunk-based retrieval with end-to-end reinforcement learning to optimize multi-turn knowledge graph interactions. By utilizing lightweight hypergraph construction and an end-to-end reward mechanism, the approach improves reasoning accuracy and retrieval efficiency over traditional GraphRAG methods. The associated code and datasets are publicly available for further evaluation and integration.
Graph-R1: Towards Agentic GraphRAG Framework via End-to-end Reinforcement Learning
arXiv:2507.21892v2 Announce Type: replace Abstract: Retrieval-Augmented Generation (RAG) mitigates hallucination in LLMs by incorporating external knowledge, but relies on chunk-based retrieval that lacks structural semantics. GraphRAG methods improve RAG by modeling knowledge as entity-relation graphs, but still face challenges in high construction cost, fixed one-time retrieval, and reliance on long-context reasoning and prompt design. To address these challenges, we propose Graph-R1, the first agentic GraphRAG framework via end-to-end reinforcement learning (RL). It introduces lightweight knowledge hypergraph construction, models retrieval as a multi-turn agent-environment interaction, and optimizes the agent process via an end-to-end reward mechanism. Experiments on standard RAG datasets show that Graph-R1 outperforms traditional GraphRAG and RL-enhanced RAG methods in reasoning accuracy, retrieval efficiency, and generation quality. Our software and data are publicly available at https://github.com/LHRLAB/Graph-R1.
Abstract:Retrieval-Augmented Generation (RAG) mitigates hallucination in LLMs by incorporating external knowledge, but relies on chunk-based retrieval that lacks structural semantics. GraphRAG methods improve RAG by modeling knowledge as entity-relation graphs, but still face challenges in high construction cost, fixed one-time retrieval, and reliance on long-context reasoning and prompt design. To address these challenges, we propose Graph-R1, the first agentic GraphRAG framework via end-to-end reinforcement learning (RL). It introduces lightweight knowledge hypergraph construction, models retrieval as a multi-turn agent-environment interaction, and optimizes the agent process via an end-to-end reward mechanism. Experiments on standard RAG datasets show that Graph-R1 outperforms traditional GraphRAG and RL-enhanced RAG methods in reasoning accuracy, retrieval efficiency, and generation quality. Our software and data are publicly available at this https URL.
Computation and Language (cs.CL)
arXiv:2507.21892 [cs.CL]
(or arXiv:2507.21892v2 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2507.21892 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 216 cuvinte
Subiecte conexe

Graph neural network predicts qubit routing costs
Quantum Zeitgeist · 18 sept. 2026

AI and Quantum Computing Briefing
livetradingnews.com · 4 aug. 2026
PathRouter: Aligning Rewards with Retrieval Quality in Agentic Graph Retrieval-Augmented Generation
arXiv · 17 iun. 2026

Three perspectives on corrigibility - shards, simulators, singular learning
LessWrong · 16 oct. 2026