kappa-Explorer: A Unified Framework for Active Model Estimation in MDPs
Not on the map. Why?
Abstract (arXiv)
In tabular Markov decision processes (MDPs) with perfect state observability, each trajectory provides active samples from the transition distributions conditioned on state-action pairs. Consequently, accurate model estimation depends on how the exploration policy allocates visitation frequencies in accordance with the intrinsic complexity of each transition distribution. Building on recent work on coverage-based exploration, we introduce a parameterized family of decomposable and concave objective functions U_kappa that explicitly incorporate both intrinsic estimation complexity and extrinsic visitation frequency. Moreover, the curvature kappa provides a unified treatment of various global objectives, such as the average-case and worst-case estimation error objectives. Using the closed-form characterization of the gradient of U_kappa, we propose kappa-Explorer, an active exploration algorithm that performs Frank-Wolfe-style optimization over state-action occupancy measures. The diminishing-returns structure of U_kappa naturally prioritizes underexplored and high-variance transitions, while preserving smoothness properties that enable efficient optimization. We establish tight regret guarantees for kappa-Explorer and further introduce a fully online and computationally efficient surrogate algorithm for practical use. Experiments on benchmark MDPs demonstrate that kappa-Explorer provides superior performance compared to existing exploration strategies.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 38 references that are in the map. First posted on arXiv 23 Feb 2026.
Builds on
20 of 38 references.
References · 20
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
- 2018Provably Efficient Maximum Entropy Explorationcited by 240
- 2019Efficient Exploration via State Marginal Matchingcited by 186
- 2021Reinforcement Learning with Prototypical Representationscited by 179
- 2020Reward-Free Exploration for Reinforcement Learningcited by 177
- 2018On Learning Intrinsic Rewards for Policy Gradient Methodscited by 100
- 2021Online Robust Reinforcement Learning with Model Uncertaintycited by 95
- 2020Fast active learning for pure exploration in reinforcement learningcited by 92
- 2020Adaptive Reward-Free Explorationcited by 77
- 2022Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Designcited by 33
8 more
- 2023The In-Sample Softmax for Offline Reinforcement Learningcited by 33
- 2023Fast Rates for Maximum Entropy Explorationcited by 32
- 2019Active Exploration in Markov Decision Processescited by 27
- 2021Adaptive Sampling for Minimax Fair Classificationcited by 24
- 2020Active Model Estimation in Markov Decision Processescited by 20
- 2024Global Reinforcement Learning: Beyond Linear and Convex Rewards via Submodular Semi-gradient Methodscited by 15
- 2023Active Coverage for PAC Reinforcement Learningcited by 8
- 2026From Relative Entropy to Minimax: A Unified Framework for Coverage in MDPscited by 1
Built on by
Not cited yet.