Skip to content
conftrace_

sparse training

103 papers

Papers

Winning the Lottery Ahead of Time: Efficient Early Network Pruning ICML 2022 ZeroFL: Efficient On-Device Training for Federated Learning with Local Sparsity ICLR 2022 AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks NeurIPS 2021 A Unified Lottery Ticket Hypothesis for Graph Neural Networks ICML 2021 Chasing Sparsity in Vision Transformers: An End-to-End Exploration NeurIPS 2021 Efficient Lottery Ticket Finding: Less Data is More ICML 2021 Efficient Neural Network Training via Forward and Backward Propagation Sparsification NeurIPS 2021 MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge NeurIPS 2021 Powerpropagation: A sparsity inducing weight reparameterisation NeurIPS 2021 Progressive Skeletonization: Trimming more fat from a network at initialization ICLR 2021 Sparse Training via Boosting Pruning Plasticity with Neuroregeneration NeurIPS 2021 The Elastic Lottery Ticket Hypothesis NeurIPS 2021 Training Neural Networks with Fixed Sparse Masks NeurIPS 2021 Winning Lottery Tickets in Deep Generative Models AAAI 2021 Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layers ICLR 2020 Picking Winning Tickets Before Training by Preserving Gradient Flow ICLR 2020 Pruning neural networks without any data by iteratively conserving synaptic flow NeurIPS 2020 ReSprop: Reuse Sparsified Backpropagation CVPR 2020 Sparse Weight Activation Training NeurIPS 2020 The Lottery Ticket Hypothesis for Pre-trained BERT Networks NeurIPS 2020 Top-KAST: Top-K Always Sparse Training NeurIPS 2020 Winning the Lottery with Continuous Sparsification NeurIPS 2020 Deconstructing Lottery Tickets: Zeros, Signs, and the Supermask NeurIPS 2019 Dynamic Sparse Graph for Efficient Deep Learning ICLR 2019 Global Sparse Momentum SGD for Pruning Very Deep Neural Networks NeurIPS 2019