SIMS: Scale-Invariant Merit-Function-Based Scalarization for Multi-Task Learning
Not on the map. Why?
Abstract (arXiv)
Multi-task learning (MTL) requires navigating unavoidable trade-offs among competing objectives. This paradigm is frequently formulated as multi-objective optimization (MOO), where the scalarization is favored to reduce an MOO problem to a single objective. We empirically find that existing merit-function-based scalarization approaches are sensitive to the relative scales of different objectives in practical MTL, where task losses commonly differ by orders of magnitude. The optimization process often favors objectives with larger scales even though the underlying Pareto optimal solutions remains invariant to rescaling (i.e., multiplying an objective by a positive constant). To address this issue, we propose Scale-Invariant Merit-function-based Scalarization (SIMS) for MTL. Specifically, SIMS adopts a transformation-induced merit function to convert the MOO problem of MTL to a single objective that renders optimization invariant to the magnitudes of losses. Theoretically, we prove that the requirement for scale invariance uniquely determines this transformation to be logarithmic. We further show that this general transformation-induced merit function preserves weak Pareto optimality and admits a smooth surrogate with controllable approximation error. Extensive experiments on representative multi-task benchmarks demonstrate that SIMS consistently outperforms existing scalarization methods and achieves state-of-the-art performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 56 references that are in the map. First posted on arXiv 11 Sep 2026.
Builds on
26 of 56 references.
References · 26
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2017Mask R-CNNcited by 7,277
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
- 2021Convex optimizationcited by 2,515
- 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2017A Survey on Multi-Task Learningcited by 840
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
- 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
- 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 803
- 2018End-to-End Multi-Task Learning with Attentioncited by 534
14 more
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 270
- 2022Multi-Task Learning as a Bargaining Gamecited by 215
- 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 173
- 2019Attentive Single-Tasking of Multiple Taskscited by 148
- 2018NDDR-CNN: Layerwise Feature Fusing in Multi-Task CNNs by Neural Discriminative Dimensionality Reductioncited by 127
- 2020A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problemscited by 57
- 2022Polyhistor: Parameter-Efficient Multi-Task Adaptation for Dense Vision Taskscited by 52
- 2019MultiNet++: Multi-Stream Feature Aggregation and Geometric Loss Strategy for Multi-Task Learningcited by 45
- 2023Vision Transformer Adapters for Generalizable Multitask Learningcited by 14
- 2016Using Well-Understood Single-Objective Functions in Multiobjective Black-Box Optimization Test Suitescited by 10
- 2022Mitigating Negative Transfer in Multi-Task Learning with Exponential Moving Average Loss Weighting Strategiescited by 10
- 2022Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimizationcited by 7
- 2025Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidancecited by 4
Built on by
Not cited yet.