Skip to content
conftrace_

network pruning

226 papers

Papers

Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks ICLR 2022 Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization IJCAI 2022 Pruning has a disparate impact on model accuracy NeurIPS 2022 Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free CVPR 2022 Rare Gems: Finding Lottery Tickets at Initialization NeurIPS 2022 Robust Binary Models by Pruning Randomly-initialized Networks NeurIPS 2022 SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters EMNLP 2022 Sparse Double Descent: Where Network Pruning Aggravates Overfitting ICML 2022 Specializing Pre-trained Language Models for Better Relational Reasoning via Network Pruning NAACL 2022 Spectral Pruning for Recurrent Neural Networks AISTATS 2022 State Transition of Dendritic Spines Improves Learning of Sparse Spiking Neural Networks ICML 2022 Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learning ICML 2022 Universality of Winning Tickets: A Renormalization Group Perspective ICML 2022 Variational Feature Pyramid Networks ICML 2022 Weighted Mutual Learning with Diversity-Driven Model Compression NeurIPS 2022 When To Prune? A Policy Towards Early Structural Pruning CVPR 2022 Winning the Lottery Ahead of Time: Efficient Early Network Pruning ICML 2022 A Gradient Flow Framework For Analyzing Network Pruning ICLR 2021 Aligned Structured Sparsity Learning for Efficient Image Super-Resolution NeurIPS 2021 Associative Convolutional Layers AISTATS 2021 AttentiveNAS: Improving Neural Architecture Search via Attentive Sampling CVPR 2021 A Unified Lottery Ticket Hypothesis for Graph Neural Networks ICML 2021 AutoLR: Layer-wise Pruning and Auto-tuning of Learning Rates in Fine-tuning of Deep Networks AAAI 2021 CAP: Context-Aware Pruning for Semantic Segmentation WACV 2021 Chasing Sparsity in Vision Transformers: An End-to-End Exploration NeurIPS 2021