PapersSelected

Meta and Michigan State paper finds LLM-built reasoning graphs unreliable

Why we picked it

The non-obvious point is that most reasoning-graph pipelines assume the LLM's decomposition is correct without ever verifying it, so confidence scores inherit hidden graph errors. Builders of agent workflows and RAG-style decomposition systems should add graph-level validation before trusting computed confidence. The Qwen3-32B versus Qwen3-8B result is a concrete warning that scaling a model does not guarantee better sub-question answering.

A paper from Meta and Michigan State University examines methods that split a question into a graph of sub-questions and compute answers or confidence scores on top. The authors find that the LLM-generated graphs themselves vary widely in quality, and their errors propagate into downstream confidence scores. They tested 9 models under varying levels of assistance, from wiring pre-given steps to building the entire graph. Graph quality tracked model family and graph shape more than parameter size, and Qwen3-32B answered sub-questions worse than Qwen3-8B.

Original · rohanpaul_ai

New Meta + Michigan State Univ paper finds that LLM-built reasoning graphs vary widely in quality, and their errors carry into the confidence scores computed from them.

Many methods split a question into a graph of sub-questions, then compute answers or confidence on top. They assume the LLM's graph is correct, which is rarely checked.

They tested 9 models with less and less help, from wiring given steps to building the whole graph. Quality tracked model family and graph shape more than size, and Qwen3-32B answered sub-questions worse than Qwen3-8B.

If you build on LLM-made reasoning graphs, check the graph itself before trusting answers or confidence computed from it.