When LLM agents pass intermediate judgments downstream without uncertainty, later decisions may treat tentative assumptions as facts. Effective uncertainty propagation must preserve information for correction and update inherited beliefs as new evidence arrives. Yet scalar scores omit information needed for revision, while detailed descriptions and reflection incur additional costs. We introduce Latent Uncertainty, a latent-space estimator that preserves uncertainty-relevant information without lengthy descriptions. Building on this, we propose LProp (Latent Uncertainty Propagation), which revises inherited answer distributions using latent representations and new evidence without additional trajectory sampling. We evaluate both methods across multiple-choice, yes/no, open-ended question answering, and mathematical reasoning tasks. Our approach outperforms baselines on most metrics, while LProp achieves the lowest mean inference-token usage in all eight propagation settings. Matched feature ablations further demonstrate that inherited latent content improves error recovery beyond answer probabilities or model capacity alone.
Figures & tables
Figure 1: Two gaps in uncertainty propagation. (a) Compact representations lose uncertainty details, while detailed descriptions increase input cost. (b) Risk estimation alone does not specify how to revise beliefs, while reflection requires additional generation, motivating efficient and timely uncertainty updates.
Figure 2: Overview of Latent Uncertainty and LProp. (a) The latent risk reader estimates answer-failure risk from hidden states and generation statistics, while an answer-indexed carrier retains candidate-specific content and support. (b) LProp updates latent content and candidate probability mass with new evidence, enabling answer revision and uncertainty estimation across subsequent handoffs.
Figure 3: Latent uncertainty as an error-risk estimator. Reader metrics are averaged over five training seeds. Rows show settings; columns show metrics. Gray circles: baselines; blue diamonds: Ours. Axes are zoomed and matched within each metric. Values and calibration details appear in Table 3 and Appendix B.1.4 .
Qwen3-8B
Mistral-7B-Instruct-v0.3
Method
F1 ↑
AUROC ↑
AUARC ↑
@20 ↑
@30 ↑
@50 ↑
F1 ↑
AUROC ↑
AUARC ↑
@20 ↑
@30 ↑
@50 ↑
BoolQ
SAUP
0.7630
0.5902
0.8347
0.8000
0.8114
0.8340
0.6990
0.5794
0.7136
0.7225
0.7343
0.7540
TRACER
0.7570
0.5076
0.7927
0.7838
0.7886
0.7920
0.6790
0.4730
0.6575
0.6912
0.6857
0.6820
AUQ
0.7480
0.7038
0.8520
0.7989
0.8164
0.8489
0.6650
0.4191
0.5383
0.6687
0.6588
0.6272
UProp
0.7870
0.5581
0.7976
0.8162
0.8143
0.8080
0.7190
0.5757
0.7066
0.7349
0.7414
0.7560
Table 1: Uncertainty propagation main results. LProp uses a three-head probability ensemble, with metrics computed after answer selection. All metrics prefer higher values. HotpotQA uses answer-token F1 and exact-match correctness for AUROC, AUARC and retained-answer metrics. The best values use boldface and darker shading; second-best distinct values use lighter shading. Approximate 95% bootstrap interval half-widths are reported in Appendix B.2.7 , Table 5 .
Figure 4: Sensitivity to model capacity on BoolQ with Qwen3-8B. Top: latent dimension; bottom: hidden width, with the other parameter fixed at 64. Horizontal axes use a log scale.
Figure 5: Inference token cost in the LProp propagation experiment. Values report mean tokens per question for LProp and the compared baselines. The reported token costs are averaged over three runs.
Figure 6: Correctness gains and losses in matched receiver ablations. Bars show recovered errors (right) and introduced errors (left), each as a percentage of all questions; diamonds show net gains. Axes vary by benchmark.
Figure 7: Rejection-rate sensitivity on Qwen3-8B. Lines show LProp minus AUQ in retained-answer correctness. Positive values favor LProp; the dashed line denotes equal performance.
Appendix figures & tables9 assets
Supplementary material from the paper’s appendix.
Appendix
Dataset
Backbone
Train
Dev.
Eval.
HotpotQA
Qwen3-8B
512
128
1,024
HotpotQA
Qwen2.5-7B
512
128
1,024
StrategyQA
Qwen3-8B
512
128
1,024
Appendix
Table 2: Question counts for the Latent Uncertainty Estimator. Each row represents one dataset–backbone setting.
HotpotQA / Qwen3-8B
HotpotQA / Qwen2.5-7B
StrategyQA / Qwen3-8B
Method
AUROC ↑
AUARC ↑
@30 ↑
Brier ↓
AUROC ↑
AUARC ↑
@30 ↑
Brier ↓
AUROC ↑
AUARC ↑
@30 ↑
Brier ↓
Semantic Ent.
.7534
.7994
80.56
.1677
.8296
.7335
70.43
.1579
.6923
.7528
74.48
.1946
Semantic Probe
.6903
.7781
75.12
.1824
.7884
.7012
68.53
.1722
.6703
.7392
72.18
.2136
Token Ent.
.7128
.7937
76.15
.1812
.7984
.7118
68.76
.1703
.6599
.7456
72.25
.2018
Predictive Ent.
.7005
.7758
76.43
.1866
.7901
.7054
67.92
.1718
.6935
.7673
73.92
.1972
Len.-norm. PE
.7199
.7902
76.43
.1822
.7943
.7077
68.06
.1689
.6789
.7584
72.38
.2008
Appendix
Table 3: Complete uncertainty estimation results. Bold values indicate the best result within each setting and metric. @30 is a percentage; other metrics use their original scales. Brier uses development-calibrated failure probabilities.
Dataset
Backbone
Train
Dev.
Eval.
BoolQ
Qwen3-8B
4,096
512
1,000
Mistral-7B
4,096
512
1,000
StrategyQA
Qwen3-8B
512
128
480
Mistral-7B
512
128
480
MMLU math
Qwen3-8B
512
128
314
Mistral-7B
512
128
314
Appendix
Table 4: Question counts for the LProp main experiments. Mistral-7B denotes Mistral-7B-Instruct-v0.3. For both backbones on MMLU math, training and development use MMLU-Pro math.
Qwen3-8B
Mistral-7B-Instruct-v0.3
Method
F1
AUROC
AUARC
@20
@30
@50
F1
AUROC
AUARC
@20
@30
@50
BoolQ
SAUP
±0.0251
±0.0428
±0.0303
±0.0272
±0.0287
±0.0325
±0.0217
±0.0377
±0.0333
±0.0317
±0.0337
±0.0387
TRACER
±0.0234
±0.0432
±0.0346
±0.0283
±0.0301
±0.0349
±0.0287
±0.0381
±0.0378
±0.0319
±0.0344
±0.0405
AUQ
±0.0265
±0.0318
±0.0214
±0.0272
±0.0272
±0.0254
±0.0293
±0.0294
±0.0299
±0.0304
±0.0306
±0.0306
UProp
±0.0250
±0.0462
±0.0363
±0.0266
±0.0287
±0.0341
±0.0235
±0.0376
±0.0344
±0.0316
±0.0321
±0.0368
Appendix
Table 5: Approximate 95% interval half-widths for Table 1 . All half-widths use the same 0–1 scale as the corresponding main-table estimates.
Latent dimension
Hidden width
Value
ACC (%)
AUARC
ACC (%)
AUARC
32
83.20
0.9356
82.60
0.9353
64
84.70
0.9369
84.70
0.9369
128
82.50
0.9318
82.60
0.9382
256
82.40
0.9337
83.10
0.9407
1024
79.50
0.9126
83.00
0.9360
Appendix
Table 6: BoolQ parameter ablations on Qwen3-8B. The latent-dimension sweep fixes hidden width at 64, while the hidden-width sweep fixes latent dimension at 64. Higher values are better for both metrics. Bold indicates the best result within each sweep and metric.
Benchmark
Method
@10
@20
@30
@40
@50
@60
@70
@80
@90
BoolQ
AUQ
77.70
79.89
81.64
82.99
84.89
87.73
92.46
94.71
94.29
LProp
86.78
89.50
91.86
93.50
94.60
96.25
98.33
99.00
100.00
StrategyQA
AUQ
70.52
72.53
71.95
72.72
72.01
72.53
73.64
75.87
76.06
LProp
73.84
76.82
79.46
80.56
84.17
86.46
88.89
92.71
91.67
MMLU math
AUQ
92.11
93.39
94.09
93.67
93.26
92.66
91.66
89.62
83.73
LProp
93.99
94.84
95.00
95.77
98.09
98.41
97.89
98.41
96.88
Appendix
Table 7: Qwen3-8B rejection-rate results. Retained-answer correctness (%) at each rejection rate. LProp values are underlined. HotpotQA uses exact match.
Qwen3-8B
Mistral-7B-Instruct-v0.3
Method
BoolQ
StrategyQA
MMLU math
HotpotQA
BoolQ
StrategyQA
MMLU math
HotpotQA
SAUP
1,633.0
4,071.1
11,681.3
10,734.7
1,824.7
4,539.8
9,026.2
12,710.5
TRACER
1,747.3
4,184.5
11,753.1
10,868.1
1,953.3
4,673.2
9,223.6
12,765.5
AUQ
4,732.7
15,833.3
10,855.1
13,919.3
4,487.5
12,253.7
15,827.4
15,564.7
UProp
4,489.1
9,472.8
21,313.3
19,002.4
5,278.2
11,260.5
19,150.3
23,548.5
LProp
577.7
1,930.9
8,976.7
8,260.3
597.9
2,119.7
6,582.5
11,222.7
Appendix
Table 8: Mean inference tokens per question ( ↓ ). Includes generation input/output, backbone encoding, and auxiliary scoring; excludes training and padding. Bold indicates the lowest value within each setting.
Figure 16
BoolQ
StrategyQA
MMLU mathematics
HotpotQA
Initial W/C
291 / 709
167 / 313
33 / 281
267 / 245
N
1,000
480
314
512
Receiver
W→C
C→W
Final C
W→C
C→W
Final C
W→C
C→W
Final C
W→C
C→W
Final C
Full LProp
182
51
840
73
25
361
13
7
287
21
3
263
Handoff representation
Probability-only
144
72
781
33
26
320
8
7
282
1
4
242
Appendix
Table 9: Matched receiver ablation counts with frozen Qwen3-8B. W and C denote wrong and correct answers. The two transition columns count recovered errors and introduced errors. Gray shades mark the best and second-best final-correct counts within each benchmark; full-model values are underlined.
Uncertainty propagation studies how measurement, model, and data uncertainty flows through computations and affects downstream predictions and decisions.
Large Language Models (LLMs) have achieved significant breakthroughs across various domains, but they can still produce unreliable or misleading outputs. For responsible LLM applications, uncertainty quantification techniques are used to estimate a model's uncertainty about its outputs, indicating the likelihood that those outputs may be problematic. For LLM reasoning tasks, it is essential to estimate uncertainty not only in the final answer but also in the intermediate reasoning process, particularly to identify where uncertainty arises. Such information may enable more fine-grained and targeted interventions during inference. In this study, we investigate which metrics can effectively localize uncertain places within an LLM reasoning trajectory. Our study reveals that uncertain intermediate continuations are more likely to occur at tokens that are highly sensitive to perturbations in the embeddings of preceding tokens. In our experiments, we show that such perturbation-based metrics achieve stronger performance in localizing uncertain intermediate steps than baseline methods, including probability-based, sampling-based, and Bayesian-based approaches. Meanwhile, our proposed metrics also enjoy good simplicity and efficiency.
Reliable uncertainty quantification (UQ) is essential for deploying large language model (LLM) agents in complex interactive environments. Existing UQ methods largely rely on local signals, such as token probabilities, predictive entropy, or per-step confidence, and therefore overlook the long-range dependencies through which errors accumulate across an execution trajectory. As a result, they may fail to identify agent failures whose causes originate several reasoning or interaction steps before the final answer. We propose RUPA (Relational Uncertainty Propagation for Agents), a trajectory-level UQ framework for LLM agents. RUPA represents an execution history as a directed trajectory graph in which reasoning states, tool interactions, and environment feedback are nodes connected by temporal and semantic dependency edges. It then propagates uncertainty over this graph to capture how execution risk accumulates and transfers across interaction steps. The propagated signal is combined with trajectory-level behavioral features and goal-alignment information to produce a confidence estimate for the full agent trajectory. We evaluate RUPA on representative agent benchmarks, including τ-2, Terminal-Bench-2, and GAIA, using 6 open-source LLMs spanning multiple model families. Experimental results show that RUPA consistently outperforms existing UQ methods by providing more accurate uncertainty estimates, enabling earlier failure detection, and improving uncertainty-guided agent execution across diverse agent tasks. These results demonstrate that explicitly modeling relational dependency is crucial to reliable UQ for long-horizon LLM agents, providing a practical foundation for trustworthy agent execution.
Zhengzhao Ma, Boxi Cao, Yaojie Lu +3
Chinese Information Processing Laboratory, Institute of Software, Chinese Academy of Sciences · University of Chinese Academy of Sciences, Beijing, China
Retrieval-augmented generation improves knowledge-intensive question answering, but indiscriminate retrieval can introduce irrelevant evidence and unnecessary computation. We investigate whether verbalized confidence from black-box language models can serve as an actionable signal for retrieval routing. Our method, BeyondUncertainty, first elicits a structured provisional answer and confidence estimate, then applies a model-specific threshold selected on held-out validation data and frozen before test evaluation. Low-confidence questions receive top-5 TF-IDF retrieval followed by a second answer call, whereas high-confidence questions return the provisional answer directly. We evaluate 27,000 policy instances across six QA benchmarks, three model families, and three retrieval policies. BeyondUncertainty achieves 0.483 mean token-level F1, compared with 0.467 for always retrieval and 0.401 for no retrieval, while reducing retrieved passages by 20.4% relative to always retrieval. When matched on the number of questions routed to retrieval within each dataset-model cell, it outperforms a post-hoc random allocation in 17 of 18 settings, with an average gain of 0.024 F1. Although poorly calibrated as an absolute probability, probe uncertainty modestly predicts question-level retrieval benefit (AUROC = 0.628). However, the additional probe increases total token usage by 28.2%, revealing a trade-off between more selective evidence acquisition and end-to-end token efficiency.