mlsanityData to 14 Oct 2026

Variance Driven Exploration: A Provable and Efficient Methodology for Pure Exploration in Highly Stochastic Environments

arXiv 2608.21995 ↗First posted 22 Aug 2026cs.LG cs.AI stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose Variance Driven Exploration (VarDE), a principled approach for pure exploration in highly stochastic environments, where the exploration process is dominated by stochastic variance. VarDE is built on a fundamental principle: sampling effort should be allocated to minimize the uncertainty of the final decision. We formalize the uncertainty of the final decision through a smooth decision function and derive allocation rules that explicitly capture how stochastic noise in individual components affects the reliability of the final output. We apply this methodology to three core problems of pure exploration -- Best Arm Identification (BAI), Monte Carlo Tree Search (MCTS), and Best-Policy Identification (BPI) -- with theoretical guarantees on variance decay and simple regret. Empirically, we demonstrate consistent and significant improvements of VarDE over existing methods, with especially strong gains in highly stochastic environments.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 22 Aug 2026.

Builds on

15 of 26 references.

References · 15

  1. 2017Minimax Regret Bounds for Reinforcement Learningcited by 503
  2. 2018Is Q-learning Provably Efficient?cited by 487
  3. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  4. 2020Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisitedcited by 106
  5. 2020Fast active learning for pure exploration in reinforcement learningcited by 92
  6. 2021Navigating to the Best Policy in Markov Decision Processescited by 29
  7. 2020Adaptive Sampling for Best Policy Identification in Markov Decision Processescited by 20
  8. 2023Best Arm Identification with Fixed Budget: A Large Deviation Perspectivecited by 12
  9. 2024Monte Carlo Tree Search with Boltzmann Explorationcited by 12
  10. 2019Generalized Mean Estimation in Monte-Carlo Tree Searchcited by 8
  11. 2020Convex Regularization in Monte-Carlo Tree Searchcited by 8
  12. 2022A Unified Perspective on Value Backup and Exploration in Monte-Carlo Tree Searchcited by 6
3 more
  1. 2024Model-Free Active Exploration in Reinforcement Learningcited by 5
  2. 2023Monte-Carlo tree search with uncertainty propagation via optimal transportcited by 3
  3. 2024Power Mean Estimation in Stochastic Monte-Carlo Tree_Searchcited by 3

Built on by

Not cited yet.