Co-occurring keywords · papers mentioning both
Papers
DropNet: Reducing Neural Network Complexity via Iterative Pruning
ICML 2020
Few Shot Network Compression via Cross Distillation
AAAI 2020
Greedy Optimization Provably Wins the Lottery: Logarithmic Number of Winning Tickets is Enough
NeurIPS 2020
HRank: Filter Pruning Using High-Rank Feature Map
CVPR 2020
Is Pruning Compression?: Investigating Pruning Via Network Layer Similarity
WACV 2020
Layerwise Sparse Coding for Pruned Deep Neural Networks with Extreme Compression Ratio
AAAI 2020
Learning Sparse Neural Networks for Better Generalization
IJCAI 2020
Linear Mode Connectivity and the Lottery Ticket Hypothesis
ICML 2020
Logarithmic Pruning is All You Need
NeurIPS 2020
Lookahead: A Far-sighted Alternative of Magnitude-based Pruning
ICLR 2020
Neural Network Pruning With Residual-Connections and Limited-Data
CVPR 2020
One-Shot Pruning of Recurrent Neural Networks by Jacobian Spectrum Evaluation
ICLR 2020
Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is Sufficient
NeurIPS 2020
PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-Time Execution on Mobile Devices
AAAI 2020
Plug-in, Trainable Gate for Streamlining Arbitrary Neural Networks
AAAI 2020
Probabilistic Connection Importance Inference and Lossless Compression of Deep Neural Networks
ICLR 2020
Proving the Lottery Ticket Hypothesis: Pruning is All You Need
ICML 2020
Pruning from Scratch
AAAI 2020
Pruning neural networks without any data by iteratively conserving synaptic flow
NeurIPS 2020
SCOP: Scientific Control for Reliable Neural Network Pruning
NeurIPS 2020
Soft Threshold Weight Reparameterization for Learnable Sparsity
ICML 2020
Sparse Weight Activation Training
NeurIPS 2020
Spectral Pruning: Compressing Deep Neural Networks via Spectral Analysis and its Generalization Error
IJCAI 2020
Squeeze for Sneeze: Compact Neural Networks for Cold and Flu Recognition
Interspeech 2020
Supermasks in Superposition
NeurIPS 2020