LDC-MTL: Balancing Multi-Task Learning through Scalable Loss Discrepancy Control

Peiyao Xiao, Chaosheng Dong, Shaofeng Zou, Kaiyi Ji
2/12/2025
cs.LG

No official code found. Best implementation: OptMN-Lab/LDC-MTL (14 stars, MIT, last commit 2025-05-15).

Abstract

Multi-task learning (MTL) has been widely adopted for its ability to simultaneously learn multiple tasks. While existing gradient manipulation methods often yield more balanced solutions than simple scalarization-based approaches, they typically incur a significant computational overhead of $\mathcal{O}(K)$ in both time and memory, where $K$ is the number of tasks. In this paper, we propose LDC-MTL, a simple and scalable loss discrepancy control approach for MTL, formulated from a bilevel optimization perspective. Our method incorporates two key components: (i) a bilevel formulation for fine-grained loss discrepancy control, and (ii) a scalable first-order bilevel algorithm that requires only $\mathcal{O}(1)$ time and memory. Theoretically, we prove that LDC-MTL guarantees convergence not only to a stationary point of the bilevel problem with loss discrepancy control but also to an $ε$-accurate Pareto stationary point for all $K$ loss functions under mild conditions. Extensive experiments on diverse multi-task datasets demonstrate the superior performance of LDC-MTL in both accuracy and efficiency.

View on arXivView PDF

Code Implementations(1)

OptMN-Lab/LDC-MTLCommunity100%
MIT

Official implementation of Scalable Bilevel Loss Balancing for Multi-Task Learning.

141Shell, PythonFeb 11, 20251 years agoMIT

Similar Papers

Cite this paper

@article{xiao2025ldcmtl,
  title  = {LDC-MTL: Balancing Multi-Task Learning through Scalable Loss Discrepancy Control},
  author = {Peiyao Xiao and Chaosheng Dong and Shaofeng Zou and Kaiyi Ji},
  year   = {2025},
  eprint = {2502.08585},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.08585v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.08585.svg)](https://codeofpaper.com/paper/2502.08585)

Discussion