mlsanityData to 7 Oct 2026

Continual Optimization with Symmetry Teleportation for Multi-Task Learning

arXiv 2503.04046 ↗First posted 6 Mar 2025cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Multi-task learning (MTL) is a widely explored paradigm that enables the simultaneous learning of multiple tasks using a single model. Despite numerous solutions, the key issues of optimization conflict and task imbalance remain under-addressed, limiting performance. Unlike existing optimization-based approaches that typically reweight task losses or gradients to mitigate conflicts or promote progress, we propose a novel approach based on Continual Optimization with Symmetry Teleportation (COST). During MTL optimization, when an optimization conflict arises, we seek an alternative loss-equivalent point on the loss landscape to reduce conflict. Specifically, we utilize a low-rank adapter (LoRA) to facilitate this practical teleportation by designing convergent, loss-invariant objectives. Additionally, we introduce a historical trajectory reuse strategy to continually leverage the benefits of advanced optimizers. Extensive experiments on multiple mainstream datasets demonstrate the effectiveness of our approach. COST is a plug-and-play solution that enhances a wide range of existing MTL methods. When integrated with state-of-the-art methods, COST achieves superior performance.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 46 references that are in the map. First posted on arXiv 6 Mar 2025.

Builds on

29 of 46 references.

References · 29

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
  3. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  4. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  5. 2015SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentationcited by 1,483
  6. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  7. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,345
  8. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  9. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
  10. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
  11. 2018End-to-End Multi-Task Learning with Attentioncited by 533
  12. 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 441
17 more
  1. 2022Multi-Task Learning as a Bargaining Gamecited by 209
  2. 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 207
  3. 2020Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropoutcited by 199
  4. 2019Attentive Single-Tasking of Multiple Taskscited by 148
  5. 2021FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learningcited by 140
  6. 2021Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learningcited by 100
  7. 2019Unified Optimal Analysis of the (Stochastic) Gradient Methodcited by 81
  8. 2023FAMO: Fast Adaptive Multitask Optimizationcited by 74
  9. 2022Do Current Multi-Task Optimization Methods in Deep Learning Even Help?cited by 60
  10. 2023Empirical Analysis of the Strengths and Weaknesses of PEFT Techniques for LLMscited by 38
  11. 2024Fair Resource Allocation in Multi-Task Learningcited by 34
  12. 2021Meta-learning with an Adaptive Task Schedulercited by 27
  13. 2022Symmetry Teleportation for Accelerated Optimizationcited by 25
  14. 2023Improving Convergence and Generalization Using Parameter Symmetriescited by 23
  15. 2024LampMark: Proactive Deepfake Detection via Training-Free Landmark Perceptual Watermarkscited by 21
  16. 2020Neural Teleportationcited by 17
  17. 2021MultiTask-CenterNet (MCN): Efficient and Diverse Multitask Learning using an Anchor Free Approachcited by 17

Built on by

Cited by year (2026 to 7 Oct)

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

3 papers.