Distributionally Robust Multi-Task Reinforcement Learning via Adaptive Task Sampling
On the map: Deep reinforcement learning methods → Deep RL algorithms and representations
Abstract (arXiv)
Multi-task reinforcement learning (MTRL) aims to train a single agent to efficiently optimize performance across multiple tasks simultaneously. However, jointly optimizing all tasks often yields imbalanced learning: agents quickly solve easy tasks but learn slowly on harder ones. While prior work primarily attributes this imbalance to conflicting task gradients and proposes gradient manipulation or specialized architectures to address it, we instead focus on a distinct and under-explored challenge: imbalanced data allocation. Standard MTRL allocates an equal number of environment interactions to each task, which over-allocates data to easy tasks that require relatively few interactions to solve and under-allocates data to hard tasks that require substantially more experience to solve. To address this challenge, we introduce Distributionally Robust Adaptive Task Sampling (DRATS), an algorithm that adaptively prioritizes sampling tasks furthest from being solved. We derive DRATS by formalizing MTRL as a feasibility problem from which we derive a minimax objective for minimizing the worst-case return gap, the difference between a desired target return and the agent's return on a task. In benchmarks like MetaWorld-MT10 and MT50, DRATS improves data efficiency and increases worst-task performance compared to existing task sampling algorithms.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 50 of its 63 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
50 of 63 references.
Closest ancestors · 2
Same direction, newest first
- 2025Meta-World+: An Improved, Standardized, RL Benchmark16 May
- 2025Multi-Task Reinforcement Learning Enables Parameter Scaling7 Mar
Other references · 48
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2019Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learningcited by 1,204
- 2017Hindsight Experience Replaycited by 1,136
- 2019Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learningcited by 782
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 399
- 2020Curriculum Learning for Reinforcement Learning Domains: A Framework and Surveycited by 373
- 2018Maximum a Posteriori Policy Optimisationcited by 328
36 more
- 2017Automatic Goal Generation for Reinforcement Learning Agentscited by 259
- 2022The Primacy Bias in Deep Reinforcement Learningcited by 247
- 2022Multi-Task Learning as a Bargaining Gamecited by 215
- 2017Teacher-Student Curriculum Learningcited by 210
- 2020Prioritized Level Replaycited by 198
- 2019Paired Open-Ended Trailblazer (POET): Endlessly Generating Increasingly Complex and Diverse Learning Environments and Their Solutionscited by 192
- 2019Skew-Fit: State-Covering Self-Supervised Reinforcement Learningcited by 174
- 2021Multi-Task Reinforcement Learning with Context-based Representationscited by 174
- 2019Distributionally Robust Language Modelingcited by 143
- 2020Multi-Task Reinforcement Learning with Soft Modularizationcited by 143
- 2021Goal-Conditioned Reinforcement Learning with Imagined Subgoalscited by 134
- 2021Rapid Exploration for Open-World Navigation with Latent Goal Modelscited by 121
- 2019Teacher algorithms for curriculum learning of Deep RL in continuously parameterized environmentscited by 119
- 2020Enhanced POET: Open-Ended Reinforcement Learning through Unbounded Invention of Learning Challenges and their Solutionscited by 106
- 2020C-Learning: Learning to Achieve Goals via Recursive Classificationcited by 103
- 2020Automatic Curriculum Learning through Value Disagreementcited by 87
- 2018CURIOUS: Intrinsically Motivated Modular Multi-Goal Reinforcement Learningcited by 79
- 2023FAMO: Fast Adaptive Multitask Optimizationcited by 78
- 2023Efficient Online Data Mixing For Language Model Pre-Trainingcited by 77
- 2013Sample Complexity of Multi-task Reinforcement Learningcited by 58
- 2019Exploration via Hindsight Goal Generationcited by 54
- 2023Multi-Task Reinforcement Learning with Mixture of Orthogonal Expertscited by 49
- 2022PaCo: Parameter-Compositional Multi-Task Reinforcement Learningcited by 46
- 2020Non-convex Min-Max Optimization: Applications, Challenges, and Recent Theoretical Advancescited by 38
- 2021Multi-task curriculum learning in a complex, visual, hard-exploration domain: Minecraftcited by 35
- 2020Why resampling outperforms reweighting for correcting sampling bias with stochastic gradientscited by 34
- 2022Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptationcited by 28
- 2024Robust Multi-Task Learning with Excess Riskscited by 24
- 2024A Single Goal is All You Need: Skills and Exploration Emerge from Contrastive RL without Rewards, Demonstrations, or Subgoalscited by 23
- 2021C-Planning: An Automatic Curriculum for Learning Goal-Reaching Taskscited by 17
- 2023Outcome-directed Reinforcement Learning by Uncertainty & Temporal Distance-Aware Curriculum Goal Generationcited by 15
- 2025Distributionally Robust Reinforcement Learning with Human Feedbackcited by 12
- 2026Group Distributionally Robust Optimization-Driven Reinforcement Learning for LLM Reasoningcited by 12
- 2025Benchmarking Massively Parallelized Multi-Task Reinforcement Learning for Robotics Taskscited by 11
- 2021Balancing Average and Worst-case Accuracy in Multitask Learningcited by 10
- 2025AutoMixAlign: Adaptive Data Mixing for Multi-Task Preference Optimization in LLMscited by 8
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Fast and Robust: Task Sampling with Posterior and Diversity Synergies for Adaptive Decision-Makers in Randomized Environments
- 2025Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning
- 2024Sample Efficient Myopic Exploration Through Multitask Reinforcement Learning with Diverse Tasks
- 2024Shared-unique Features and Task-aware Prioritized Sampling on Multi-task Reinforcement Learning
- 2026Provable Multi-Task Reinforcement Learning: A Representation Learning Framework with Low Rank Rewards
- 2026Probabilistic Performance Guarantees for Multi-Task Reinforcement Learning
- 2026Scalable Multi-Task Inverse Reinforcement Learning
- 2024The Power of Active Multi-Task Learning in Reinforcement Learning from Human Feedback