mlsanityData to 7 Oct 2026

Robust Reinforcement Learning with Wasserstein Constraint

arXiv 2006.00945 ↗First posted 1 Jun 2020cs.LG stat.MLcited by 18

Not on the map. Why?

Abstract (arXiv)

Robust Reinforcement Learning aims to find the optimal policy with some extent of robustness to environmental dynamics. Existing learning algorithms usually enable the robustness through disturbing the current state or simulating environmental parameters in a heuristic way, which lack quantified robustness to the system dynamics (i.e. transition probability). To overcome this issue, we leverage Wasserstein distance to measure the disturbance to the reference transition kernel. With Wasserstein distance, we are able to connect transition kernel disturbance to the state disturbance, i.e. reduce an infinite-dimensional optimization problem to a finite-dimensional risk-aware problem. Through the derived risk-aware optimal Bellman equation, we show the existence of optimal robust policies, provide a sensitivity analysis for the perturbations, and then design a novel robust learning algorithm--Wasserstein Robust Advantage Actor-Critic algorithm (WRAAC). The effectiveness of the proposed algorithm is verified in the Cart-Pole environment.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 4; 2023: 4; 2024: 1; 2025: 5; 2026: 1.

18 papers.

Sort:

By area:

  1. 2021Online Robust Reinforcement Learning with Model Uncertaintycited by 95
  2. 2022Policy Gradient Method For Robust Reinforcement Learningcited by 67
  3. 2023Robust Average-Reward Markov Decision Processescited by 22
  4. 2021Learning Robust Policy against Disturbance in Transition Dynamics via State-Conservative Policy Optimizationcited by 18
  5. 2022Distributionally Robust Bayesian Optimization with varphi-divergencescited by 16
  6. 2022Robust Constrained Reinforcement Learningcited by 14
  7. 2023Optimal Transport Perturbations for Safe Reinforcement Learning with Robustness Guaranteescited by 9
  8. 2023MICRO: Model-Based Offline Reinforcement Learning with a Conservative Bellman Operatorcited by 9
  9. 2025ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learningcited by 5
  10. 2025Wasserstein Adaptive Value Estimation for Actor-Critic Reinforcement Learningcited by 4
  11. 2025Rectified Robust Policy Optimization for Model-Uncertain Constrained Reinforcement Learning without Strong Dualitycited by 4
  12. 2022Review of Metrics to Measure the Stability, Robustness and Resilience of Reinforcement Learningcited by 2
6 more
  1. 2025Distributionally Robust Multi-Agent Reinforcement Learning for Dynamic Chute Mappingcited by 2
  2. 2021Learning to Play General-Sum Games Against Multiple Boundedly Rational Agentscited by 1
  3. 2024How does Your RL Agent Explore? An Optimal Transport Analysis of Occupancy Measure Trajectoriescited by 1
  4. 2025Online Robust Reinforcement Learning with General Function Approximationcited by 1
  5. 2023On Practical Robust Reinforcement Learning: Practical Uncertainty Set and Double-Agent Algorithmcited by 0
  6. 2026Counterfactually Safe Reinforcement Learningcited by 0