← Latest papers
💻 computer science

A Multi-Agent Framework for Diagnosis and Plan Repair in Knowledge Graph Question Answering

This paper proposes TRACE, a multi-agent framework that enhances Knowledge Graph Question Answering by dynamically diagnosing and repairing LLM reasoning plans through targeted evidence retrieval and verification, thereby mitigating hallucinations and improving accuracy over existing static approaches.

Original authors: Xiaohong Yu, Shunzhi Wang, Jun Wu, Jijun Zhu

Published 2026-10-08
📖 4 min read☕ Coffee break read

Original authors: Xiaohong Yu, Shunzhi Wang, Jun Wu, Jijun Zhu

Original paper licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the rapidly evolving world of artificial intelligence, computers have learned to read, write, and reason with a fluency that once seemed impossible. These systems, known as large language models, can answer complex questions by drawing on the vast amount of text they have studied. However, this strength is also a weakness. Because these models rely on what they have memorized, they can sometimes invent facts or confidently state things that are simply untrue, a problem researchers call hallucination. To fix this, scientists have begun connecting these models to knowledge graphs, which are structured databases of facts that act like a reliable map of the world. While this combination helps, current methods often follow a rigid path: they generate a plan, look up facts, and move forward. If the plan contains a mistake early on, the system often fails to notice, continuing down the wrong path until the final answer is wrong. The challenge has been creating a system that can not only look up facts but also stop, check its work, and correct itself when the evidence doesn't match its expectations.

A team of researchers has addressed this challenge with a new framework called TRACE, designed to make artificial intelligence more reliable when answering complex questions. Instead of letting the computer race through a series of steps, TRACE breaks the process into a careful loop of planning, checking, and fixing. The system begins by asking the large language model to create a structured plan, essentially a step-by-step sketch of how it intends to find the answer. This plan is then handed to a specialized agent that goes to the knowledge graph to find evidence for each specific step. A third agent acts as a strict auditor, comparing the model's predicted observations against the actual facts retrieved from the database. If the facts align, the system moves forward. If they do not, the system triggers a repair mechanism that diagnoses exactly what went wrong and adjusts the plan accordingly.

The researchers tested this approach on three different sets of difficult questions that require connecting multiple pieces of information. They found that TRACE consistently outperformed other methods that rely on agents to interact with knowledge graphs. When using a powerful model known as GPT-4, the new framework achieved an exact match score of 80.0 percent, meaning it got the right answer 80 percent of the time, compared to 78.0 percent for the next best method. More importantly, the system showed a significant improvement in the quality of its partial answers, with a score of 66.8 compared to 48.8 for the competitor. This suggests that even when the system does not get the perfect answer, it is much closer to the truth than previous methods. The study also showed that this approach works well with smaller, less powerful models, helping them avoid the common trap of making up facts.

What makes TRACE distinct is how it handles errors. In traditional systems, if a model makes a mistake in the first step of a reasoning chain, that error often spreads, leading to a completely wrong conclusion. TRACE prevents this by treating the knowledge graph as a checkpoint at every single step. If the system tries to say that a famous painter died in a specific city, but the database shows he died in a different one, the system stops immediately. It does not just ignore the conflict; it activates a repair strategy. Depending on the type of error, the system might simply swap out the wrong fact for the correct one, roll back to a previous step to try a different path, or break the question down into smaller, more manageable parts to ensure no constraints are missed. This process is guided by a scoring system that evaluates which repair strategy offers the most reliable path forward, ensuring that the final answer is grounded in verified evidence rather than guesswork.

The researchers also looked at the cost of running this more careful system. Because the process involves checking and potentially repairing the plan, one might expect it to use significantly more computing power. However, the study found that TRACE actually uses fewer words, or tokens, to reach an answer compared to other advanced methods. While it makes a slightly higher number of calls to the model than one competitor, the total volume of text processed is lower, making the system more efficient overall. This efficiency gain comes from the system's ability to stop early when it detects a dead end, rather than wasting resources following a flawed path to its conclusion. The results suggest that by building in a mechanism for self-correction and verification, artificial intelligence can become not only smarter but also more efficient and trustworthy in its reasoning.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →