Sample adaptive data augmentation with progressive scheduling
Hongxuan Lu, Biao Li

TL;DR
This paper introduces PS-SapAug, a dynamic, sample-adaptive data augmentation method with progressive scheduling for speech recognition, improving robustness and reducing error rates by tailoring augmentation to individual samples and training stages.
Contribution
It proposes a novel two-stage training approach that adaptively adjusts augmentation parameters based on sample loss and training progress, enhancing ASR performance.
Findings
Up to 8.13% WER reduction on LibriSpeech-100h
Significant improvements on AISHELL-1 dataset
Effective reduction of recognition errors
Abstract
Data augmentation is a widely adopted technique utilized to improve the robustness of automatic speech recognition (ASR). Employing a fixed data augmentation strategy for all training data is a common practice. However, it is important to note that there can be variations in factors such as background noise, speech rate, etc. among different samples within a single training batch. By using a fixed augmentation strategy, there is a risk that the model may reach a suboptimal state. In addition to the risks of employing a fixed augmentation strategy, the model's capabilities may differ across various training stages. To address these issues, this paper proposes the method of sample-adaptive data augmentation with progressive scheduling(PS-SapAug). The proposed method applies dynamic data augmentation in a two-stage training approach. It employs hybrid normalization to compute…
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
TopicsAdvanced Data Compression Techniques · Distributed and Parallel Computing Systems
