pith. sign in

arxiv: 1807.05960 · v3 · pith:U5JBDH66new · submitted 2018-07-16 · 💻 cs.LG · cs.CV· stat.ML

Meta-Learning with Latent Embedding Optimization

classification 💻 cs.LG cs.CVstat.ML
keywords latentadaptationgradient-basedmeta-learningspaceembeddingfew-shothigh-dimensional
0
0 comments X
read the original abstract

Gradient-based meta-learning techniques are both widely applicable and proficient at solving challenging few-shot learning and fast adaptation problems. However, they have practical difficulties when operating on high-dimensional parameter spaces in extreme low-data regimes. We show that it is possible to bypass these limitations by learning a data-dependent latent generative representation of model parameters, and performing gradient-based meta-learning in this low-dimensional latent space. The resulting approach, latent embedding optimization (LEO), decouples the gradient-based adaptation procedure from the underlying high-dimensional space of model parameters. Our evaluation shows that LEO can achieve state-of-the-art performance on the competitive miniImageNet and tieredImageNet few-shot classification tasks. Further analysis indicates LEO is able to capture uncertainty in the data, and can perform adaptation more effectively by optimizing in latent space.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SpurAudio: A Benchmark for Studying Shortcut Learning in Few-Shot Audio Classification

    cs.CV 2026-05 unverdicted novelty 7.0

    SpurAudio benchmark shows state-of-the-art few-shot audio classifiers suffer large performance drops when background correlations are disrupted, even in large pretrained models.

  2. Learning to learn with quantum neural networks via classical neural networks

    quant-ph 2019-07 unverdicted novelty 7.0

    Classical RNNs trained on small instances provide parameter initializations for QAOA and VQE that reduce total optimization iterations and generalize across problem sizes.

  3. MARCO: Navigating the Unseen Space of Semantic Correspondence

    cs.CV 2026-04 unverdicted novelty 6.0

    MARCO achieves new state-of-the-art semantic correspondence on SPair-71k, AP-10K and PF-PASCAL by combining coarse-to-fine refinement with self-distillation on DINOv2, delivering larger gains at fine thresholds and on...

  4. Few-Shot Video Classification via Temporal Alignment

    cs.CV 2019-06 unverdicted novelty 6.0

    TAM aligns query video frames to novel class examples, averages per-frame distances along the path, and uses continuous relaxation for end-to-end few-shot optimization, yielding gains on Kinetics and Something-Something-V2.

  5. Rethinking the Good Enough Embedding for Easy Few-Shot Learning

    cs.CV 2026-05 conditional novelty 5.0

    Frozen DINOv2-L features with k-NN classification and PCA/ICA refinement achieve state-of-the-art few-shot performance on four benchmarks without any backpropagation or fine-tuning.