Dongyan Lin
2026
SpidR-Adapt: A Universal Speech Representation Model for Few-Shot Adaptation
Mahi Luthra | Jiayi Shen | Maxime Poli | Angelo Ortiz Tandazo | Yosuke Higuchi | Youssef Benchekroun | Martin Gleize | Charles-Éric Saint-James | Dongyan Lin | Phillip Rust | Angel Villar-Corrales | Surya | Vanessa Stark | Rashel Moritz | Juan Pino | Yann LeCun | Emmanuel Dupoux
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Mahi Luthra | Jiayi Shen | Maxime Poli | Angelo Ortiz Tandazo | Yosuke Higuchi | Youssef Benchekroun | Martin Gleize | Charles-Éric Saint-James | Dongyan Lin | Phillip Rust | Angel Villar-Corrales | Surya | Vanessa Stark | Rashel Moritz | Juan Pino | Yann LeCun | Emmanuel Dupoux
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Human infants, with only a few hundred hours of speech exposure, acquire basic units of new languages, highlighting a striking efficiency gap compared to the data-hungry self-supervised speech models. To address this gap, this paper introduces SpidR-Adapt for rapid adaptation of speech units to new languages using minimal unlabeled data. We cast such low-resource speech representation learning as a meta-learning problem and construct a multi-task adaptive pre-training (MAdaPT) protocol which formulates the adaptation process as a bi-level optimization framework. To enable scalable meta-training under this framework, we propose a novel heuristic solution, first-order bi-level optimization (FOBLO), avoiding heavy computation costs. Finally, we stabilize meta-training by using a robust initialization through interleaved supervision which alternates self-supervised and supervised objectives. Empirically, SpidR-Adapt achieves rapid gains in phonemic discriminability (ABX) and downstream spoken language modeling scores (sWUGGY, sBLIMP, tSC), surpassing in-domain toplines after training on less than 1h of target-language audio and delivering 100× greater data efficiency than standard multi-task training.. These findings highlight a practical, architecture-agnostic path toward biologically inspired, data-efficient representations. We open-source the training code and model checkpoints at https://github.com/facebookresearch/spidr-adapt.
2025
LongTail-Swap: benchmarking language models’ abilities on rare words
Robin Algayres | Charles-Éric Saint-James | Mahi Luthra | Jiayi Shen | Youssef Benchekroun | Dongyan Lin | Rashel Moritz | Juan Pino | Emmanuel Dupoux
Findings of the Association for Computational Linguistics: EMNLP 2025
Robin Algayres | Charles-Éric Saint-James | Mahi Luthra | Jiayi Shen | Youssef Benchekroun | Dongyan Lin | Rashel Moritz | Juan Pino | Emmanuel Dupoux
Findings of the Association for Computational Linguistics: EMNLP 2025
Children learn to speak with a low amount of data and can be taught new words on a few-shot basis, making them particularly data-efficient learners. The BabyLM challenge aims at exploring language model (LM) training in the low-data regime but uses metrics that concentrate on the head of the word distribution. Here, we introduce LongTail-Swap (LT-Swap), a benchmark that focuses on the tail of the distribution, i.e., measures the ability of LMs to learn new words with very little exposure, like infants do. LT-Swap is a pretraining corpus-specific test set of acceptable versus unacceptable sentence pairs that isolate semantic and syntactic usage of rare words. Models are evaluated in a zero-shot fashion by computing the average log probabilities over the two members of each pair.We built two such test sets associated with the 10M words and 100M words BabyLM training sets, respectively, and evaluated 16 models from the BabyLM leaderboard. Our results not only highlight the poor performance of language models on rare words but also reveal that performance differences across LM architectures are much more pronounced in the long tail than in the head. This offers new insights into which architectures are better at handling rare word generalization. We’ve also made the code publicly available on GitHub, enabling the generation of LT-Swap benchmarks based on any English text corpus.