Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2312.08553 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913195825823744 |
|---|---|
| author | Ding, Shaojin Qiu, David Rim, David He, Yanzhang Rybakov, Oleg Li, Bo Prabhavalkar, Rohit Wang, Weiran Sainath, Tara N. Han, Zhonglin Li, Jian Yazdanbakhsh, Amir Agrawal, Shivani |
| author_facet | Ding, Shaojin Qiu, David Rim, David He, Yanzhang Rybakov, Oleg Li, Bo Prabhavalkar, Rohit Wang, Weiran Sainath, Tara N. Han, Zhonglin Li, Jian Yazdanbakhsh, Amir Agrawal, Shivani |
| contents | End-to-end automatic speech recognition (ASR) models have seen revolutionary quality gains with the recent development of large-scale universal speech models (USM). However, deploying these massive USMs is extremely expensive due to the enormous memory usage and computational cost. Therefore, model compression is an important research topic to fit USM-based ASR under budget in real-world scenarios. In this study, we propose a USM fine-tuning approach for ASR, with a low-bit quantization and N:M structured sparsity aware paradigm on the model weights, reducing the model complexity from parameter precision and matrix topology perspectives. We conducted extensive experiments with a 2-billion parameter USM on a large-scale voice search dataset to evaluate our proposed method. A series of ablation studies validate the effectiveness of up to int4 quantization and 2:4 sparsity. However, a single compression technique fails to recover the performance well under extreme setups including int2 quantization and 1:4 sparsity. By contrast, our proposed method can compress the model to have 9.4% of the size, at the cost of only 7.3% relative word error rate (WER) regressions. We also provided in-depth analyses on the results and discussions on the limitations and potential solutions, which would be valuable for future studies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_08553 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | USM-Lite: Quantization and Sparsity Aware Fine-tuning for Speech Recognition with Universal Speech Models Ding, Shaojin Qiu, David Rim, David He, Yanzhang Rybakov, Oleg Li, Bo Prabhavalkar, Rohit Wang, Weiran Sainath, Tara N. Han, Zhonglin Li, Jian Yazdanbakhsh, Amir Agrawal, Shivani Audio and Speech Processing Sound End-to-end automatic speech recognition (ASR) models have seen revolutionary quality gains with the recent development of large-scale universal speech models (USM). However, deploying these massive USMs is extremely expensive due to the enormous memory usage and computational cost. Therefore, model compression is an important research topic to fit USM-based ASR under budget in real-world scenarios. In this study, we propose a USM fine-tuning approach for ASR, with a low-bit quantization and N:M structured sparsity aware paradigm on the model weights, reducing the model complexity from parameter precision and matrix topology perspectives. We conducted extensive experiments with a 2-billion parameter USM on a large-scale voice search dataset to evaluate our proposed method. A series of ablation studies validate the effectiveness of up to int4 quantization and 2:4 sparsity. However, a single compression technique fails to recover the performance well under extreme setups including int2 quantization and 1:4 sparsity. By contrast, our proposed method can compress the model to have 9.4% of the size, at the cost of only 7.3% relative word error rate (WER) regressions. We also provided in-depth analyses on the results and discussions on the limitations and potential solutions, which would be valuable for future studies. |
| title | USM-Lite: Quantization and Sparsity Aware Fine-tuning for Speech Recognition with Universal Speech Models |
| topic | Audio and Speech Processing Sound |
| url | https://arxiv.org/abs/2312.08553 |