Efficient Multi-Task Reinforcement Learning via Task-Specific Action Correction
Not on the map. Why?
Abstract (arXiv)
Multi-task reinforcement learning (MTRL) demonstrate potential for enhancing the generalization of a robot, enabling it to perform multiple tasks concurrently. However, the performance of MTRL may still be susceptible to conflicts between tasks and negative interference. To facilitate efficient MTRL, we propose Task-Specific Action Correction (TSAC), a general and complementary approach designed for simultaneous learning of multiple tasks. TSAC decomposes policy learning into two separate policies: a shared policy (SP) and an action correction policy (ACP). To alleviate conflicts resulting from excessive focus on specific tasks' details in SP, ACP incorporates goal-oriented sparse rewards, enabling an agent to adopt a long-term perspective and achieve generalization across tasks. Additional rewards transform the original problem into a multi-objective MTRL problem. Furthermore, to convert the multi-objective MTRL into a single-objective formulation, TSAC assigns a virtual expected budget to the sparse rewards and employs Lagrangian method to transform a constrained single-objective optimization into an unconstrained one. Experimental evaluations conducted on Meta-World's MT10 and MT50 benchmarks demonstrate that TSAC outperforms existing state-of-the-art methods, achieving significant improvements in both sample efficiency and effective action execution.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 27 references that are in the map. First posted on arXiv 9 Apr 2024.
Builds on
22 of 27 references.
References · 22
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2019Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learningcited by 1,168
- 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
- 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 791
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 441
- 2015Policy Distillationcited by 414
- 2017Distral: Robust Multitask Reinforcement Learningcited by 231
- 2021Efficiently Identifying Task Groupings for Multi-Task Learningcited by 218
- 2015Contextual Markov Decision Processescited by 213
- 2021Multi-Task Reinforcement Learning with Context-based Representationscited by 169
10 more
- 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 159
- 2020Multi-Task Reinforcement Learning with Soft Modularizationcited by 138
- 2020Learning to Branch for Multi-Task Learningcited by 114
- 2022Auto-Lambda: Disentangling Dynamic Task Relationshipscited by 73
- 2021Conservative Data Sharing for Multi-Task Offline Reinforcement Learningcited by 64
- 2022How to Leverage Unlabeled Data in Offline Reinforcement Learningcited by 61
- 2016Learning to Push by Grasping: Using multiple tasks for effective learningcited by 36
- 2022Towards Safe Reinforcement Learning with a Safety Editor Policycited by 28
- 2021Density Constrained Reinforcement Learningcited by 25
- 2019Attentive Multi-Task Deep Reinforcement Learningcited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Action Shaping: Policies Absorb What They Can Expresscited by 0
- 2026Action Shaping: Policies Absorb What They Can Express26 Sep 2026