The reviewed record of science sign in
Pith

arxiv: 2007.12540 · v1 · pith:OXXU7YJ4 · submitted 2020-07-24 · cs.CV · cs.LG

Reparameterizing Convolutions for Incremental Multi-Task Learning without Task Interference

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:OXXU7YJ4record.jsonopen to challenge →

classification cs.CV cs.LG
keywords multi-taskincrementallearningtaskswithoutbankconvolutionsfilter
0
0 comments X
read the original abstract

Multi-task networks are commonly utilized to alleviate the need for a large number of highly specialized single-task networks. However, two common challenges in developing multi-task models are often overlooked in literature. First, enabling the model to be inherently incremental, continuously incorporating information from new tasks without forgetting the previously learned ones (incremental learning). Second, eliminating adverse interactions amongst tasks, which has been shown to significantly degrade the single-task performance in a multi-task setup (task interference). In this paper, we show that both can be achieved simply by reparameterizing the convolutions of standard neural network architectures into a non-trainable shared part (filter bank) and task-specific parts (modulators), where each modulator has a fraction of the filter bank parameters. Thus, our reparameterization enables the model to learn new tasks without adversely affecting the performance of existing ones. The results of our ablation study attest the efficacy of the proposed reparameterization. Moreover, our method achieves state-of-the-art on two challenging multi-task learning benchmarks, PASCAL-Context and NYUD, and also demonstrates superior incremental learning capability as compared to its close competitors.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.