Robust Markov Decision Processes
Overview
Robust Markov decision processes study how to plan and learn when transition dynamics—or sometimes rewards—are uncertain, often choosing actions to maximize performance against the worst plausible model. Methods define uncertainty sets using intervals, polytopes, total variation, or Wasserstein distance, then solve robust Bellman equations with dynamic programming, linear programming, or policy iteration. Learning approaches include robust Q-learning, actor-critic and policy-gradient methods, plus plug-in and PAC methods that estimate dynamics while providing safety or performance guarantees. A central tension is that worst-case protection can make policies overly conservative, while coupled uncertainty, average-reward transients, and complex objectives can make efficient planning and reliable guarantees difficult.
Latest papers
27 papers4 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.