Continuous Soft Pseudo-Labeling in ASR
Not on the map. Why?
Abstract (arXiv)
Continuous pseudo-labeling (PL) algorithms such as slimIPL have recently emerged as a powerful strategy for semi-supervised learning in speech recognition. In contrast with earlier strategies that alternated between training a model and generating pseudo-labels (PLs) with it, here PLs are generated in end-to-end manner as training proceeds, improving training speed and the accuracy of the final model. PL shares a common theme with teacher-student models such as distillation in that a teacher model generates targets that need to be mimicked by the student model being trained. However, interestingly, PL strategies in general use hard-labels, whereas distillation uses the distribution over labels as the target to mimic. Inspired by distillation we expect that specifying the whole distribution (aka soft-labels) over sequences as the target for unlabeled data, instead of a single best pass pseudo-labeled transcript (hard-labels) should improve PL performance and convergence. Surprisingly and unexpectedly, we find that soft-labels targets can lead to training divergence, with the model collapsing to a degenerate token distribution per frame. We hypothesize that the reason this does not happen with hard-labels is that training loss on hard-labels imposes sequence-level consistency that keeps the model from collapsing to the degenerate solution. In this paper, we show several experiments that support this hypothesis, and experiment with several regularization approaches that can ameliorate the degenerate collapse when using soft-labels. These approaches can bring the accuracy of soft-labels closer to that of hard-labels, and while they are unable to outperform them yet, they serve as a useful framework for further improvements.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 11 Nov 2022.
Builds on
22 of 32 references.
References · 22
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
- 2019SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognitioncited by 1,355
- 2018Self-Attention with Relative Position Representationscited by 1,112
- 2015Listen, Attend and Spellcited by 542
- 2019Libri-Light: A Benchmark for ASR with Limited or No Supervisioncited by 462
- 2019ReMixMatch: Semi-Supervised Learning with Distribution Alignment and Augmentation Anchoringcited by 349
- 2020Pushing the Limits of Semi-Supervised Learning for Automatic Speech Recognitioncited by 185
- 2020Improved Noisy Student Training for Automatic Speech Recognitioncited by 139
- 2019Self-Training for End-to-End Speech Recognitioncited by 128
- 2019End-to-end ASR: from Supervised to Semi-Supervised Learning with Modern Architecturescited by 120
10 more
- 2020Self-training and Pre-training are Complementary for Speech Recognitioncited by 98
- 2020Iterative Pseudo-Labeling for Speech Recognitioncited by 81
- 2020Rethinking Evaluation in ASR: Are Our Models Robust Enough?cited by 72
- 2020SlimIPL: Language-Model-Free Iterative Pseudo-Labelingcited by 54
- 2021CAPE: Encoding Relative Positions with Continuous Augmented Positional Embeddingscited by 47
- 2021Momentum Pseudo-Labeling for Semi-Supervised Speech Recognitioncited by 37
- 2020Semi-supervised ASR by End-to-end Self-trainingcited by 29
- 2021Kaizen: Continuously improving teacher using Exponential Moving Average for semi-supervised speech recognitioncited by 21
- 2020Semi-Supervised Speech Recognition via Local Prior Matchingcited by 13
- 2021Advancing Momentum Pseudo-Labeling with Conformer and Initialization Strategycited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 3.
6 papers.
- 2023How to Scale Your EMAcited by 22
- 2024Fast Streaming Transducer ASR Prototyping via Knowledge Distillation with Whispercited by 1
- 2025Pseudo2Real: Task Arithmetic for Pseudo-Label Correction in Automatic Speech Recognitioncited by 1
- 2026Enhancing Automatic Chord Recognition via Pseudo-Labeling and Knowledge Distillationcited by 0
- 2026The Exact Worst-Case Tail Probability under Bounded Kurtosiscited by 0
- 2026A Practical Recipe for Semi-Supervised Federated ASR: Online Pseudo-Labels with Server Update Stabilizationcited by 0
- 2026A Practical Recipe for Semi-Supervised Federated ASR: Online Pseudo-Labels with Server Update Stabilization21 Sep 2026
- 2026The Exact Worst-Case Tail Probability under Bounded Kurtosis6 Jul 2026
- 2026Enhancing Automatic Chord Recognition via Pseudo-Labeling and Knowledge Distillation23 Feb 2026
- 2025Pseudo2Real: Task Arithmetic for Pseudo-Label Correction in Automatic Speech Recognition9 Oct 2025
- 2024Fast Streaming Transducer ASR Prototyping via Knowledge Distillation with Whisper20 Sep 2024
- 2023How to Scale Your EMA25 Jul 2023