StijnVerdenius / SNIP-itLinks
This repository is the official implementation of the paper Pruning via Iterative Ranking of Sensitivity Statistics and implements novel pruning / compression algorithms for deep learning / neural networks. Amongst others it implements structured pruning before training, its actual parameter shrinking and unstructured before/during training.
☆32Updated 2 years ago
Alternatives and similar repositories for SNIP-it
Users that are interested in SNIP-it are comparing it to the libraries listed below
Sorting:
- Lookahead: A Far-sighted Alternative of Magnitude-based Pruning (ICLR 2020)☆33Updated 4 years ago
- Code for "Picking Winning Tickets Before Training by Preserving Gradient Flow" https://openreview.net/pdf?id=SkgsACVKPH☆106Updated 5 years ago
- ☆227Updated last year
- ☆193Updated 4 years ago
- SNIP: SINGLE-SHOT NETWORK PRUNING BASED ON CONNECTION SENSITIVITY☆115Updated 6 years ago
- Soft Threshold Weight Reparameterization for Learnable Sparsity☆91Updated 2 years ago
- ☆14Updated 4 years ago
- A Signal Propagation Perspective for Pruning Neural Networks at Initialization☆15Updated 5 years ago
- Codebase for the paper "A Gradient Flow Framework for Analyzing Network Pruning"☆21Updated 4 years ago
- Lightweight torch implementation of rigl, a sparse-to-sparse optimizer.☆57Updated 3 years ago
- Pytorch implementation of the paper "SNIP: Single-shot Network Pruning based on Connection Sensitivity" by Lee et al.☆110Updated 6 years ago
- Train ImageNet *fast* in 500 lines of code with FFCV☆147Updated last year
- PyTorch implementation of shake-drop regularization☆55Updated 5 years ago
- A PyTorch converter for SimCLR checkpoints☆108Updated 4 years ago
- A research library for pytorch-based neural network pruning, compression, and more.☆162Updated 2 years ago
- Differentiable Data Augmentation Library☆123Updated 3 years ago
- Estimate/count FLOPS for a given neural network using pytorch☆306Updated 3 years ago
- This repository contains a Pytorch implementation of the paper "The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks"…☆333Updated last year
- This repository contains code to replicate the experiments given in NeurIPS 2019 paper "One ticket to win them all: generalizing lottery …☆51Updated last year
- Code accompanying the NeurIPS 2020 paper: WoodFisher (Singh & Alistarh, 2020)☆53Updated 4 years ago
- Mode Connectivity and Fast Geometric Ensembles in PyTorch☆276Updated 2 years ago
- PyTorch implementation of "Bootstrap Your Own Latent: A New Approach to Self-Supervised Learning" with DDP and Apex AMP☆82Updated 5 years ago
- ☆13Updated 4 years ago
- ☆70Updated 5 years ago
- [NeurIPS'20] GradAug: A New Regularization Method for Deep Neural Networks☆94Updated 4 years ago
- Is the attention layer even necessary? (https://arxiv.org/abs/2105.02723)☆486Updated 4 years ago
- Code for paper "Orthogonal Convolutional Neural Networks".☆119Updated 4 years ago
- [NeurIPS'2019] Shupeng Gui, Haotao Wang, Haichuan Yang, Chen Yu, Zhangyang Wang, Ji Liu, “Model Compression with Adversarial Robustness: …☆50Updated 3 years ago
- Code for Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot☆42Updated 4 years ago
- DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures☆33Updated 5 years ago