Small-footprint slimmable networks for keyword spotting

Zuhaib Akhtar, Mohammad Omar Khursheed, Dongsu Du, Yuzong Liu
4/21/2023
cs.SDcs.LGeess.AS

No confident code implementation found for this paper.

Abstract

In this work, we present Slimmable Neural Networks applied to the problem of small-footprint keyword spotting. We show that slimmable neural networks allow us to create super-nets from Convolutioanl Neural Networks and Transformers, from which sub-networks of different sizes can be extracted. We demonstrate the usefulness of these models on in-house Alexa data and Google Speech Commands, and focus our efforts on models for the on-device use case, limiting ourselves to less than 250k parameters. We show that slimmable models can match (and in some cases, outperform) models trained from scratch. Slimmable neural networks are therefore a class of models particularly useful when the same functionality is to be replicated at different memory and compute budgets, with different accuracy requirements.

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{akhtar2023smallfootprint,
  title  = {Small-footprint slimmable networks for keyword spotting},
  author = {Zuhaib Akhtar and Mohammad Omar Khursheed and Dongsu Du and Yuzong Liu},
  year   = {2023},
  eprint = {2304.12183},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.12183v1}
}

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

Discussion