Co-occurring keywords · papers mentioning both
Papers
Federated Pruning: Improving Neural Network Efficiency with Federated Learning
Interspeech 2022
Few-Shot Backdoor Defense Using Shapley Estimation
CVPR 2022
Finding Dynamics Preserving Adversarial Winning Tickets
AISTATS 2022
Finding Nearly Everything within Random Binary Networks
AISTATS 2022
Finding the Dominant Winning Ticket in Pre-Trained Language Models
ACL 2022
Forget-free Continual Learning with Winning Subnetworks
ICML 2022
Get More at Once: Alternating Sparse Training with Gradient Correction
NeurIPS 2022
Gradient and Mangitude Based Pruning for Sparse Deep Neural Networks
AAAI 2022
Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win
AAAI 2022
Interspace Pruning: Using Adaptive Filter Representations To Improve Training of Sparse CNNs
CVPR 2022
i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery
L4DC 2022
Learning to Win Lottery Tickets in BERT Transfer via Task-agnostic Mask Training
NAACL 2022
Model Compression by Iterative Pruning with Knowledge Distillation and Its Application to Speech Enhancement
Interspeech 2022
Most Activation Functions Can Win the Lottery Without Excessive Depth
NeurIPS 2022
Multicoated Supermasks Enhance Hidden Networks
ICML 2022
Neural Network Pruning by Cooperative Coevolution
IJCAI 2022
Neural Network Pruning Denoises the Features and Makes Local Connectivity Emerge in Visual Tasks
ICML 2022
Non-Uniform Adversarially Robust Pruning
AutoML 2022
On the Existence of Universal Lottery Tickets
ICLR 2022
Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning
NeurIPS 2022
Optimal channel selection with discrete QCQP
AISTATS 2022
PAC-Net: A Model Pruning Approach to Inductive Transfer Learning
ICML 2022
Plant 'n' Seek: Can You Find the Winning Ticket?
ICLR 2022
PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance
ICML 2022
Prior Gradient Mask Guided Pruning-Aware Fine-Tuning
AAAI 2022