Online MDP With Transition Prototypes: A Robust Adaptive Approach

Abstract

In this work, we consider an online robust Markov Decision Process (MDP) where we have the information of finitely many prototypes of the underlying transition kernel. We consider an adaptively updated ambiguity set of the prototypes and propose an algorithm that efficiently identifies the true underlying transition kernel while guaranteeing the performance of the corresponding robust policy. To be more specific, we provide a sublinear regret of the subsequent optimal robust policy. We also provide an early stopping mechanism and a worst-case performance bound of the value function. In numerical experiments, we demonstrate that our method outperforms existing approaches, particularly in the early stage with limited data. This work contributes to robust MDPs by considering possible prior information about the underlying transition probability and online learning, offering both theoretical insights and practical algorithms for improved decision-making under uncertainty.

Stats

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

Related papers

• Robust Anytime Learning Of Markov Decision Processes (2022)0.00
• Bring Your Own (non-robust) Algorithm To Solve Robust Mdps By Estimating The Worst Kernel (2023)0.00
• Dynamic Regret Of Online Markov Decision Processes (2022)0.00
• Robust Batch Policy Learning In Markov Decision Processes (2020)0.00
• Policy Gradient For Robust Markov Decision Processes (2024)0.00
• Solving Robust Mdps Through No-regret Dynamics (2023)0.00
• Policy Learning For Robust Markov Decision Process With A Mismatched Generative Model (2022)0.00
• Online Reinforcement Learning In Markov Decision Process Using Linear Programming (2023)3.58