English

Efficient keyword spotting using dilated convolutions and gating

Machine Learning 2019-02-19 v2 Computation and Language Sound Audio and Speech Processing Machine Learning

Abstract

We explore the application of end-to-end stateless temporal modeling to small-footprint keyword spotting as opposed to recurrent networks that model long-term temporal dependencies using internal states. We propose a model inspired by the recent success of dilated convolutions in sequence modeling applications, allowing to train deeper architectures in resource-constrained configurations. Gated activations and residual connections are also added, following a similar configuration to WaveNet. In addition, we apply a custom target labeling that back-propagates loss from specific frames of interest, therefore yielding higher accuracy and only requiring to detect the end of the keyword. Our experimental results show that our model outperforms a max-pooling loss trained recurrent neural network using LSTM cells, with a significant decrease in false rejection rate. The underlying dataset - "Hey Snips" utterances recorded by over 2.2K different speakers - has been made publicly available to establish an open reference for wake-word detection.

Keywords

Cite

@article{arxiv.1811.07684,
  title  = {Efficient keyword spotting using dilated convolutions and gating},
  author = {Alice Coucke and Mohammed Chlieh and Thibault Gisselbrecht and David Leroy and Mathieu Poumeyrol and Thibaut Lavril},
  journal= {arXiv preprint arXiv:1811.07684},
  year   = {2019}
}

Comments

Accepted for publication to ICASSP 2019

R2 v1 2026-06-23T05:20:28.550Z