Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning

Guangyuan Shi, Qimai Li, Wenlong Zhang, Jiaxin Chen, Xiao-Ming Wu
2/22/2023
cs.LGcs.AI

Official code: moukamisama/Recon (12 stars, last commit 2023-04-18).

Abstract

A fundamental challenge for multi-task learning is that different tasks may conflict with each other when they are solved jointly, and a cause of this phenomenon is conflicting gradients during optimization. Recent works attempt to mitigate the influence of conflicting gradients by directly altering the gradients based on some criteria. However, our empirical study shows that ``gradient surgery'' cannot effectively reduce the occurrence of conflicting gradients. In this paper, we take a different approach to reduce conflicting gradients from the root. In essence, we investigate the task gradients w.r.t. each shared network layer, select the layers with high conflict scores, and turn them to task-specific layers. Our experiments show that such a simple approach can greatly reduce the occurrence of conflicting gradients in the remaining shared layers and achieve better performance, with only a slight increase in model parameters in many cases. Our approach can be easily applied to improve various state-of-the-art methods including gradient manipulation methods and branched architecture search methods. Given a network architecture (e.g., ResNet18), it only needs to search for the conflict layers once, and the network can be modified to be used with different methods on the same or even different datasets to gain performance improvement. The source code is available at https://github.com/moukamisama/Recon.

View on arXivView PDF

Code Implementations(1)

moukamisama/ReconOfficial100%
122Shell, PythonFeb 18, 20233 years ago

Similar Papers

Cite this paper

@article{shi2023recon,
  title  = {Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning},
  author = {Guangyuan Shi and Qimai Li and Wenlong Zhang and Jiaxin Chen and Xiao-Ming Wu},
  year   = {2023},
  eprint = {2302.11289},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.11289v1},
  journal = {ICLR 2023 2023}
}

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/2302.11289.svg)](https://codeofpaper.com/paper/2302.11289)

Discussion