Uncertainty Estimation in LLM-Based Bandits

• The paper introduces uncertainty estimation methods, including Laplace Approximation, MC Dropout, and Epinet, to enhance exploration in LLM-based contextual bandits.
• It details scalable Bayesian inference techniques, such as diagonal and last-layer approximations, to robustly quantify epistemic uncertainty and minimize cumulative regret.
• Empirical evaluations on datasets like Hate Speech and IMDb show that uncertainty-aware Thompson Sampling significantly outperforms greedy policies in balancing exploration and exploitation.

Uncertainty estimation in LLM-based contextual bandits addresses the critical challenge of quantifying epistemic uncertainty in sequential decision-making tasks where context is provided in natural language. While recent LLM-based agents commonly rely on greedy reward prediction, uncertainty-aware policies—such as those leveraging Thompson Sampling—integrate principled probabilistic modeling, leading to fundamentally improved exploration-exploitation tradeoffs. This topic is exemplified in the setting of batch contextual bandits, where scalable approximations to Bayesian inference—Laplace Approximation, Monte Carlo Dropout, and Epistemic Neural Networks—can be layered atop LLMs to robustly estimate uncertainty and minimize cumulative regret (Felicioni et al., 2024).

1. Formalization of LLM-Based Contextual Bandits

A batch contextual bandit with text-based contexts is characterized as follows. At each round $t=1,\ldots,T$, the agent observes a batch of $B$ contexts $x_t^1,\ldots,x_t^B\in\mathcal X$, each presented as a natural language input. For each context $x_t^b$, the agent selects an action $a_t^b\in\mathcal A$, where $|\mathcal A|=K$, and receives a real-valued reward $r_t^b\in\mathbb R$. The expected reward is modeled via a parametric function $$f_\theta:\mathcal X\times\mathcal A\rightarrow\mathbb R$$:

$$r = f_\theta(x, a) + \epsilon, \quad \epsilon\sim\mathcal N(0, \sigma_{\mathrm{obs}}^2),$$

so that $\mathbb E[r|x,a]=f_\theta(x,a)$.

The objective is the minimization of average cumulative regret:

$B$0

where $B$1 denotes the expected reward of the optimal policy on round $B$2 (Felicioni et al., 2024).

2. Greedy LLM Bandit Baseline

The standard baseline employs a pre-trained LLM as a feature extractor $B$3, feeding its output into a linear layer to produce $B$4, so that $B$5 is the $B$6-th coordinate. The greedy policy is thus:

$B$7

where the parameter $B$8 is estimated by minimizing an $B$9-regularized mean squared error (MSE) loss:

$x_t^1,\ldots,x_t^B\in\mathcal X$0

with regularization $x_t^1,\ldots,x_t^B\in\mathcal X$1 enforcing a Gaussian prior of variance $x_t^1,\ldots,x_t^B\in\mathcal X$2 on $x_t^1,\ldots,x_t^B\in\mathcal X$3 centered at $x_t^1,\ldots,x_t^B\in\mathcal X$4 (Felicioni et al., 2024).

3. Scalable Uncertainty Estimation Methods

Uncertainty modeling is a prerequisite for effective exploration in contextual bandits and is requisite for sampling-based policies such as Thompson Sampling. Three mechanisms for approximate posterior inference in LLM-based bandits are examined:

3.1 Laplace Approximation (LA)

Laplace Approximation takes a Bayesian perspective, constructing a local Gaussian approximation to the posterior:

• Compute $x_t^1,\ldots,x_t^B\in\mathcal X$5.
• Approximate negative log posterior by a second-order Taylor expansion around $x_t^1,\ldots,x_t^B\in\mathcal X$6:

$x_t^1,\ldots,x_t^B\in\mathcal X$7

• Yields $x_t^1,\ldots,x_t^B\in\mathcal X$8.

For LLMs, scalable computation is obtained via:

• Recursive Hessian updates: $x_t^1,\ldots,x_t^B\in\mathcal X$9.
• Fisher-Hessian approximation: use diagonal $x_t^b$0.
• Last-layer LA: compute $x_t^b$1 only for the linear output layer, keeping the LLM backbone fixed during posterior sampling (Felicioni et al., 2024).

3.2 Monte Carlo Dropout

Applying dropout at inference is interpreted as sampling from a variational posterior $x_t^b$2:

• At each Thompson Sampling decision, sample a dropout mask $x_t^b$3 across the network, yielding a thinned parameter $x_t^b$4.
• Estimate predictive uncertainty by aggregating Monte Carlo samples:

$x_t^b$5

This mechanism implements efficient, scalable uncertainty quantification with minimal modifications to pre-trained LLMs (Felicioni et al., 2024).

3.3 Epistemic Neural Networks (Epinets)

Epinets integrate an auxiliary network $x_t^b$6 that takes as input the extracted base features and a random "epistemic index" $x_t^b$7:

$x_t^b$8

The training objective is:

$x_t^b$9

with $a_t^b\in\mathcal A$0 re-sampled per data point. Inference samples $a_t^b\in\mathcal A$1 to mimic Thompson Sampling, even in absence of explicit Bayesian formulation (Felicioni et al., 2024).

4. Thompson Sampling with Uncertainty Estimates

Thompson Sampling (TS) with parameter uncertainty is executed per round:

1. Observe batch $a_t^b\in\mathcal A$2.
2. Sample parameters $a_t^b\in\mathcal A$3 using one of the aforementioned approximations.
3. For each $a_t^b\in\mathcal A$4, select $a_t^b\in\mathcal A$5.
4. Observe rewards $a_t^b\in\mathcal A$6, augment dataset, and update posterior.

The process is formalized as: $|\mathcal A|=K$4 (Felicioni et al., 2024)

5. Empirical Evaluation and Key Findings

Empirical evaluation utilizes the "Measuring Hate Speech" dataset (≈136k comments) with each round presenting $a_t^b\in\mathcal A$7 comments. Actions are "publish" or "not-publish" with reward assignments: publishing a non-toxic comment yields $a_t^b\in\mathcal A$8, publishing a toxic comment yields $a_t^b\in\mathcal A$9, and not-publishing any comment yields $|\mathcal A|=K$0.

Protocols employ $|\mathcal A|=K$1 rounds and 20 random seeds, with fine-tuning for 50 epochs per round using Adam ($|\mathcal A|=K$2). Models assessed include:

• Greedy (no uncertainty estimation)
• TS with Dropout
• TS with diagonal Fisher Laplace Approximation ("Diag. LA")
• TS with last-layer full Laplace Approximation ("Last LA")
• TS with Epinet

Key findings:

• All TS variants, regardless of uncertainty estimation strategy, achieve substantially lower average regret than greedy.
• TS methods exhibit tighter confidence intervals; greedy incurs higher variance and in some seeds nearly constant regret.
• CDF analysis over random seeds shows TS dominates greedy both in worst-case and average performance.
• Action-selection ratio curves demonstrate greedy's under-exploration relative to TS methods, which achieve more balanced action distribution.

An additional IMDb dataset experiment confirms the qualitative pattern: epistemic uncertainty improves exploration and regret minimization (Felicioni et al., 2024).

6. Theoretical Insights and Practical Implications

Thompson Sampling, when the posterior is exact, attains near-optimal regret bounds, e.g., $|\mathcal A|=K$3 for linear bandits (Agrawal & Goyal 2017). Even approximate posteriors that capture core epistemic uncertainty can result in significantly improved empirical exploration compared to the greedy policy. Epistemic uncertainty drives exploration toward actions with high reward uncertainty; in contrast, deterministic greedy strategies risk premature convergence on suboptimal arms (Felicioni et al., 2024).

A plausible implication is that scalable, approximate uncertainty estimation can be deployed in LLM-based decision-making tasks with minimal incremental cost and substantial improvement in online performance. Even simple MC-Dropout, without re-tuning dropout probability, is highly competitive. More sophisticated methods (e.g., Laplace Approximation, Epinet) can further enhance robustness, but the primary benefit arises from incorporating any epistemic uncertainty into the decision policy.

7. Conclusions

Fine-tuning LLMs for reward prediction while neglecting epistemic uncertainty leads to unreliable and suboptimal decision-making in contextual bandit settings. Incorporating scalable uncertainty estimates—via Dropout, Laplace Approximation, or Epinet—within Thompson Sampling dramatically reduces regret and ensures more robust exploration. The principal finding is that modeling epistemic uncertainty is not optional, but fundamental for safe and efficient online decision-making in LLM-driven bandit problems (Felicioni et al., 2024).