Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weights
Arun Mallya, Dillon Davis, Svetlana Lazebnik
TL;DR
The paper introduces piggyback masks, a method to adapt a fixed pretrained backbone to multiple tasks by learning per-task binary masks that gate existing weights, incurring only about 1 bit per parameter per task. The approach enables end-to-end differentiable learning of masks without modifying backbone weights, yielding performance comparable to fine-tuned dedicated networks across diverse datasets and architectures while remaining agnostic to task order. Analyses show initialization and layer-wise sparsity patterns influence effectiveness, and task-specific batchnorm adaptation can mitigate domain-shift gaps. The method demonstrates strong results on Visual Decathlon and competitive semantic segmentation, highlighting practical value for multi-task deployment with low storage overhead.
Abstract
This work presents a method for adapting a single, fixed deep neural network to multiple tasks without affecting performance on already learned tasks. By building upon ideas from network quantization and pruning, we learn binary masks that piggyback on an existing network, or are applied to unmodified weights of that network to provide good performance on a new task. These masks are learned in an end-to-end differentiable fashion, and incur a low overhead of 1 bit per network parameter, per task. Even though the underlying network is fixed, the ability to mask individual weights allows for the learning of a large number of filters. We show performance comparable to dedicated fine-tuned networks for a variety of classification tasks, including those with large domain shifts from the initial task (ImageNet), and a variety of network architectures. Unlike prior work, we do not suffer from catastrophic forgetting or competition between tasks, and our performance is agnostic to task ordering. Code available at https://github.com/arunmallya/piggyback.
