Skip to content

SIMS: Scale-Invariant Merit-Function-Based Scalarization for Multi-Task Learning

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 520-531 · 0 citations · 56 references
Computer Science Mathematics

TL;DR

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, and proves that the requirement for scale invariance uniquely determines this transformation to be logarithmic.

Abstract

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.

Read PDF

Similar papers

Preprint Aug 2026

MOON: Multi-Objective OrthoNormalized Updates for Multitask Learning

This paper proposes MOON (Multi-Objective OrthoNormalized Updates), which performs gradient manipulation under spectral--nuclear norm geometry and uses the orthonormalized manipulated gradient for parameter updates and empirical results show that MOON consistently improves both optimization efficiency and final multi-t...

Shiji Zhou, Kunlin Lyu, Lei Zhang et al. · 0 citations
Book Open access Aug 2026

Structured Task Alignment for Multi-Objective Learning to Rank

Industrial recommender systems typically integrate multiple objectives—such as clicks, watch time, likes, and follows—to perform a holistic ranking. However, effectively fusing these diverse tasks to reflect overall user satisfaction remains a formidable challenge. Existing approaches struggle with distributional discr...

Qing Luo, Ge Chen, Huayi Shen et al. · 0 citations
Aug 2026

Continual Low-Rank Adaptation Via Cumulative Unified Optimization.

This work reformulates LoRA-based CL as a consistent feature mapping problem that mimics the behavior of the joint-training upper bound, wherein a unified adaptation parameter matrix is learned to simultaneously capture the input-output relationships established by all task-specific LoRAs.

Yue Lu, Shizhou Zhang, De Cheng et al. · 0 citations
#artificial intelligence Preprint Sep 2026

A Better Spur Should Start From Each Objective

This work proposes Multi-Marginal Preference Optimization (MMPO), a fine-grained framework that intervenes at the data, gradient, and constraint levels rather than relying on coarse-grained global scalarization to address optimization conflicts among multiple objectives in real-world deployment scenarios.

Shang-Wen Mao, Hao Zhang, Guangtao Nie et al. · 1 citation · ⚡1
#machine learning Preprint Sep 2026

Simple Extensions of Single-Objective Acquisition Functions and Hedge Strategies for Multi-Objective Bayesian Optimization

Multi-objective Bayesian optimization (MOBO) is commonly approached through specialized acquisition functions or scalarization schemes designed to explicitly account for trade-offs among non-preferential objectives. In this work, we show that such complexity might be unnecessary. We propose a framework that extends sta...

H. Sheikh · 0 citations
#artificial intelligence Preprint Sep 2026

In-Context Guidance: Learning Inter-Task Synergies via Numerical Foundational Models for Few-Shot Multitask Optimization

Multi-task optimization (MTO) addresses a set of optimization tasks simultaneously, often suffering from inaccurate inter-task relationship estimation under limited evaluation budgets, leading to negative transfer. This paper introduces In-Context Guidance Multitask Optimization (ICG-MTO), a novel framework that levera...

Tingyang Wei, Hao-Feng Wu, Jiao Liu et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.