structured pruning

OTOv2: Automatic, Generic, User-Friendly ICLR 2023 PDP: Parameter-free Differentiable Pruning is All You Need NeurIPS 2023 Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets NeurIPS 2023 PruMUX: Augmenting Data Multiplexing with Model Compression ACL 2023 Structured Pruning for Efficient Generative Pre-trained Language Models ACL 2023 Task-Agnostic Structured Pruning of Speech Representation Models Interspeech 2023 Unified Data-Free Compression: Pruning and Quantization without Fine-Tuning ICCV 2023 ZipLM: Inference-Aware Structured Pruning of Language Models NeurIPS 2023 Attentive Fine-Grained Structured Sparsity for Image Restoration CVPR 2022 Data-Efficient Structured Pruning via Submodular Optimization NeurIPS 2022 Hessian-Aware Pruning and Optimal Neural Implant WACV 2022 i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery L4DC 2022 Probing Structured Pruning on Multilingual Pre-trained Models: Settings, Algorithms, and Efficiency ACL 2022 Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization IJCAI 2022 Robust Lottery Tickets for Pre-trained Language Models ACL 2022 SInGE: Sparsity via Integrated Gradients Estimation of Neuron Relevance NeurIPS 2022 SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruning ICLR 2022 Structured Pruning Learns Compact and Accurate Models ACL 2022 Towards Fully Sparse Training: Information Restoration with Spatial Similarity AAAI 2022 Winning the Lottery Ahead of Time: Efficient Early Network Pruning ICML 2022 XPrompt: Exploring the Extreme of Prompt Tuning EMNLP 2022 A Compression-Compilation Co-Design Framework Towards Real-Time Object Detection on Mobile Devices AAAI 2021 Block Pruning For Faster Transformers EMNLP 2021 ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations ICLR 2021 Dirichlet Pruning for Convolutional Neural Networks AISTATS 2021