mlsanityData to 14 Oct 2026

Improvable Gap Balancing for Multi-Task Learning

arXiv 2307.15429 ↗First posted 28 Jul 2023cs.LG cs.AI cs.CVcited by 9

Not on the map. Why?

Abstract (arXiv)

In multi-task learning (MTL), gradient balancing has recently attracted more research interest than loss balancing since it often leads to better performance. However, loss balancing is much more efficient than gradient balancing, and thus it is still worth further exploration in MTL. Note that prior studies typically ignore that there exist varying improvable gaps across multiple tasks, where the improvable gap per task is defined as the distance between the current training progress and desired final training progress. Therefore, after loss balancing, the performance imbalance still arises in many cases. In this paper, following the loss balancing framework, we propose two novel improvable gap balancing (IGB) algorithms for MTL: one takes a simple heuristic, and the other (for the first time) deploys deep reinforcement learning for MTL. Particularly, instead of directly balancing the losses in MTL, both algorithms choose to dynamically assign task weights for improvable gap balancing. Moreover, we combine IGB and gradient balancing to show the complementarity between the two types of algorithms. Extensive experiments on two benchmark datasets demonstrate that our IGB algorithms lead to the best results in MTL via loss balancing and achieve further improvements when combined with gradient balancing. Code is available at https://github.com/YanqiDai/IGB4MTL.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 27 of its 50 references that are in the map. First posted on arXiv 28 Jul 2023.

Builds on

27 of 50 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  3. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  4. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  5. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
  6. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  7. 2015SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentationcited by 1,487
  8. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  9. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  10. 2017A Survey on Multi-Task Learningcited by 840
  11. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
  12. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
15 more
  1. 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 803
  2. 2020Directional Message Passing for Molecular Graphscited by 561
  3. 2018End-to-End Multi-Task Learning with Attentioncited by 534
  4. 2017A Brief Survey of Deep Reinforcement Learningcited by 483
  5. 2016Cross-stitch Networks for Multi-task Learningcited by 467
  6. 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
  7. 2019Provably Powerful Graph Networkscited by 389
  8. 2015Order Matters: Sequence to sequence for setscited by 237
  9. 2022Multi-Task Learning as a Bargaining Gamecited by 215
  10. 2020Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropoutcited by 201
  11. 2020Multi-Task Reinforcement Learning with Soft Modularizationcited by 143
  12. 2021Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learningcited by 101
  13. 2022Auto-Lambda: Disentangling Dynamic Task Relationshipscited by 73
  14. 2022In Defense of the Unitary Scalarization for Deep Multi-Task Learningcited by 67
  15. 2021Multi-Objective Meta Learningcited by 39

Built on by

Cited by year (2026 to 14 Oct)

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

9 papers.