Variance Driven Exploration: A Provable and Efficient Methodology for Pure Exploration in Highly Stochastic Environments
Khang Luong, Nam Nguyen, Hoang Ta, Hung Tran-The, Tuan Dam
Abstract
We propose ** Var iance D riven E xploration (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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext da55798c-e2b3-4291-adb6-6bf08de6de73Builds on8
- Fast active learning for pure exploration in reinforcement learningPierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Emilie Kaufmann et al.ICML 2021 · 110 citations
- Adaptive Sampling for Best Policy Identification in Markov Decision ProcessesAymen Al Marjani, Alexandre ProutièreICML 2021 · 26 citations
- Monte Carlo Tree Search with Boltzmann ExplorationMichael Painter, Mohamed Baioumy, Nick Hawes, Bruno LacerdaNeurIPS 2023 · 17 citations
- Best Arm Identification with Fixed Budget: A Large Deviation PerspectivePo-An Wang, Ruo-Chun Tzeng, Alexandre ProutièreNeurIPS 2023 · 15 citations
- Convex Regularization in Monte-Carlo Tree SearchTuan Dam, Carlo D'Eramo, Jan Peters, Joni PajarinenICML 2021 · 12 citations
Related papers
- Fast Pure Exploration via Frank-WolfePo-An Wang, Ruo-Chun Tzeng, Alexandre ProutièreNeurIPS 2021 · 56 citations
- Robust Pure Exploration in Linear Bandits with Limited BudgetAyya Alieva, Ashok Cutkosky, Abhimanyu DasICML 2021 · 27 citations
- EUBRL: Epistemic Uncertainty Directed Bayesian Reinforcement LearningJianfei Ma, Wee Sun LeeICLR 2026 · 2 citations
- Multiplier Bootstrap-based ExplorationRunzhe Wan, Haoyu Wei, Branislav Kveton, Rui SongICML 2023 · 3 citations
- Finding All -Good Arms in Stochastic BanditsBlake Mason, Lalit K. Jain, Ardhendu Tripathy, Robert NowakNeurIPS 2020 · 9 citations
