View publication

We propose a frame-level SpecAugment method (f-SpecAugment) to improve the performance of deep convolutional neural networks (CNN) for hybrid HMM based ASR systems. Similar to the utterance level SpecAugment, f-SpecAugment performs three transformations: time warping, frequency masking, and time masking. Instead of applying the transformations at the utterance level, f-SpecAugment applies them to each convolution window independently during training. We demonstrate that f-SpecAugment is more effective than the utterance level SpecAugment for deep CNN based hybrid models. We evaluate the proposed f-SpecAugment on 50-layer Self-Normalizing Deep CNN (SNDCNN) acoustic models trained with up to 25000 hours of training data. We observe f-SpecAugment reduces WER by 0.5-4.5% relatively across different ASR tasks for four languages. As the benefits of augmentation techniques tend to diminish as training data size increases, the large scale training reported is important in understanding the effectiveness of f-SpecAugment. Our experiments demonstrate that even with 25k training data, f-SpecAugment is still effective. We also demonstrate that f-SpecAugment has benefits approximately equivalent to doubling the amount of training data for deep CNNs.

Related readings and updates.

We study an extension of the standard two-party communication model in which Alice and Bob hold probability distributions pp and qq over domains XX and YY, respectively. Their goal is to estimate

Exp,yq[f(x,y)]\mathbb{E}_{x \sim p, y \sim q}[f(x, y)]

to within additive error ε\varepsilon for a bounded function ff, known to both parties. We refer to this as the distributed estimation problem. Special cases of this problem arise in a variety of areas…

Read more

Various differentially private algorithms instantiate the exponential mechanism, and require sampling from the distribution exp(f)exp(−f) for a suitable function ff. When the domain of the distribution is high-dimensional, this sampling can be computationally challenging. Using heuristic sampling schemes such as Gibbs sampling does not necessarily lead to provable privacy. When ff is convex, techniques from log-concave sampling lead to…

Read more