Beyond Masked Sparsity: SNACK Enables Truly Sparse Neural Networks on GPU
Not on the map. Why?
Abstract (arXiv)
Deep neural networks continue to grow in parameter count, driving up training and inference cost on GPUs. Sparse neural networks and Dynamic Sparse Training (DST) promise to reduce these costs, but most implementations rely on binary masks over dense tensors and recover little of the theoretical compute, memory, or energy savings. We propose SNACK, a truly sparse GPU layer that stores and computes only non-zero connections. SNACK exposes a simple PyTorch API for restructuring connections and backpropagating gradients entirely in the sparse paradigm, and ships SNACK-COO, a custom COO-format SpMM CUDA kernel with a batch-to-Streaming-Multiprocessor mapping tuned for the small-batch, high-sparsity regime typical of large-model training and single-stream inference. At the kernel level, SNACK is up to 7x faster than the masked dense baseline (Dense+Mask) and competitive with cuSPARSE, Sputnik, and FlashSparse at 95% sparsity. At 90% sparsity, a single SNACK layer accelerates training by 8x and 3.7x, and inference by 4x and 2x, over Dense+Mask and fully dense layers, respectively, while using 72% less memory than dense and substantially less energy. End-to-end, SNACK reduces GPT-2 peak training memory by up to 40% and graph-style inference latency by 4.8x over Dense+Mask at 99% sparsity.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 43 of its 59 references that are in the map. First posted on arXiv 2 Oct 2026.
Builds on
43 of 59 references.
References · 43
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Green AIcited by 627
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
31 more
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 263
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
- 2020Sparse GPU Kernels for Deep Learningcited by 141
- 2017Deep Rewiring: Training very sparse deep networkscited by 139
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
- 2022Graph Attention Multi-Layer Perceptroncited by 83
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
- 2020Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layerscited by 68
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 61
- 2020SpArch: Efficient Architecture for Sparse Matrix Multiplicationcited by 49
- 2023Scaling Laws for Sparsely-Connected Foundation Modelscited by 43
- 2023Dynamic Sparse Training with Structured Sparsitycited by 38
- 2020Quick and Robust Feature Selection: the Strength of Energy-efficient Sparse Training for Autoencoderscited by 28
- 2023SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Modelscited by 28
- 2018Design Principles for Sparse Matrix Multiplication on the GPUcited by 19
- 2021Truly Sparse Neural Networks at Scalecited by 16
- 2024Enabling High-Sparsity Foundational Llama Models with Efficient Pretraining and Deploymentcited by 15
- 2023Flexagon: A Multi-Dataflow Sparse-Sparse Matrix Multiplication Accelerator for Efficient DNN Processingcited by 14
- 2021Sparse Training Theory for Scalable and Efficient Agentscited by 13
- 2026Sparse-RL: Breaking the Memory Wall in LLM Reinforcement Learning via Stable Sparse Rolloutscited by 9
- 2023Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiencycited by 8
- 2023Towards Memory-Efficient Training for Extremely Large Output Spaces -- Learning with 500k Labels on a Single Commodity GPUcited by 6
- 2023PopSparse: Accelerated block sparse matrix multiplication on IPUcited by 3
- 2024FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Corescited by 3
- 2025BLaST: High Performance Inference and Pretraining using BLock Sparse Transformerscited by 3
Built on by
Not cited yet.