Distributionally Robust RL
RL: Reinforcement Learning
Overview
Distributionally robust reinforcement learning seeks policies that retain good performance when the true dynamics, rewards, or deployment tasks differ from those seen during training. Common approaches define ambiguity sets using Wasserstein distance, total variation, or divergence measures, then optimize worst-case Bellman values with robust Q-learning, actor-critic, or planning methods. Work spans tabular and function-approximation settings, average-reward control, safety, offline learning, multi-agent games, and reinforcement learning from human feedback. A central tension is that larger uncertainty sets can improve protection against distribution shift but cause excessive pessimism and higher sample costs; support mismatch can make reliable learning impossible without additional assumptions or useful side information.
Latest papers
34 papers0 papers in the last four weeks, down 100% on the four weeks before. 0.0% of all new papers.