AgentKGV: Agentic LLM-RAG Framework with Two-Stage Training for the Fact Verification of Knowledge Graphs
Researchers propose AgentKGV, an agentic LLM-RAG framework for verifying facts in knowledge graphs. It uses dynamic routing and iterative query rewriting to handle surface-form mismatches in document-level retrieval, and introduces a two-stage training process to improve accuracy and cost-efficiency for industrial deployment.
Entities
Related
DynaKRAG: A unified framework for learnable evidence control in multi-hop RAG
Researchers propose DynaKRAG, a framework that learns a state-conditioned policy to dynamically choose among evidence operations (retrieval, reformulation, critique, sufficiency checking) in multi-hop retrieval-augmented generation. This moves beyond fixed pipelines, potentially improving accuracy and flexibility in complex QA tasks.
RSF-GLLM framework decouples differentiable graph reasoning from answer generation for multi-hop QA over knowledge graphs
Researchers propose RSF-GLLM, a framework that decouples differentiable graph reasoning from answer generation to address the non-differentiability issue in traditional retrieve-then-read pipelines for multi-hop question answering over knowledge graphs. The Recurrent Soft-Flow module uses a GRU-guided query updater and dynamic gating to propagate relevance scores across semantically dissimilar bridge nodes.
GRACE: Graph-Regularized Agentic Context Evolution for Reliable Long-Horizon LLM Agents
A new arXiv paper proposes GRACE, a method that maintains persistent system-level instructions for LLM agents as a typed semantic graph instead of flat text. This graph-regularized approach enables scoped verification and reliable context evolution over long horizons under distribution shift, addressing verification difficulties from accumulated instructions.
Executable ontologies fix confident-wrong-answer problem in graph RAG
A developer reports that graph-backed retrieval systems can produce confident wrong answers when traversing incorrect edge types, e.g., returning 'this person directed the genre Crime' due to a directed_by edge leaving a Genre node. The fix is making the ontology executable: declaring domain/range per relationship in YAML and checking every hop at runtime, so bad hops raise named errors instead of returning wrong nodes.
Knowledge graph search with electrical circuit scoring
OpenKGO replaces binary yes/no matching in knowledge graph search with a scoring system modeled as an electrical circuit. Each query becomes a circuit where relevance is measured by current flow, enabling soft ranking instead of hard pattern matching. It runs locally, is open source under Apache-2.0, and aims to improve retrieval for RAG and search applications.
