mlsanityData to 14 Oct 2026

Not all uncertainty is alike: volatility, stochasticity, and exploration

arXiv 2605.19215 ↗First posted 19 May 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Adaptive decision-making in biological and artificial intelligence requires balancing the exploitation of known outcomes with the exploration of uncertain alternatives. Although prior work suggests that uncertainty generally promotes exploration, it has typically treated distinct sources of environmental uncertainty as equivalent. We consider environments with latent reward states that drift over time (volatility) and are observed through noisy outcomes (stochasticity). Both increase posterior uncertainty, yet we show they drive optimal exploration in opposite directions: volatility enhances it, stochasticity suppresses it. We establish this asymmetry formally by extending the Gittins index framework to Gaussian state-space bandits with latent dynamics. We further derive Cause-Aware Uncertainty-Sensitive Exploration (CAUSE), a closed-form exploration bonus obtained via control-as-inference that inherits the same monotonicities. CAUSE outperforms standard exploration strategies in environments with heterogeneous noise structure, and also improves on a Gittins-per-arm policy whose rested-bandit optimality does not transfer to restless settings. Learning and exploration are governed by the same noise-inference asymmetry, and the framework predicts that pathological noise inference produces reversed rather than merely impaired exploration, with implications for computational accounts of psychiatric conditions.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 39 references that are in the map. First posted on arXiv 19 May 2026.

Builds on

7 of 39 references.

References · 7

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  2. 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 482
  3. 2017A Tutorial on Thompson Samplingcited by 433
  4. 2018Maximum a Posteriori Policy Optimisationcited by 328
  5. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  6. 2018Satisficing in Time-Sensitive Bandit Learningcited by 39
  7. 2022Non-Stationary Bandit Learning via Predictive Samplingcited by 21

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.