about
Training Neural Networks with Fixed Sparse Masks (arxiv.org)
2 points by spekcular on Dec 9, 2021 | hide | past | pdf | 1 comment on HN

In plain words: Instead of updating every weight during training, this picks a fixed set of the most important weights—chosen by a standard importance score—and changes only those. It matched or beat other sparse-update tricks while using less memory and communication.

Abstract

During typical gradient-based training of deep neural networks, all of the model's parameters are updated at each iteration. Recent work has shown that it is possible to update only a small subset of the model's parameters during training, which can alleviate storage and communication requirements. In this paper, we show that it is possible to induce a fixed sparse mask on the model's parameters that selects a subset to update over many iterations. Our method constructs the mask out of the $k$ parameters with the largest Fisher information as a simple approximation as to which parameters are most important for the task at hand. In experiments on parameter-efficient transfer learning and distributed training, we show that our approach matches or exceeds the performance of other methods for training with sparse updates while being more efficient in terms of memory usage and communication costs. We release our code publicly to promote further applications of our approach.

Yi-Lin Sung, Varun Nair, Colin Raffel
arXiv:2111.09839 · cs.LG · submitted Nov 18, 2021
abstract · pdf · html

add comment on HN

A Twitter thread by one of the authors, for more context: https://twitter.com/colinraffel/status/1468618801134592012