mlsanityData to 14 Oct 2026

AdaPTwin: Low-Cost Adaptive Compression of Product Twins in Transformers

arXiv 2406.08904 ↗First posted 13 Jun 2024cs.LG cs.SD eess.AScited by 0

Not on the map. Why?

Abstract (arXiv)

While large transformer-based models have exhibited remarkable performance in speaker-independent speech recognition, their large size and computational requirements make them expensive or impractical to use in resource-constrained settings. In this work, we propose a low-rank adaptive compression technique called AdaPTwin that jointly compresses product-dependent pairs of weight matrices in the transformer attention layer. Our approach can prioritize the compressed model's performance on a specific speaker while maintaining generalizability to new speakers and acoustic conditions. Notably, our technique requires only 8 hours of speech data for fine-tuning, which can be accomplished in under 20 minutes, making it highly cost-effective compared to other compression methods. We demonstrate the efficacy of our approach by compressing the Whisper and Distil-Whisper models by up to 45% while incurring less than a 2% increase in word error rate.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 38 references that are in the map. First posted on arXiv 13 Jun 2024.

Builds on

29 of 38 references.

References · 29

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
  4. 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
  5. 2020wav2vec 2.0: A Framework for Self-Supervised Learning of Speech Representationscited by 3,905
  6. 2021HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Unitscited by 2,342
  7. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  8. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  9. 2023Large Language Modelscited by 780
  10. 2023Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizescited by 737
  11. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
  12. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
17 more
  1. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
  2. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
  3. 2019Q8BERT: Quantized 8Bit BERTcited by 300
  4. 2020BinaryBERT: Pushing the Limit of BERT Quantizationcited by 178
  5. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
  6. 2021DistilHuBERT: Speech Representation Learning by Layer-wise Distillation of Hidden-unit BERTcited by 144
  7. 2023Distil-Whisper: Robust Knowledge Distillation via Large-Scale Pseudo Labellingcited by 90
  8. 2021Pufferfish: Communication-efficient Models At No Extra Costcited by 61
  9. 2021Initialization and Regularization of Factorized Neural Layerscited by 58
  10. 2019Lightweight and Efficient End-to-End Speech Recognition Using Low-Rank Transformercited by 47
  11. 2022In-context Learning Distillation: Transferring Few-shot Learning Ability of Pre-trained Language Modelscited by 37
  12. 2023DPHuBERT: Joint Distillation and Pruning of Self-Supervised Speech Modelscited by 36
  13. 2022FitHuBERT: Going Thinner and Deeper for Knowledge Distillation of Speech Self-Supervised Learningcited by 25
  14. 2021Shrinking Bigfoot: Reducing wav2vec 2.0 footprintcited by 21
  15. 2022Numerical Optimizations for Weighted Low-rank Estimation on Language Modelcited by 14
  16. 2023DQ-Whisper: Joint Distillation and Quantization for Efficient Multilingual Speech Recognitioncited by 11
  17. 2020Iterative Compression of End-to-End ASR Model using AutoMLcited by 6

Built on by

Not cited yet.