Bayes-cpace: PAC Optimal Exploration In Continuous Space Bayes-adaptive Markov Decision Processes

Abstract

We present the first PAC optimal algorithm for Bayes-Adaptive Markov Decision Processes (BAMDPs) in continuous state and action spaces, to the best of our knowledge. The BAMDP framework elegantly addresses model uncertainty by incorporating Bayesian belief updates into long-term expected return. However, computing an exact optimal Bayesian policy is intractable. Our key insight is to compute a near-optimal value function by covering the continuous state-belief-action space with a finite set of representative samples and exploiting the Lipschitz continuity of the value function. We prove the near-optimality of our algorithm and analyze a number of schemes that boost the algorithm's efficiency. Finally, we empirically validate our approach on a number of discrete and continuous BAMDPs and show that the learned policy has consistently competitive performance against baseline approaches.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keylee2018bayes

Related papers

• Bayesian Policy Optimization For Model Uncertainty (2018)0.00
• Sequential Monte Carlo For Policy Optimization In Continuous Pomdps (2025)0.00
• Sparse Tree Search Optimality Guarantees In Pomdps With Continuous Observation Spaces (2019)5.84
• Bayesian Learning Of Optimal Policies In Markov Decision Processes With Countably Infinite State-space (2023)0.00
• Bayesian Learning Of The Optimal Action-value Function In A Markov Decision Process (2025)0.00
• Deep Exploration With Pac-bayes (2024)0.00
• Active Exploration In Markov Decision Processes (2019)0.00
• Pomdps In Continuous Time And Discrete Spaces (2020)0.00