Skip to content
conftrace_

network pruning

226 papers

Papers

Efficient Reinforcement Learning by Discovering Neural Pathways NeurIPS 2024 EFTNAS: Searching for Efficient Language Models in First-Order Weight-Reordered Super-Networks COLING 2024 EPSD: Early Pruning with Self-Distillation for Efficient Model Compression AAAI 2024 FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning AISTATS 2024 FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneity ICLR 2024 How Sparse Can We Prune A Deep Network: A Fundamental Limit Perspective NeurIPS 2024 In defense of parameter sharing for model-compression ICLR 2024 Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning EMNLP 2024 Low-Rank Prune-And-Factorize for Language Model Compression COLING 2024 Mechanistically analyzing the effects of fine-tuning on procedurally defined tasks ICLR 2024 Once for Both: Single Stage of Importance and Sparsity Search for Vision Transformer Compression CVPR 2024 PB-LLM: Partially Binarized Large Language Models ICLR 2024 Pruning is Optimal for Learning Sparse Features in High-Dimensions COLT 2024 Resource-Efficient Neural Networks for Embedded Systems JMLR 2024 RG-GAN: Dynamic Regenerative Pruning for Data-Efficient Generative Adversarial Networks AAAI 2024 SlimSAM: 0.1% Data Makes Segment Anything Slim NeurIPS 2024 Sparse Spiking Neural Network: Exploiting Heterogeneity in Timescales for Pruning Recurrent SNN ICLR 2024 Structured Optimal Brain Pruning for Large Language Models EMNLP 2024 SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruning ICLR 2024 The Need for Speed: Pruning Transformers with One Recipe ICLR 2024 UniPTS: A Unified Framework for Proficient Post-Training Sparsity CVPR 2024 WRP: Weight Recover Prune for Structured Sparsity ACL 2024 A Three-regime Model of Network Pruning ICML 2023 Attend Who Is Weak: Pruning-Assisted Medical Image Localization Under Sophisticated and Implicit Imbalances WACV 2023 Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck Principle ICCV 2023