IST-DASLab / M-FAC
Efficient reference implementations of the static & dynamic M-FAC algorithms (for pruning and optimization)
☆16Updated 3 years ago
Alternatives and similar repositories for M-FAC:
Users that are interested in M-FAC are comparing it to the libraries listed below
- Practical low-rank gradient compression for distributed optimization: https://arxiv.org/abs/1905.13727☆147Updated 5 months ago
- Code for "Picking Winning Tickets Before Training by Preserving Gradient Flow" https://openreview.net/pdf?id=SkgsACVKPH☆103Updated 5 years ago
- Code accompanying the NeurIPS 2020 paper: WoodFisher (Singh & Alistarh, 2020)☆49Updated 4 years ago
- Accuracy 77%. Large batch deep learning optimizer LARS for ImageNet with PyTorch and ResNet, using Horovod for distribution. Optional acc…☆38Updated 3 years ago
- Block Sparse movement pruning☆79Updated 4 years ago
- ☆46Updated 5 years ago
- Soft Threshold Weight Reparameterization for Learnable Sparsity☆89Updated 2 years ago
- Code for Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot☆42Updated 4 years ago
- Distributed K-FAC Preconditioner for PyTorch☆85Updated this week
- ☆70Updated 5 years ago
- ☆202Updated 2 years ago
- [NeurIPS 2021] code for "Taxonomizing local versus global structure in neural network loss landscapes" https://arxiv.org/abs/2107.11228☆19Updated 3 years ago
- ☆83Updated 5 years ago
- Code for "Training Neural Networks with Fixed Sparse Masks" (NeurIPS 2021).☆58Updated 3 years ago
- SNIP: SINGLE-SHOT NETWORK PRUNING BASED ON CONNECTION SENSITIVITY☆113Updated 5 years ago
- Pytorch implementation of the paper "SNIP: Single-shot Network Pruning based on Connection Sensitivity" by Lee et al.☆107Updated 5 years ago
- Parameter Efficient Transfer Learning with Diff Pruning☆73Updated 4 years ago
- ☆42Updated 2 years ago
- Reproducing RigL (ICML 2020) as a part of ML Reproducibility Challenge 2020☆28Updated 3 years ago
- ☆18Updated 5 years ago
- Implementation of Effective Sparsification of Neural Networks with Global Sparsity Constraint☆31Updated 3 years ago
- ☆157Updated 2 years ago
- This pytorch package implements PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance (ICML 2022).☆44Updated 2 years ago
- [ICLR 2023] Eva: Practical Second-order Optimization with Kronecker-vectorized Approximation☆12Updated last year
- [ICML 2021] "Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training" by Shiwei Liu, Lu Yin, De…☆45Updated last year
- Code for testing DCT plus Sparse (DCTpS) networks☆14Updated 3 years ago
- Towards Understanding Sharpness-Aware Minimization [ICML 2022]☆35Updated 2 years ago
- Efficient LLM Inference Acceleration using Prompting☆47Updated 5 months ago
- ☆74Updated 5 years ago
- ☆50Updated last year