Task Weighting through Gradient Projection for Multitask Learning

Christian Bohn, Ido Freeman, Hasan Tercan, Tobias Meisen
9/3/2024
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In multitask learning, conflicts between task gradients are a frequent issue degrading a model's training performance. This is commonly addressed by using the Gradient Projection algorithm PCGrad that often leads to faster convergence and improved performance metrics. In this work, we present a method to adapt this algorithm to simultaneously also perform task prioritization. Our approach differs from traditional task weighting performed by scaling task losses in that our weighting scheme applies only in cases where tasks are in conflict, but lets the training proceed unhindered otherwise. We replace task weighting factors by a probability distribution that determines which task gradients get projected in conflict cases. Our experiments on the nuScenes, CIFAR-100, and CelebA datasets confirm that our approach is a practical method for task weighting. Paired with multiple different task weighting schemes, we observe a significant improvement in the performance metrics of most tasks compared to Gradient Projection with uniform projection probabilities.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bohn2024task,
  title  = {Task Weighting through Gradient Projection for Multitask Learning},
  author = {Christian Bohn and Ido Freeman and Hasan Tercan and Tobias Meisen},
  year   = {2024},
  eprint = {2409.01793},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.01793v1}
}

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

Discussion