SOURCE-LINKED INTELLIGENCE

GUT: Quantifying and Optimizing the Reasoning Uncertainty of LLMs via Graph Complexity

arXiv · AI, language, vision and robotics · article · Sep 4, 2026 · UTC

Recent years have witnessed great advances in the reasoning ability of Large Language Models (LLMs). However, the reasoning processes of LLMs often exhibit uncertainty, where LLMs often produce a proliferation of divergent branches at each reasoning step even when fed the same prompting inputs, and certain branches exhibit evidently incredible, even nonsensical, reasoning chains and results. In this paper, we propose the Graph-complexity-based UncerTainty (GUT) method for investigating the reasoning uncertainty of LLMs. The key idea of GUT is to characterize the potential branches of each reas

Read original source ↗ Open in workspace

recordType

paper

region

Global