arXiv AI

Should Pseudo-Labels Share Mini-Batches with Labeled Examples? Semi-Supervised Continual Active Learning with Limited Training Cost

The paper investigates how pseudo‑labeled examples should be incorporated into mini‑batches during continual active learning (CAL) to balance annotation savings and training cost. It formalizes the problem as two decisions: selecting which unlabeled examples receive pseudo‑labels and determining their share of each mini‑batch. The proposed semi‑supervised continual active learning (SSCAL) method, compatible with any acquisition function, uses distance‑based pseudo‑labeling, caps their batch share, and reweights labeled losses to maintain gradient balance, achieving top performance across multiple audio datasets and settings.

arXiv Machine Learning
Sep 23

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

The paper presents a practical approach to semi‑supervised federated learning for automatic speech recognition (ASR). It demonstrates that using a per‑client online teacher combined with a stabilizing server‑side anchor—where the server continues training on labeled data between rounds—significantly reduces divergence caused by pseudo‑label errors. The authors provide design guidelines that improve in‑domain performance by an average of 20.8 % and cross‑domain performance by 10.0 % over the best prior method, narrowing the gap to fully‑supervised federated learning.

By Wonho Bae, Zakaria Aldeneh, Martin Pelikan, Jan "Honza" Silovsky, Tatiana Likhomanenko, Sheikh Shams Azam
arXiv Machine Learning
Jun 10

Robust Regression of General ReLUs with Queries

arXiv:2606. 11130v1 Announce Type: new Abstract: We study the task of agnostically learning general (as opposed to homogeneous) ReLUs under the Gaussian distribution with respect to the squared loss.

By Ilias Diakonikolas, Daniel M. Kane, Mingchen Ma
arXiv AI
Oct 27

Geometric Consistency Based Label-Free Validation for Checkpoint Selection in Audio Active Learning

The paper introduces a label‑free validation method called geometric consistency for selecting checkpoints in audio active learning. It uses pretrained embeddings to generate pseudo‑labels for unlabeled data, scoring checkpoints by agreement with these pseudo‑labels and cross‑entropy on the labeled set. The method works with any query strategy, requires only one additional forward pass per round, and achieves top performance in area under the labeling curve without using extra labeled data.

By Shiqi Zhang, Tuomas Virtanen