Co-occurring keywords · papers mentioning both
Papers
Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection
ICML 2020
High Performance Natural Language Processing
EMNLP 2020
HYDRA: Pruning Adversarially Robust Neural Networks
NeurIPS 2020
Learning Sparse Neural Networks for Better Generalization
IJCAI 2020
Neuron Merging: Compensating for Pruned Neurons
NeurIPS 2020
Picking Winning Tickets Before Training by Preserving Gradient Flow
ICLR 2020
Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLP
ICLR 2020
Pruning Filter in Filter
NeurIPS 2020
Pruning from Scratch
AAAI 2020
Reborn Filters: Pruning Convolutional Neural Networks with Limited Data
AAAI 2020
Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot
NeurIPS 2020
Structured Compression by Weight Encryption for Unstructured Pruning and Quantization
CVPR 2020
The Generalization-Stability Tradeoff In Neural Network Pruning
NeurIPS 2020
The Lottery Ticket Hypothesis for Pre-trained BERT Networks
NeurIPS 2020
Train Big, Then Compress: Rethinking Model Size for Efficient Training and Inference of Transformers
ICML 2020
Ultrafast Photorealistic Style Transfer via Neural Architecture Search
AAAI 2020
What's Hidden in a Randomly Weighted Neural Network?
CVPR 2020
WoodFisher: Efficient Second-Order Approximation for Neural Network Compression
NeurIPS 2020
Centripetal SGD for Pruning Very Deep Convolutional Networks With Complicated Structure
CVPR 2019
Crafting Efficient Neural Graph of Large Entropy
IJCAI 2019
Evaluating Lottery Tickets Under Distributional Shifts
EMNLP 2019
Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration
CVPR 2019
Network Pruning via Transformable Architecture Search
NeurIPS 2019
On Implicit Filter Level Sparsity in Convolutional Neural Networks
CVPR 2019
Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization
ICML 2019