EPS
← All batches·2605.13075

Scaling few-shot spoken word classification with generative meta-continual learning

topic: current_projecttop score: 100released: 2026-05-14first surfaced: 2026-05-14arXivPDFlinked_to_results2026-05-14

Authors: Louise Beyers, Batsirayi Mupamhi Ziki, Ruan van der Merwe

arXiv · PDF

Summary

arXiv:2605. 13075v1 Announce Type: new Abstract: Few-shot spoken word classification has largely been developed for applications where a small number of classes is considered, and so the potential of larger-scale few-shot spoken word classification remains untapped.

Relevance

Read next because Scaling few-shot spoken word classification with generative meta-continual learning overlaps with clean result "Language-mismatch LoRA SFT on Qwen2.5-7B leaks the trained completion language into bystander directives the model was never trained on, absent under same-language SFT (LOW confidence)", clean result "A pretraining-data-poisoned Qwen3-4B backdoor only fires on the exact trigger tokens — paraphrases don't activate it, and base-model similarity to the trigger doesn't predict which inputs fire (MODERATE confidence)", clean result "EOS-in-loss was the confound: masking the recipient's EOS from cross-entropy revives within-marker chunk-binding from 1.3% to 23.5% (MODERATE confidence)". Matching terms: class, training, line, rate, capability, does, full, trained. Source: arxiv cs.CL (NLP).

Abstract

arXiv:2605.13075v1 Announce Type: new Abstract: Few-shot spoken word classification has largely been developed for applications where a small number of classes is considered, and so the potential of larger-scale few-shot spoken word classification remains untapped. This paper investigates the potential of a spoken word classifier to sequentially learn to distinguish between 1000 classes when it is given only five shots per class. We demonstrate that this scaling capability exists by training a model using the Generative Meta-Continual Learning (GeMCL) algorithm and comparing it to repeatedly trained or finetuned baselines. We find that GeMCL produces exceptionally stable performance, and although it does not always outperform a repeatedly fully-finetuned HuBERT model nor a frozen HuBERT model with a repeatedly trained classifier head, it produces comparable performance to the latter while adapting 2000 times faster, having been trained less than half of the data for two orders of magnitude less time.