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

CardsList

27 papers4 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.

  1. Provably Efficient Q-learning for Robust Reinforcement Learning

    Oct 26, 2026Yuchen Jiao, Gen LiRobust RLDistributionally Robust RL

  2. Reward Objectives for Robust (PO)MDPs: A Law-Preserving Equivalence with (Partially Observable) Games

    Oct 19, 2026Durgam Latha, Dion Reji, Dorde Zikelic +1Partially Observable Stochastic GamesRobust Partially Observable Markov Decision Processes

  3. Robust Counterfactuals for Markov Decision Processes under Statistical and Causal Uncertainties

    Oct 14, 2026Jessica Lally, Milad Kazemi, Nicola PaolettiCounterfactual ExplanationsMarkov Decision Processes

  4. Scalable Robust MCTS with Anytime Deterministic Optimality Guarantees

    Oct 11, 2026Tomer Massas, Vadim IndelmanRobust Markov Decision ProcessesModel-Based Planning

  5. Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes

    Oct 1, 2026Han Zhong, Yinyu YeRobust Markov Decision ProcessesMarkov Decision Processes

  6. Vector Bellman Theory for Multichain Robust Average-Reward Markov Decision Processes

    Sep 23, 2026Yue Wang, George AtiaRobust Markov Decision ProcessesMarkov Decision Processes

  7. Supermartingale Certificates for Parametric MDPs

    Sep 11, 2026Kaushik Mallik, Ðorđe ŽikelićRobust Markov Decision ProcessesMarkov Decision Processes

  8. Quantitative Analysis of ωω-Regular Robust MDPs

    Aug 26, 2026Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady +3Robust Markov Decision ProcessesSequential Decision Making

  9. Solving Robust POMDPs with Omega-regular Objectives via Partially Observable Stochastic Games

    Aug 25, 2026Durgam Latha, Dion Reji, S. Akshay +2Robust Markov Decision ProcessesPartially Observable Stochastic Games

  10. Adaptive Policy Portfolios for Robust Markov Decision Processes

    Aug 18, 2026Kasper Engelen, Sebastian Junges, Guillermo A. Pérez +1Robust Markov Decision ProcessesPolicy Learning

  11. Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions

    Aug 6, 2026Yuepeng Yang, Yuxin Chen, Yuejie ChiRobust Markov Decision ProcessesAverage-Reward RL

  12. PAC Approximation and DIRECT Optimization for Parametric Markov Models

    Aug 3, 2026Zhiming Chi, Ying Liu, Andrea Turrini +2Robust Markov Decision ProcessesMarkov Decision Processes

  13. Entropy Regularization Improves Policy Robustness in Continuous-Time Reinforcement Learning

    Jul 3, 2026Jialun Cao, Fernando Acero, David Šiška +1Robust Markov Decision ProcessesMaximum Entropy RL

  14. Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

    Jun 12, 2026Tianhao Wu, Matthew Zurek, Weina Wang +1Multi-Armed BanditsRobust Markov Decision Processes

  15. Policy Gradient for Continuous-Time Robust Markov Decision Processes

    Jun 3, 2026Tanya Veeravalli, David M. Bossens, Atsushi NitandaRobust Markov Decision ProcessesMarkov Decision Processes

  16. Robust Shielding for Safe Reinforcement Learning

    May 29, 2026Edwin Hamel-De le Court, Thom Badings, Alessandro Abate +2Robust Markov Decision ProcessesFormal Verification

  17. Robust Parameter Learning for Uncertain MDPs

    May 2, 2026Yannik Schnitzer, Alessandro Abate, David ParkerRobust Markov Decision ProcessesParameter Estimation

  18. Data-driven robust Markov decision processes on Borel spaces: performance guarantees via an axiomatic approach

    Mar 9, 2026Sivaramakrishnan RamaniRobust Markov Decision ProcessesDistributionally Robust Optimization

  19. Robust Transfer Learning with Side Information

    Mar 9, 2026Akram S. Awad, Shihab Ahmed, Yue Wang +1Reinforcement LearningRobust Markov Decision Processes

  20. Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values

    Mar 1, 2026Shengbo Wang, Nian SiRobust Markov Decision ProcessesAverage-Reward RL

  21. Resilient Strategies for Stochastic Systems: How Much Does It Take to Break a Winning Strategy?

    Feb 27, 2026Kush Grover, Markel Zubia, Debraj Chakraborty +3Robust Markov Decision Processes

  22. Learning Sequential Decisions from Multiple Sources via Group-Robust Markov Decision Processes

    Feb 2, 2026Mingyuan Xu, Zongqi Xia, Tianxi Cai +2Robust Markov Decision ProcessesOffline RL

  23. Optimization-Based Robust Permissive Synthesis for Interval MDPs

    Oct 3, 2025Khang Vo Huynh, David Parker, Lu FengRobust Markov Decision ProcessesMarkov Decision Processes

  24. Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain

    Sep 17, 2025Shengbo Wang, Nian SiRobust Markov Decision ProcessesErgodic Control

  25. Efficient Q-Learning and Actor-Critic Methods for Robust Average-Reward Reinforcement Learning

    Jun 8, 2025Yang Xu, Swetha Ganesh, Vaneet AggarwalRobust Markov Decision ProcessesReinforcement Learning

  26. Distributionally Robust Deep Q-Learning

    May 25, 2025Chung I Lu, Julian Sester, Aijia ZhangRobust Markov Decision ProcessesDeep Q-Learning