mlsanityData to 14 Oct 2026

Revisit the Imbalance Optimization in Multi-task Learning: An Experimental Analysis

arXiv 2509.23915 ↗First posted 28 Sep 2025cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Multi-task learning (MTL) aims to build general-purpose vision systems by training a single network to perform multiple tasks jointly. While promising, its potential is often hindered by "unbalanced optimization", where task interference leads to subpar performance compared to single-task models. To facilitate research in MTL, this paper presents a systematic experimental analysis to dissect the factors contributing to this persistent problem. Our investigation confirms that the performance of existing optimization methods varies inconsistently across datasets, and advanced architectures still rely on costly grid-searched loss weights. Furthermore, we show that while powerful Vision Foundation Models (VFMs) provide strong initialization, they do not inherently resolve the optimization imbalance, and merely increasing data quantity offers limited benefits. A crucial finding emerges from our analysis: a strong correlation exists between the optimization imbalance and the norm of task-specific gradients. We demonstrate that this insight is directly applicable, showing that a straightforward strategy of scaling task losses according to their gradient norms can achieve performance comparable to that of an extensive and computationally expensive grid search. Our comprehensive analysis suggests that understanding and controlling gradient dynamics is a more direct path to stable MTL than developing increasingly complex methods.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 65 of its 77 references that are in the map. First posted on arXiv 28 Sep 2025.

Builds on

65 of 77 references.

References · 65

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2023Segment Anythingcited by 8,234
  5. 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
  6. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
  7. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  8. 2019Deep High-Resolution Representation Learning for Human Pose Estimationcited by 1,339
  9. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  10. 2020Meta-Learning in Neural Networks: A Surveycited by 950
  11. 2019The Replica Dataset: A Digital Replica of Indoor Spacescited by 904
  12. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
38 more
  1. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
  2. 2018Taskonomy: Disentangling Task Transfer Learningcited by 634
  3. 2018End-to-End Multi-Task Learning with Attentioncited by 534
  4. 2016Cross-stitch Networks for Multi-task Learningcited by 467
  5. 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
  6. 2019Which Tasks Should Be Learned Together in Multi-task Learning?cited by 375
  7. 2020Curriculum Learning for Reinforcement Learning Domains: A Framework and Surveycited by 373
  8. 2021Omnidata: A Scalable Pipeline for Making Multi-Task Mid-Level Vision Datasets from 3D Scanscited by 336
  9. 2021Combinatorial optimization and reasoning with graph neural networkscited by 268
  10. 2018PAD-Net: Multi-Tasks Guided Prediction-and-Distillation Network for Simultaneous Depth Estimation and Scene Parsingcited by 224
  11. 2021Efficiently Identifying Task Groupings for Multi-Task Learningcited by 222
  12. 2022Multi-Task Learning as a Bargaining Gamecited by 215
  13. 2020Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropoutcited by 201
  14. 2016UberNet: Training a `Universal' Convolutional Neural Network for Low-, Mid-, and High-Level Vision using Diverse Datasets and Limited Memorycited by 200
  15. 2023AM-RADIO: Agglomerative Vision Foundation Model -- Reduce All Domains Into Onecited by 169
  16. 2018Efficient parametrization of multi-domain deep neural networkscited by 168
  17. 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 160
  18. 2020MTI-Net: Multi-Scale Task Interaction Networks for Multi-Task Learningcited by 157
  19. 2019Attentive Single-Tasking of Multiple Taskscited by 148
  20. 2019Pattern-Affinitive Propagation across Depth, Surface Normal and Semantic Segmentationcited by 142
  21. 20234M: Massively Multimodal Masked Modelingcited by 120
  22. 2020Learning to Branch for Multi-Task Learningcited by 115
  23. 2017Incremental Learning Through Deep Adaptationcited by 108
  24. 2020Robust Learning Through Cross-Task Consistencycited by 105
  25. 2021Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learningcited by 101
  26. 2022M3ViT: Mixture-of-Experts Vision Transformer for Efficient Multi-task Learning with Model-Accelerator Co-designcited by 98
  27. 2022InvPT: Inverted Pyramid Multi-task Transformer for Dense Scene Understandingcited by 89
  28. 2019BAM! Born-Again Multi-Task Networks for Natural Language Understandingcited by 85
  29. 2021RotoGrad: Gradient Homogenization in Multitask Learningcited by 83
  30. 2023FAMO: Fast Adaptive Multitask Optimizationcited by 78
  31. 2019Branched Multi-Task Networks: Deciding What Layers To Sharecited by 76
  32. 2022Auto-Lambda: Disentangling Dynamic Task Relationshipscited by 73
  33. 2021Exploring Relational Context for Multi-Task Dense Predictioncited by 71
  34. 2022In Defense of the Unitary Scalarization for Deep Multi-Task Learningcited by 67
  35. 2022Do Current Multi-Task Optimization Methods in Deep Learning Even Help?cited by 60
  36. 2024Multi-Task Dense Prediction via Mixture of Low-Rank Expertscited by 58
  37. 2020Automated Search for Resource-Efficient Branched Multi-Task Networkscited by 51
  38. 2019Many Task Learning with Task Routingcited by 50

50 most cited of 65 All 65 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.