Efficient Supernet Training with Orthogonal Softmax for Scalable ASR Model Compression

Jingjing Xu, Eugen Beck, Zijian Yang, Ralf Schlüter
1/31/2025
cs.CL

No confident code implementation found for this paper.

Abstract

ASR systems are deployed across diverse environments, each with specific hardware constraints. We use supernet training to jointly train multiple encoders of varying sizes, enabling dynamic model size adjustment to fit hardware constraints without redundant training. Moreover, we introduce a novel method called OrthoSoftmax, which applies multiple orthogonal softmax functions to efficiently identify optimal subnets within the supernet, avoiding resource-intensive search. This approach also enables more flexible and precise subnet selection by allowing selection based on various criteria and levels of granularity. Our results with CTC on Librispeech and TED-LIUM-v2 show that FLOPs-aware component-wise selection achieves the best overall performance. With the same number of training updates from one single job, WERs for all model sizes are comparable to or slightly better than those of individually trained models. Furthermore, we analyze patterns in the selected components and reveal interesting insights.

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. Any repos shown below are weak matches — 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{xu2025efficient,
  title  = {Efficient Supernet Training with Orthogonal Softmax for Scalable ASR Model Compression},
  author = {Jingjing Xu and Eugen Beck and Zijian Yang and Ralf Schlüter},
  year   = {2025},
  eprint = {2501.18895},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.18895v2}
}

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/2501.18895.svg)](https://codeofpaper.com/paper/2501.18895)

Discussion