Dynamic Encoder Size Based on Data-Driven Layer-wise Pruning for Speech Recognition

Jingjing Xu, Wei Zhou, Zijian Yang, Eugen Beck, Ralf Schlueter
7/10/2024
eess.AScs.CLcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Varying-size models are often required to deploy ASR systems under different hardware and/or application constraints such as memory and latency. To avoid redundant training and optimization efforts for individual models of different sizes, we present the dynamic encoder size approach, which jointly trains multiple performant models within one supernet from scratch. These subnets of various sizes are layer-wise pruned from the supernet, and thus, enjoy full parameter sharing. By combining score-based pruning with supernet training, we propose two novel methods, Simple-Top-k and Iterative-Zero-Out, to automatically select the best-performing subnets in a data-driven manner, avoiding resource-intensive search efforts. Our experiments using CTC on both Librispeech and TED-LIUM-v2 corpora show that our methods can achieve on-par performance as individually trained models of each size category. Also, our approach consistently brings small performance improvements for the full-size supernet.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{xu2024dynamic,
  title  = {Dynamic Encoder Size Based on Data-Driven Layer-wise Pruning for Speech Recognition},
  author = {Jingjing Xu and Wei Zhou and Zijian Yang and Eugen Beck and Ralf Schlueter},
  year   = {2024},
  eprint = {2407.18930},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.18930v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.18930.svg)](https://codeofpaper.com/paper/2407.18930)

Discussion