Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models
By Beidi Chen, Tri Dao, Kaizhao Liang, Jiaming Yang, Zhao Song, Atri Rudra, Christopher R'e. 2021
95 citations recorded by the source corpus.
Overparameterized neural networks generalize well but are expensive to train. Ideally, one would like to reduce their computational cost while retaining their generalization benefits. Sparse model training is a simple and promising approach to achieve this, but there remain challenges as existing methods struggle with accuracy loss, slow training runtime, or difficulty in sparsifying all model components. The core problem is that searching for a sparsity mask over a discrete set of sparse matrices is difficult and expensive. To address this, our main insight is to optimize over a continuous superset of sparse matrices with a fixed structure known as products of butterfly matrices. As butterfly matrices are not hardware efficient, we propose simple variants of butterfly (block and flat) to take advantage of modern hardware. Our method (Pixelated Butterfly) uses a simple fixed sparsity pattern based on flat block butterfly and low-rank matrices to sparsify most network layers (e.g., attention, MLP). We empirically validate that Pixelated Butterfly is 3x faster than butterfly and speeds up training to achieve favorable accuracy--efficiency tradeoffs. On the ImageNet classification and WikiText-103 language modeling tasks, our sparse models train up to 2.5x faster than the dense MLP-Mixer, Vision Transformer, and GPT-2 medium with no drop in accuracy.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Efficiency & Compression
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Christopher R'e
- Tri Dao
- Atri Rudra
- Stefano Ermon
- Daniel Y. Fu
- Beidi Chen
- Nimit Sharad Sohoni
- Michael Poli
In Computer Vision and Pattern Recognition
- Christopher R'e
- Tri Dao
- Atri Rudra
- Stefano Ermon
- Daniel Y. Fu
- Beidi Chen
- Nimit Sharad Sohoni
- Alexander Liu
In Efficiency & Compression
- Tri Dao
- Stefano Ermon
- Daniel Y. Fu
- Christopher R'e
- Atri Rudra
- Nimit Sharad Sohoni
- Beidi Chen
- Martin Jaggi
Citations in the corpus
- FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness (2022, methodology): “To improve their efficiency, MLP layers with sparse weight matrices can be used [16].”
- Monarch: Expressive Structured Matrices for Efficient and Accurate Training (2022, background): “Pixelated butterfly (Chen et al., 2022) has attempted to make butterfly matrices more hardware-friendly, but at the cost of reduced expressiveness.”