CrAM: A Compression-Aware Minimizer
Not on the map. Why?
Abstract (arXiv)
Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (~ 1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at https://github.com/IST-DASLab/CrAM .
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 43 of its 65 references that are in the map. First posted on arXiv 28 Jul 2022.
Builds on
43 of 65 references.
References · 43
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 815
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
31 more
- 2018Do Better ImageNet Models Transfer Better?cited by 565
- 2021Datasets: A Community Library for Natural Language Processingcited by 530
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 316
- 2018Slimmable Neural Networkscited by 305
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 231
- 2021Accelerating Sparse Deep Neural Networkscited by 223
- 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
- 2020The Computational Limits of Deep Learningcited by 193
- 2020BigNAS: Scaling Up Neural Architecture Search with Big Single-Stage Modelscited by 188
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
- 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2022Sharpness-Aware Training for Freecited by 95
- 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
- 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 59
- 2021How Well Do Sparse Imagenet Models Transfer?cited by 50
- 2016Stochastic Frank-Wolfe Methods for Nonconvex Optimizationcited by 41
- 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 36
- 2020Dynamic Sparsity Neural Networks for Automatic Speech Recognitioncited by 23
- 2022Compression-aware Training of Neural Networks using Frank-Wolfecited by 16
Built on by
Citing papers per year: 2023: 5; 2024: 0; 2025: 2.
7 papers.
- 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networkscited by 17
- 2023A Three-regime Model of Network Pruningcited by 15
- 2025Efficient Data Selection at Scale via Influence Distillationcited by 15
- 2023Cosine Similarity Knowledge Distillation for Individual Class Information Transfercited by 5
- 2025SAFE: Finding Sparse and Flat Minima to Improve Pruningcited by 5
- 2023CrAFT: Compression-Aware Fine-Tuning for Efficient Visual Task Adaptationcited by 0
- 2023ELSA: Partial Weight Freezing for Overhead-Free Sparse Network Deploymentcited by 0
- 2025SAFE: Finding Sparse and Flat Minima to Improve Pruning7 Jun 2025
- 2025Efficient Data Selection at Scale via Influence Distillation25 May 2025
- 2023ELSA: Partial Weight Freezing for Overhead-Free Sparse Network Deployment11 Dec 2023
- 2023Cosine Similarity Knowledge Distillation for Individual Class Information Transfer24 Nov 2023
- 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networks25 Jun 2023
- 2023A Three-regime Model of Network Pruning28 May 2023
- 2023CrAFT: Compression-Aware Fine-Tuning for Efficient Visual Task Adaptation8 May 2023
Similar, not cited
Close in wording, no citation either way
- 2022Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Models
- 2026Hybrid Compression: Integrating Pruning and Quantization for Optimized Neural Networks
- 2021Deep Neural Compression Via Concurrent Pruning and Self-Distillation
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning
- 2026Progressive Cramming: Reliable Token Compression and What It Reveals
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations
- 2026A Practical Tensor-Network Compression Pipeline for Production-Scale Large Language Models
- 2025Choose Your Model Size: Any Compression of Large Language Models Without Re-Computation