LGAIMLSep 12, 2019

Modular Meta-Learning with Shrinkage

arXiv:1909.05557v435 citations
Originality Highly original
AI Analysis

This addresses the challenge of scaling meta-learning to real-world applications without manual architecture design, though it is incremental as it builds on prior methods like MAML.

The paper tackled the problem of meta-learning large models for low-data tasks like few-shot text-to-speech synthesis by proposing a method that automatically discovers task-specific and general modules using Bayesian shrinkage, outperforming existing approaches in domains with little data and long adaptation.

Many real-world problems, including multi-speaker text-to-speech synthesis, can greatly benefit from the ability to meta-learn large models with only a few task-specific components. Updating only these task-specific modules then allows the model to be adapted to low-data tasks for as many steps as necessary without risking overfitting. Unfortunately, existing meta-learning methods either do not scale to long adaptation or else rely on handcrafted task-specific architectures. Here, we propose a meta-learning approach that obviates the need for this often sub-optimal hand-selection. In particular, we develop general techniques based on Bayesian shrinkage to automatically discover and learn both task-specific and general reusable modules. Empirically, we demonstrate that our method discovers a small set of meaningful task-specific modules and outperforms existing meta-learning approaches in domains like few-shot text-to-speech that have little task data and long adaptation horizons. We also show that existing meta-learning methods including MAML, iMAML, and Reptile emerge as special cases of our method.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes