paper-with-me

홈 › Papers

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

2026-09-04 · Shuang Liang, Xin-Yu Hu, Xiang-Jun Ou, Shao-Qun Zhang arxiv

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 reasoning chain with a directed acyclic graph, thereby ensuring that all potential branches are comprehensively covered within the graph space. Building upon this recognition, we further build two modules of GUT, that is, a Quantification (GUT-Q) module and an Optimization (GUT-O) module, for quantifying and reducing the reasoning uncertainty of LLMs, respectively. GUT-Q measures LLM reasoning uncertainty by approximating the reasoning space complexity with graph complexity. GUT-O implements uncertainty optimization by treating negative uncertainty as the reward function in reinforcement learning. Experimental results conducted on four LLMs and five datasets validate the effectiveness of GUT.

📄 PDF Abstract BibTeX arXiv:2609.05284

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Quantifying Uncertainty in Natural Language Explanations of Large Language Models

2023-11-06 · Sree Harsha Tanneru, Chirag Agarwal, Himabindu Lakkaraju

Large Language Models (LLMs) are increasingly used as powerful tools for several high-stakes natural language processing (NLP) applications. Recent prompting works claim to elicit intermediate reasoning steps and key tok…

Can We Trust LLM's Logic? Quantifying Uncertainty, Coherence, and Robustness via a Graph-Based Framework

2026-07-09 · Riccardo Revalor, Jalees Rehman, Debjit Pal arxiv

Large-Language Models (LLMs) can be prone to flawed and unfaithful reasoning that decoding strategies like Self-Consistency (SC) fail to detect as they evaluate only final-answer agreement while ignoring the logical vali…

Quantifying and Understanding Uncertainty in Large Reasoning Models

2026-04-15 · Yangyi Li, Chenxu Zhao, Mengdi Huai arxiv

Large Reasoning Models (LRMs) have recently demonstrated significant improvements in complex reasoning. While quantifying generation uncertainty in LRMs is crucial, traditional methods are often insufficient because they…

Answer Generation

Quantifying the multi-objective cost of uncertainty

2020-10-07 · Byung-Jun Yoon, Xiaoning Qian, Edward R. Dougherty

Various real-world applications involve modeling complex systems with immense uncertainty and optimizing multiple objectives based on the uncertain model. Quantifying the impact of the model uncertainty on the given oper…

Why Does Self-Distillation (Sometimes) Degrade the Reasoning Capability of LLMs?

2026-03-25 · Jeonghye Kim, Xufang Luo, Minbeom Kim, Sangmook Lee 외 arxiv

Self-distillation has emerged as an effective post-training paradigm for LLMs, often improving performance while shortening reasoning traces. However, in mathematical reasoning, we find that it can reduce response length…

Mathematical Reasoning