TL;DR
GraphWalker introduces a novel agentic KGQA framework that synthesizes diverse reasoning trajectories and employs stage-wise fine-tuning, significantly improving reasoning and generalization capabilities.
Contribution
It proposes Automated Trajectory Synthesis and Stage-wise Fine-tuning to enhance agent exploration and reasoning in knowledge graph question answering.
Findings
Achieves state-of-the-art on CWQ and WebQSP datasets.
Enhances out-of-distribution reasoning on GrailQA and GraphWalkerBench.
Stage-wise training unlocks higher performance with lightweight RL.
Abstract
Agentic knowledge graph question answering (KGQA) requires an agent to iteratively interact with knowledge graphs (KGs), posing challenges in both training data scarcity and reasoning generalization. Specifically, existing approaches often restrict agent exploration: prompting-based methods lack autonomous navigation training, while current training pipelines usually confine reasoning to predefined trajectories. To this end, this paper proposes \textit{GraphWalker}, a novel agentic KGQA framework that addresses these challenges through \textit{Automated Trajectory Synthesis} and \textit{Stage-wise Fine-tuning}. GraphWalker adopts a two-stage SFT training paradigm: First, the agent is trained on structurally diverse trajectories synthesized from constrained random-walk paths, establishing a broad exploration prior over the KG; Second, the agent is further fine-tuned on a small set of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
