Marius Paraschiv

h-index5
1paper
101citations

1 Paper

1.6SDNov 28, 2017
Exploiting Nontrivial Connectivity for Automatic Speech Recognition

Marius Paraschiv, Lasse Borgholt, Tycho Max Sylvester Tax et al.

Nontrivial connectivity has allowed the training of very deep networks by addressing the problem of vanishing gradients and offering a more efficient method of reusing parameters. In this paper we make a comparison between residual networks, densely-connected networks and highway networks on an image classification task. Next, we show that these methodologies can easily be deployed into automatic speech recognition and provide significant improvements to existing models.