AgentKGV: Agentic LLM-RAG Framework with Two-Stage Training for the Fact Verification of Knowledge Graphs
Summary
AgentKGV is an Agentic LLM-RAG framework designed for fact verification in knowledge graphs (KGs), addressing factual errors from automatic construction. It integrates dynamic routing and iterative query rewriting to handle surface-form mismatches in document retrieval. To enhance accuracy and cost-efficiency for industrial deployment, AgentKGV employs a two-stage training strategy: turn-level distillation-based SFT for stable query rewriting and reasoning, and trajectory-level GRPO to optimize search policy and reduce unnecessary retrieval. On the T-REx long-tail-predicate split, AgentKGV improves macro-F1 by 5.5 %p over single-turn RAG, with two-stage training adding another 9.4 %p. GRPO also reduces average search calls from 3.24 to 1.63 without accuracy loss, demonstrating its effectiveness on both English open-domain and Korean enterprise KGs.
Key takeaway
For Machine Learning Engineers building robust KG fact verification systems, AgentKGV's two-stage training offers a path to significantly improve accuracy and reduce inference costs. You should consider implementing distillation-based SFT to stabilize query rewriting for domain-specific predicates and GRPO to optimize search policies, cutting average retrieval calls by nearly half while maintaining or improving F1 scores. This approach is particularly valuable for industrial-scale KGs with long-tail predicates.
Key insights
AgentKGV uses agentic LLM-RAG with two-stage training to verify knowledge graph facts, improving accuracy and efficiency.
Principles
- Dynamic routing avoids unnecessary retrieval calls.
- Iterative query rewriting handles modality gaps.
- Distillation transfers reasoning to smaller models.
Method
AgentKGV dynamically routes verification, then iteratively rewrites compressed KG triples into natural language queries for document retrieval. A two-stage training strategy uses distillation-based SFT for query rewriting and GRPO for search policy optimization.
In practice
- Apply dynamic routing to reduce LLM inference costs.
- Use iterative query rewriting for complex retrieval.
- Distill large model knowledge to smaller models.
Topics
- Knowledge Graph Verification
- Agentic LLMs
- Retrieval-Augmented Generation
- Two-Stage Training
- Supervised Fine-Tuning
- Reinforcement Learning
Best for: Research Scientist, AI Scientist, Machine Learning Engineer, NLP Engineer
Related on AIssential
See Counsel's argued verdicts on the open AI decisions leaders are weighing →
Editorial summary, takeaway, and curation by AIssential. Original article published by cs.CL updates on arXiv.org.