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

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Biju, Emil, Sriram, Anirudh, Pilanci, Mert
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916285468639232
author Biju, Emil
Sriram, Anirudh
Pilanci, Mert
author_facet Biju, Emil
Sriram, Anirudh
Pilanci, Mert
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2406_08904
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle AdaPTwin: Low-Cost Adaptive Compression of Product Twins in Transformers
Biju, Emil
Sriram, Anirudh
Pilanci, Mert
Machine Learning
Sound
Audio and Speech Processing
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.
title AdaPTwin: Low-Cost Adaptive Compression of Product Twins in Transformers
topic Machine Learning
Sound
Audio and Speech Processing
url https://arxiv.org/abs/2406.08904