Papers › An Investigation of Few-Shot Learning in Spoken Term Classification

An Investigation of Few-Shot Learning in Spoken Term Classification

26 Dec 2018arXiv:1812.10233archive 2025-07-28

Yangbin Chen, Tom Ko, Lifeng Shang, Xiao Chen, Xin Jiang, Qing Li

In this paper, we investigate the feasibility of applying few-shot learning algorithms to a speech task. We formulate a user-defined scenario of spoken term classification as a few-shot learning problem. In most few-shot learning studies, it is assumed that all the N classes are new in a N-way problem. We suggest that this assumption can be relaxed and define a N+M-way problem where N and M are the number of new classes and fixed classes respectively. We propose a modification to the Model-Agnostic Meta-Learning (MAML) algorithm to solve the problem. Experiments on the Google Speech Commands dataset show that our approach outperforms the conventional supervised learning approach and the original MAML.

PaperPDFCode

Code

Codelegant92/STC-MAML-PyTorch officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Few-Shot LearningGeneral ClassificationKeyword SpottingMeta-Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

MAML

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections