Approximate Bilevel Difference Convex Programming for Bayesian Risk Markov Decision Processes
Abstract
We consider infinite-horizon Markov Decision Processes where parameters, such as transition probabilities, are unknown and estimated from data. The popular distributionally robust approach to addressing the parameter uncertainty can sometimes be overly conservative. In this paper, we utilize the recently proposed formulation, Bayesian risk Markov Decision Process (BR-MDP), to address parameter (or epistemic) uncertainty in MDPs. To solve the infinite-horizon BR-MDP with a class of convex risk measures, we propose a computationally efficient approach called approximate bilevel difference convex programming (ABDCP). The optimization is performed offline and produces the optimal policy that is represented as a finite state controller with desirable performance guarantees. We also demonstrate the empirical performance of the BR-MDP formulation and the proposed algorithm.
BibTeX
@article{Lin_Zhou_2025, title={Approximate Bilevel Difference Convex Programming for Bayesian Risk Markov Decision Processes}, volume={39}, url={https://ojs.aaai.org/index.php/AAAI/article/view/34862}, DOI={10.1609/aaai.v39i25.34862}, abstractNote={We consider infinite-horizon Markov Decision Processes where parameters, such as transition probabilities, are unknown and estimated from data. The popular distributionally robust approach to addressing the parameter uncertainty can sometimes be overly conservative. In this paper, we utilize the recently proposed formulation, Bayesian risk Markov Decision Process (BR-MDP), to address parameter (or epistemic) uncertainty in MDPs. To solve the infinite-horizon BR-MDP with a class of convex risk measures, we propose a computationally efficient approach called approximate bilevel difference convex programming (ABDCP). The optimization is performed offline and produces the optimal policy that is represented as a finite state controller with desirable performance guarantees. We also demonstrate the empirical performance of the BR-MDP formulation and the proposed algorithm.}, number={25}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Lin, Yifan and Zhou, Enlu}, year={2025}, month={Apr.}, pages={26605-26613} }