Adaptive Weight Assignment Scheme For Multi-task Learning

Aminul Huq, Mst Tasnim Pervin
3/10/2023
cs.LG

No confident code implementation found for this paper.

Abstract

Deep learning based models are used regularly in every applications nowadays. Generally we train a single model on a single task. However, we can train multiple tasks on a single model under multi-task learning settings. This provides us many benefits like lesser training time, training a single model for multiple tasks, reducing overfitting, improving performances etc. To train a model in multi-task learning settings we need to sum the loss values from different tasks. In vanilla multi-task learning settings we assign equal weights but since not all tasks are of similar difficulty we need to allocate more weight to tasks which are more difficult. Also improper weight assignment reduces the performance of the model. We propose a simple weight assignment scheme in this paper which improves the performance of the model and puts more emphasis on difficult tasks. We tested our methods performance on both image and textual data and also compared performance against two popular weight assignment methods. Empirical results suggest that our proposed method achieves better results compared to other popular methods.

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. Any repos shown below are weak matches — 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{huq2023adaptive,
  title  = {Adaptive Weight Assignment Scheme For Multi-task Learning},
  author = {Aminul Huq and Mst Tasnim Pervin},
  year   = {2023},
  eprint = {2303.07278},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.07278v1}
}

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

Discussion