CVNov 30, 2020

Revisiting Unsupervised Meta-Learning via the Characteristics of Few-Shot Tasks

arXiv:2011.14663v341 citations
AI Analysis

This work provides a strong baseline for unsupervised meta-learning, which is crucial for reducing the reliance on large labeled datasets in few-shot learning scenarios.

This paper tackles unsupervised meta-learning for few-shot image classification, where the goal is to learn generalizable embeddings without labeled base classes. By introducing a sufficient sampling strategy, a semi-normalized similarity measure, synthesized confusing instances, and a task-specific embedding transformation, the authors achieve performance comparable to or better than supervised meta-learning variants.

Meta-learning has become a practical approach towards few-shot image classification, where "a strategy to learn a classifier" is meta-learned on labeled base classes and can be applied to tasks with novel classes. We remove the requirement of base class labels and learn generalizable embeddings via Unsupervised Meta-Learning (UML). Specifically, episodes of tasks are constructed with data augmentations from unlabeled base classes during meta-training, and we apply embedding-based classifiers to novel tasks with labeled few-shot examples during meta-test. We observe two elements play important roles in UML, i.e., the way to sample tasks and measure similarities between instances. Thus we obtain a strong baseline with two simple modifications -- a sufficient sampling strategy constructing multiple tasks per episode efficiently together with a semi-normalized similarity. We then take advantage of the characteristics of tasks from two directions to get further improvements. First, synthesized confusing instances are incorporated to help extract more discriminative embeddings. Second, we utilize an additional task-specific embedding transformation as an auxiliary component during meta-training to promote the generalization ability of the pre-adapted embeddings. Experiments on few-shot learning benchmarks verify that our approaches outperform previous UML methods and achieve comparable or even better performance than its supervised variants.

Code Implementations1 repo
Foundations

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

Your Notes