Knowledge graphs provide structured and reliable information for many real-world applications, motivating increasing interest in combining large language models (LLMs) with graph-based retrieval to improve factual grounding. Recent Graph-based Retrieval-Augmented Generation (GraphRAG) methods therefore introduce iterative interaction between LLMs and knowledge graphs to enhance reasoning capability. However, existing approaches typically depend on manually designed guidance and interact with knowledge graphs through a limited set of predefined tools, which substantially constrains graph exploration. To address these limitations, we propose GraphScout, a training-centric agentic graph reasoning framework equipped with more flexible graph exploration tools. GraphScout enables models to autonomously interact with knowledge graphs to synthesize structured training data which are then used to post-train LLMs, thereby internalizing agentic graph reasoning ability without laborious manual annotation or task curation. Extensive experiments across five knowledge-graph domains show that a small model (e.g., Qwen3-4B) augmented with GraphScout outperforms baseline methods built on leading LLMs (e.g., Qwen-Max) by an average of 16.7% while requiring significantly fewer inference tokens. Moreover, GraphScout exhibits robust cross-domain transfer performance. Our code will be made publicly available~\footnote{https://github.com/Ying-Yuchen/_GraphScout_}.
Figures & tables
Figure 1. Qwen3-4B-Instruct with GraphScout achieves substantial gains over leading LLMs (e.g.,Qwen-Max) with prompting-based GraphRAG baselines in Healthcare dataset.
Figure 2. Overview of GraphScout framework.
Dataset
Healthcare
Literature
Academic
E-Commerce
Legal
Method
LLM
QwenScore
F1
QwenScore
F1
QwenScore
F1
QwenScore
F1
QwenScore
F1
GPT-4o
0.137
0.048
0.221
0.064
0.097
0.080
0.110
0.080
0.244
0.110
GLM-4.6
0.107
0.099
0.179
0.102
0.095
0.110
0.060
0.111
0.222
0.243
Qwen-Max
0.074
0.065
0.158
0.098
0.112
0.128
0.060
0.105
0.244
0.298
BaseLLM
DeepSeek-Chat
0.104
0.075
0.192
0.111
0.134
0.140
0.095
0.115
0.222
0.265
GPT-4o
0.074
0.059
0.179
0.116
0.098
0.090
0.200
0.181
0.256
0.232
Table 1. Performance Comparison on GRBENCH Across Baseline Methods and GraphScout. Relative improvement is measured against the strongest baseline on each dataset. On QwenScore, GraphScout achieves a 16.7% average gain.
Figure 3. Cross-Domain Generalization Performance Across Training and Test Domains.
Figure 4. Performance Comparison Across Question Difficulty Levels on GRBENCH using F1-score as the metric. The Healthcare domain contains no hard questions. For the Literature, all methods achieve an F1-score of 0% on hard questions.
Healthcare
Literature
QwenScore
F1
QwenScore
F1
GraphScout
0.819
0.855
0.696
0.646
w/o Graph Solver
0.211
0.217
0.210
0.220
w/o Acode
0.107
0.101
0.196
0.148
w/o rclue
0.785
0.812
0.667
0.635
rw Graph Quizzer
0.678
0.705
0.608
0.571
Table 2. Ablation study of GraphScout (“rw” denotes random walk on knowledge graphs).
Figure 5. Behavioral analysis across question difficulty levels.
Figure 6. Average token consumption of different methods.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Method
Hyperparameters
GraphScout
RL Algorithm = GRPO n_resp_per_prompt = 8 Temperature = 1.0 Threshold δ = 0.4 Optimization Steps = 400 Training samples per dataset = 2000
Figure 7. Distribution of the generated dataset in terms of question difficulty levels, question structural patterns, and answer types. All category labels are automatically judged by an LLM. The three pie charts summarize the proportions of different categories across the entire dataset.
Figure 8. Distribution of (a) question token lengths and (b) the number of clue nodes per question in Healthcare dataset.
Retrieval-Augmented Generation (RAG) has empowered Large Language Models (LLMs) to tackle knowledge-intensive tasks. However, navigating global, heterogeneous knowledge bases (large-scale knowledge graphs and text corpora) for complex reasoning remains a challenge. Existing methods typically employ reactive, graph-driven exploration strategies, which blindly follow graph topology without adapting to the question context or evolving exploration progress, and lack deep bidirectional synergy between graph and text. To address these limitations, we propose CoG (Cognition on Graph), a cognitive-inspired, training-free framework for adaptive knowledge exploration. Drawing inspiration from human problem-solving, CoG performs a continuous plan-explore-reflect cycle, where it proactively formulates investigation plans, performs dual-source retrieval, and dynamically reflects on progress to adjust strategies. Crucially, it establishes deep bidirectional synergy between structured graph and unstructured text, where entities extracted from text dynamically guide graph exploration to bridge knowledge gaps. Extensive experiments on seven multi-hop QA benchmarks demonstrate that CoG significantly outperforms state-of-the-art methods while achieving superior exploration efficiency. Our code and datasets are available at https://github.com/zhougengxian/CoG.
Gengxian Zhou, Jian Xu, Zichen Tang +3
Beijing University of Posts and Telecommunications · Zhongguancun Academy, Beijing · MAIS, Institute of Automation, Chinese Academy of Sciences +1
Large Language Models (LLMs) increasingly rely on agentic capabilities-iterative retrieval, tool use, and decision-making-to overcome the limits of static, parametric knowledge. Yet existing agentic frameworks treat external information as unstructured text and fail to leverage the topological dependencies inherent in real-world data. To bridge this gap, we introduce Agentic Graph Learning (AGL), a paradigm that reframes graph learning as an interleaved process of topology-aware navigation and LLM-based inference. Specifically, we propose AgentGL, the first reinforcement learning (RL)-driven framework for AGL. AgentGL equips an LLM agent with graph-native tools for multi-scale exploration, regulates tool usage via search-constrained thinking to balance accuracy and efficiency, and employs a graph-conditioned curriculum RL strategy to stabilize long-horizon policy learning without step-wise supervision. Across diverse Text-Attributed Graph (TAG) benchmarks and multiple LLM backbones, AgentGL substantially outperforms strong GraphLLMs and GraphRAG baselines, achieving absolute improvements of up to 17.5% in node classification and 28.4% in link prediction. These results demonstrate that AGL is a promising frontier for enabling LLMs to autonomously navigate and reason over complex relational environments. The code is publicly available at https://github.com/sunyuanfu/AgentGL.
Yuanfu Sun, Kang Li, Dongzhe Fan +2
New York University Shanghai · New York University · Tsinghua University
Graph retrieval-augmented generation (GraphRAG) enhances large language models with structured knowledge, yet existing systems construct knowledge graphs in a single extraction pass, producing noisy entities and brittle retrieval. RAGU, an open-source modular GraphRAG engine, addresses this by separating extraction from consolidation: entities and relations pass through two-stage typed extraction, DBSCAN-backed deduplication, LLM summarization, and Leiden community detection. A key insight motivates a compact extractor: the skills an in-pipeline LLM needs - comprehension, extraction, reasoning over context - are language skills that grow only weakly with model size, unlike factual world knowledge. Accordingly, we train Meno-Lite-0.1, a 7B model optimized for language skills, which outperforms Qwen2.5-32B on knowledge-graph construction (+12.5% relative harmonic mean) and matches it on English GraphRAG tasks. On GraphRAG-Bench (Medical), RAGU retrieves the most complete context at every factoid level (evidence recall up to 0.84 vs. ≤0.76) and overtakes HippoRAG2 on synthesis tasks; on multi-hop factoid QA, the apparent HippoRAG2 advantage is shown to be largely an answer-format artifact. RAGU is installable via \texttt{pip install graph_ragu}, runs on a single GPU, and is released under MIT. The source code is publicly available at https://github.com/RaguTeam/RAGU, and the Meno-Lite-0.1 model can be obtained from https://huggingface.co/bond005/meno-lite-0.1.
Mikhail Komarov, Ivan Bondarenko, Stanislav Shtuka +5
1ITMO University · 2Novosibirsk State University · 3Far Eastern Federal University +1