Evolve on Graph: Self-Evolving Knowledge Graph Reasoning without Question Annotations
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
GraphCert introduces a method to bootstrap graph reasoning agents by generating graph‑grounded question‑answer pairs and certifying the supporting evidence. The approach uses a Bootstrapped Graph Quizzer to produce QA pairs, then executes and semantically curates the evidence into certified rubrics that guide reward‑based training of a Graph Solver. Experiments on five GRBENCH domains show GraphCert outperforms larger LLM agents and demonstrates robust policy transfer across heterogeneous graphs.
arXiv:2602.02518v3 Announce Type: replace-cross Abstract: Large language models (LLMs) increasingly rely on external knowledge to improve factuality, yet many knowledge sources on the Web, such as sc...
Agent0 is a fully autonomous framework that enables large language model agents to evolve without external data by using a multi‑step co‑evolution process. It pits a curriculum agent against an executor agent, both derived from the same base LLM, where the curriculum agent creates increasingly challenging tasks and the executor learns to solve them. By integrating external tools into the executor’s workflow, the system creates a self‑reinforcing cycle that continuously generates high‑quality curricula, leading to significant gains in reasoning performance—an 18% improvement on mathematical reasoning and 24% on general reasoning for the Qwen3‑8B‑Base model.
arXiv:2610.06650v2 Announce Type: replace Abstract: Wikidata is one of the largest open knowledge bases, yet answering a complex question over it still requires a SPARQL query that names the right en...
arXiv:2601. 07055v2 Announce Type: replace Abstract: As high-quality data becomes increasingly difficult to obtain, self-evolution without curated training data has emerged as a promising paradigm.
The paper introduces the Procedural Graph, a framework that structures procedural knowledge into (procedure, relation, procedure) triplets to guide large language model agents in planning and tool usage. At each decision point, a guidance model uses the local subgraph to bias the agent’s next action, while an LLM refiner self‑evolves the graph by editing its topology based on successful versus failed trajectories. Experiments across datasets and LLMs show that Procedural Graphs consistently outperform memory‑based baselines, and the self‑evolution mechanism further improves performance without manual engineering.