Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 35 min ago
PreprintarXiv licencearXiv

A Practical Recipe for Semi-Supervised Federated ASR: Online Pseudo-Labels with Server Update Stabilization

Abstract

Semi-supervised federated learning (SSFL) trains models on clients' unlabeled data using a teacher to generate pseudo-labels, with a small labeled seed dataset on the server. Automatic Speech Recognition (ASR) is particularly fragile here: pseudo-label errors compound across the output sequence and across training rounds into divergence, leaving a large gap to fully-supervised FL. We show that closing this gap turns on two coupled design axes -- the teacher (which model generates the pseudo-labels) and the anchor (the server-side updates on labeled data that stabilize training). On the teacher axis, a per-client online teacher (each client's own evolving model) diverges on its own, but once stabilized it matches or beats the broadcast global teacher (one server model, fixed within a round) -- decisively in-domain and competitively under domain shift. As the seed grows stronger and the online teacher's advantage narrows, a transitioning teacher (global → online at round r) matches or beats both. On the anchor axis, the server must keep training on labeled data between rounds -- otherwise the online teacher drifts -- and this interleaving, more than the seed model, governs convergence. The two axes are inseparable: aggressive teacher choices pay off only once the anchor stabilizes training, which is highly sensitive to data augmentation and batch size -- the settings that govern how much input and gradient noise the server injects. How much stabilization is needed is domain-dependent, governed by the dispersion of the seed data and its overlap with client data. These findings yield guidelines for SSFL in ASR training, improving over the strongest prior method on 9 of 11 pairs, by 20.8% on average in-domain and 10.0% cross-domain, narrowing the gap to fully-supervised FL.

Related

  1. Adaptive Beam Hopping and Power Control for Dual-Layer Over-the-Air Online Federated Learning in LEO Satellite Networks
    Zhendong Li, Shaojie Wang, Zhou Su +5
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Practical Stabilization of Switched Affine Systems under Dwell Time: From Polytopic to p-Norm Lyapunov Functions
    Felipe Cinto, Alexis J. Vallarella, Hernan Haimovich +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Online Supervised Dimension Reduction with Random Features: Diagnostics and Computational Trade-offs
    Zhenlin Yao, Wei Xiong
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Practical Advantages of Online Conformal Prediction for Data Streams
    Stéphane Chrétien, Maryam Hoseini-Behbahani, Guillaume Metzler
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Sequential Probability Ratio Test using Z-Statistics (SPRT-z): A Practical Approach for Online Experimentation
    Derek L. Ho, Emma G. Thomas
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{bae2026practical,
  title = {{A Practical Recipe for Semi-Supervised Federated ASR: Online Pseudo-Labels with Server Update Stabilization}},
  author = {Wonho Bae and Zakaria Aldeneh and Martin Pelikan and Jan "Honza" Silovsky and Tatiana Likhomanenko and Sheikh Shams Azam},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.25471},
  eprint = {2609.25471},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.25471},
}
RIS
TY  - UNPB
TI  - A Practical Recipe for Semi-Supervised Federated ASR: Online Pseudo-Labels with Server Update Stabilization
AU  - Wonho Bae
AU  - Zakaria Aldeneh
AU  - Martin Pelikan
AU  - Jan "Honza" Silovsky
AU  - Tatiana Likhomanenko
AU  - Sheikh Shams Azam
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2609.25471
UR  - https://arxiv.org/abs/2609.25471
AB  - Semi-supervised federated learning (SSFL) trains models on clients' unlabeled data using a teacher to generate pseudo-labels, with a small labeled seed dataset on the server. Automatic Speech Recognition (ASR) is particularly fragile here: pseudo-label errors compound across the output sequence and across training rounds into divergence, leaving a large gap to fully-supervised FL. We show that closing this gap turns on two coupled design axes -- the teacher (which model generates the pseudo-labels) and the anchor (the server-side updates on labeled data that stabilize training). On the teacher axis, a per-client online teacher (each client's own evolving model) diverges on its own, but once stabilized it matches or beats the broadcast global teacher (one server model, fixed within a round) -- decisively in-domain and competitively under domain shift. As the seed grows stronger and the online teacher's advantage narrows, a transitioning teacher (global → online at round r) matches or beats both. On the anchor axis, the server must keep training on labeled data between rounds -- otherwise the online teacher drifts -- and this interleaving, more than the seed model, governs convergence. The two axes are inseparable: aggressive teacher choices pay off only once the anchor stabilizes training, which is highly sensitive to data augmentation and batch size -- the settings that govern how much input and gradient noise the server injects. How much stabilization is needed is domain-dependent, governed by the dispersion of the seed data and its overlap with client data. These findings yield guidelines for SSFL in ASR training, improving over the strongest prior method on 9 of 11 pairs, by 20.8% on average in-domain and 10.0% cross-domain, narrowing the gap to fully-supervised FL.
ER  -