Weight-importance sparse training in keyword spotting
Sihao Xue, Zhenyi Ying, Fan Mo, Min Wang, Jue Sun

TL;DR
This paper introduces a sparse training method for keyword spotting that significantly reduces model size while maintaining or improving performance, enabling efficient deployment on resource-constrained devices.
Contribution
It applies sparse algorithms to DNN-based keyword spotting models, pruning over 90% of parameters with minimal accuracy loss and automatically determining optimal model size.
Findings
Over 90% parameter pruning with minimal accuracy decline
Sparse models outperform baseline models with similar parameter counts
Automatic determination of optimal model size for specific tasks
Abstract
Large size models are implemented in recently ASR system to deal with complex speech recognition problems. The num- ber of parameters in these models makes them hard to deploy, especially on some resource-short devices such as car tablet. Besides this, at most of time, ASR system is used to deal with real-time problem such as keyword spotting (KWS). It is contradictory to the fact that large model requires long com- putation time. To deal with this problem, we apply some sparse algo- rithms to reduces number of parameters in some widely used models, Deep Neural Network (DNN) KWS, which requires real short computation time. We can prune more than 90 % even 95% of parameters in the model with tiny effect decline. And the sparse model performs better than baseline models which has same order number of parameters. Besides this, sparse algorithm can lead us to find rational model size au-…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpeech Recognition and Synthesis · Speech and Audio Processing · Neural Networks and Applications
