Co-occurring keywords · papers mentioning both
Papers
Unleashing Mask: Explore the Intrinsic Out-of-Distribution Detection Capability
ICML 2023
X-Pruner: eXplainable Pruning for Vision Transformers
CVPR 2023
Advancing Model Pruning via Bi-level Optimization
NeurIPS 2022
A Fast Post-Training Pruning Framework for Transformers
NeurIPS 2022
An Information-Theoretic Justification for Model Pruning
AISTATS 2022
A Win-win Deal: Towards Sparse and Robust Pre-trained Language Models
NeurIPS 2022
Block-Skim: Efficient Question Answering for Transformer
AAAI 2022
BMCook: A Task-agnostic Compression Toolkit for Big Models
EMNLP 2022
Debiasing Masks: A New Framework for Shortcut Mitigation in NLU
EMNLP 2022
Differentially Private Model Compression
NeurIPS 2022
Dreaming To Prune Image Deraining Networks
CVPR 2022
Edinburgh’s Submission to the WMT 2022 Efficiency Task
EMNLP 2022
EPIC TTS Models: Empirical Pruning Investigations Characterizing Text-To-Speech Models
Interspeech 2022
FedDUAP: Federated Learning with Dynamic Update and Adaptive Pruning Using Shared Data on the Server
IJCAI 2022
From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compression
AAAI 2022
How Well Do Sparse ImageNet Models Transfer?
CVPR 2022
Learning to Win Lottery Tickets in BERT Transfer via Task-agnostic Mask Training
NAACL 2022
Losses Can Be Blessings: Routing Self-Supervised Speech Representations Towards Efficient Multilingual and Multitask Speech Processing
NeurIPS 2022
PAC-Net: A Model Pruning Approach to Inductive Transfer Learning
ICML 2022
PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance
ICML 2022
Playing Lottery Tickets with Vision and Language
AAAI 2022
Prior Gradient Mask Guided Pruning-Aware Fine-Tuning
AAAI 2022
Prune and Tune Ensembles: Low-Cost Ensemble Learning with Sparse Independent Subnetworks
AAAI 2022
Pruning Adatperfusion with Lottery Ticket Hypothesis
NAACL 2022
Resilient and Communication Efficient Learning for Heterogeneous Federated Systems
ICML 2022