Saliency-Regularized Deep Multi-Task Learning

Guangji Bai, Liang Zhao
7/3/2022
cs.LG

No official code found. Best implementation: BaiTheBest/SRDML (12 stars, Apache-2.0, last commit 2023-09-26).

Abstract

Multitask learning is a framework that enforces multiple learning tasks to share knowledge to improve their generalization abilities. While shallow multitask learning can learn task relations, it can only handle predefined features. Modern deep multitask learning can jointly learn latent features and task sharing, but they are obscure in task relation. Also, they predefine which layers and neurons should share across tasks and cannot learn adaptively. To address these challenges, this paper proposes a new multitask learning framework that jointly learns latent features and explicit task relations by complementing the strength of existing shallow and deep multitask learning scenarios. Specifically, we propose to model the task relation as the similarity between task input gradients, with a theoretical analysis of their equivalency. In addition, we innovatively propose a multitask learning objective that explicitly learns task relations by a new regularizer. Theoretical analysis shows that the generalizability error has been reduced thanks to the proposed regularizer. Extensive experiments on several multitask learning and image classification benchmarks demonstrate the proposed method effectiveness, efficiency as well as reasonableness in the learned task relation patterns.

View on arXivView PDF

Code Implementations(1)

BaiTheBest/SRDMLCommunity100%
Apache-2.0

GitHub Repository for KDD 2022 paper "Saliency-Regularized Deep Multi-Task Learning"

121PythonAug 10, 20213 years agoApache-2.0

Similar Papers

Cite this paper

@article{bai2022saliencyregularized,
  title  = {Saliency-Regularized Deep Multi-Task Learning},
  author = {Guangji Bai and Liang Zhao},
  year   = {2022},
  eprint = {2207.01117},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.01117v1}
}

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

Discussion