paper-with-me

홈 › Papers

Robust Parameter Learning for Uncertain MDPs

2026-05-02 · Yannik Schnitzer, Alessandro Abate, David Parker arxiv

Learning-based approaches to verifying unknown Markov decision processes (MDPs) often employ uncertain MDPs. These models use, for example, confidence intervals to capture transition uncertainty and allow synthesis of policies that are robust to this uncertainty. However, this approach typically quantifies uncertainty independently for individual transition probabilities, ignoring dependencies due to shared latent quantities. We propose to learn such models using parametric MDPs (pMDPs), where transition probabilities are expressions over a set of parameters. We project statistical uncertainty from empirical transition frequencies onto the pMDP's parameter space, yielding a probably approximately correct (PAC) uncertainty model for the underlying MDP that respects the algebraic dependencies between transitions. The resulting models are algorithmically challenging to solve, so we propose a hierarchy of sound polytopic outer approximations of the induced confidence set. We implement and evaluate our approach, demonstrating substantially tighter uncertainty estimates than classical interval-based uncertain MDP learning techniques.

📄 PDF Abstract BibTeX arXiv:2605.01339

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Minimax Regret Optimisation for Robust Planning in Uncertain Markov Decision Processes

2020-12-08 · Marc Rigter, Bruno Lacerda, Nick Hawes

The parameters for a Markov Decision Process (MDP) often cannot be specified exactly. Uncertain MDPs (UMDPs) capture this model ambiguity by defining sets which the parameters belong to. Minimax regret has been proposed …

Multi-Objective Approaches to Markov Decision Processes with Uncertain Transition Parameters

2017-10-20 · Dimitri Scheftelowitsch, Peter Buchholz, Vahid Hashemi, Holger Hermanns

Markov decision processes (MDPs) are a popular model for performance analysis and optimization of stochastic systems. The parameters of stochastic behavior of MDPs are estimates from empirical observations of a system; t…

Decision Making

Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterization

2026-02-11 · Anirudh Satheesh, Ziyi Chen, Furong Huang, Heng Huang arxiv

We study robust Markov decision processes (RMDPs) with general policy parameterization under s-rectangular and non-rectangular uncertainty sets. Prior work is largely limited to tabular policies, and hence either lacks s…

Scaling Up Robust MDPs by Reinforcement Learning

2013-06-26 · Aviv Tamar, Huan Xu, Shie Mannor

We consider large-scale Markov decision processes (MDPs) with parameter uncertainty, under the robust MDP paradigm. Previous studies showed that robust MDPs, based on a minimax approach to handle uncertainty, can be solv…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Scalable First-Order Methods for Robust MDPs

2020-05-11 · Julien Grand-Clément, Christian Kroer

Robust Markov Decision Processes (MDPs) are a powerful framework for modeling sequential decision-making problems with model uncertainty. This paper proposes the first first-order framework for solving robust MDPs. Our a…

Decision MakingSequential Decision Making