BLaST: High Performance Inference and Pretraining using BLock Sparse Transformers
The energy consumption of large-scale ML models is dominated by data movement, shuffling billions of parameters across memory hierarchies and data centers. Sparsification offers a principled way to mitigate these costs by pruning redundant weights and activations, thereby reducing data movement. Effective sparsification to prune redundant parameters is still challenging: existing methods incur significant accuracy degradation, performance overhead, or both. We introduce (Bl)ock (a)nd (S)parse (T)ransformers (BLaST), a general, robust, and reliable method for sparsification, applicable to linear layers in all settings. Our method iteratively sparsifies weight matrices into a block sparsity pattern suitable for efficient sparse matrix-matrix (SpMM) multiplication. BLaST achieves up to 95% sparsity in MLP weights with negligible accuracy loss (majority <2.25%). We show a 2.2x inference speedup for Llama 3.2 with 16 GPUs, and up to 4.45x reduction in inference memory footprint resulting in a 2.9x reduction in GPU setup and operating costs.
Authors
- Patrik Okanovic
- Grzegorz Kwaśniewski (ORCID: https://orcid.org/0000-0001-8943-1381)
- Sameer Deshmukh (ORCID: https://orcid.org/0000-0002-5615-1399)
- Yusuke Nagasaka (ORCID: https://orcid.org/0009-0009-2204-2424)
- Takumi Honda (ORCID: https://orcid.org/0000-0002-1572-4533)
- Haruto Fujii
- Kentaro Katayama
- Maciej Besta
- Yi Zhu
- Torsten Hoefler
Publication Details
- Journal
- Repository for Publications and Research Data (ETH Zurich)
- Published
- 2025-10-26
- DOI
- https://doi.org/10.3929/ethz-c-000792572
- Primary Topic
- Parallel Computing and Optimization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00