No More Tuning: Prioritized Multi-Task Learning with Lagrangian Differential Multiplier Methods
Not on the map. Why?
Abstract (arXiv)
Given the ubiquity of multi-task in practical systems, Multi-Task Learning (MTL) has found widespread application across diverse domains. In real-world scenarios, these tasks often have different priorities. For instance, In web search, relevance is often prioritized over other metrics, such as click-through rates or user engagement. Existing frameworks pay insufficient attention to the prioritization among different tasks, which typically adjust task-specific loss function weights to differentiate task priorities. However, this approach encounters challenges as the number of tasks grows, leading to exponential increases in hyper-parameter tuning complexity. Furthermore, the simultaneous optimization of multiple objectives can negatively impact the performance of high-priority tasks due to interference from lower-priority tasks. In this paper, we introduce a novel multi-task learning framework employing Lagrangian Differential Multiplier Methods for step-wise multi-task optimization. It is designed to boost the performance of high-priority tasks without interference from other tasks. Its primary advantage lies in its ability to automatically optimize multiple objectives without requiring balancing hyper-parameters for different tasks, thereby eliminating the need for manual tuning. Additionally, we provide theoretical analysis demonstrating that our method ensures optimization guarantees, enhancing the reliability of the process. We demonstrate its effectiveness through experiments on multiple public datasets and its application in Taobao search, a large-scale industrial search ranking system, resulting in significant improvements across various business metrics.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 27 references that are in the map. First posted on arXiv 16 Dec 2024.
Builds on
17 of 27 references.
References · 17
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Gradient Surgery for Multi-Task Learningcited by 1,210
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
- 2016Cross-stitch Networks for Multi-task Learningcited by 466
- 2018Reward Constrained Policy Optimizationcited by 397
- 2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 302
- 2013OverFeat: Integrated Recognition, Localization and Detection using Convolutional Networkscited by 224
- 2016UberNet: Training a `Universal' Convolutional Neural Network for Low-, Mid-, and High-Level Vision using Diverse Datasets and Limited Memorycited by 200
- 2019Constrained Reinforcement Learning Has Zero Duality Gapcited by 144
- 2021DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learningcited by 114
- 2021RotoGrad: Gradient Homogenization in Multitask Learningcited by 82
- 2022Tenrec: A Large-scale Multipurpose Benchmark Dataset for Recommender Systemscited by 31
5 more
- 2023Multi-Task Deep Recommender Systems: A Surveycited by 29
- 2023STEM: Unleashing the Power of Embeddings for Multi-task Recommendationcited by 19
- 2022Multi-Label Learning to Rank through Multi-Objective Optimizationcited by 10
- 2024Multi-objective Learning to Rank by Model Distillationcited by 7
- 2021An Efficient Combinatorial Optimization Model Using Learning-to-Rank Distillationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.