Selecting task with optimal transport self-supervised learning for few-shot classification
Not on the map. Why?
Abstract (arXiv)
Few-Shot classification aims at solving problems that only a few samples are available in the training process. Due to the lack of samples, researchers generally employ a set of training tasks from other domains to assist the target task, where the distribution between assistant tasks and the target task is usually different. To reduce the distribution gap, several lines of methods have been proposed, such as data augmentation and domain alignment. However, one common drawback of these algorithms is that they ignore the similarity task selection before training. The fundamental problem is to push the auxiliary tasks close to the target task. In this paper, we propose a novel task selecting algorithm, named Optimal Transport Task Selecting (OTTS), to construct a training set by selecting similar tasks for Few-Shot learning. Specifically, the OTTS measures the task similarity by calculating the optimal transport distance and completes the model training via a self-supervised strategy. By utilizing the selected tasks with OTTS, the training process of Few-Shot learning become more stable and effective. Other proposed methods including data augmentation and domain alignment can be used in the meantime with OTTS. We conduct extensive experiments on a variety of datasets, including MiniImageNet, CIFAR, CUB, Cars, and Places, to evaluate the effectiveness of OTTS. Experimental results validate that our OTTS outperforms the typical baselines, i.e., MAML, matchingnet, protonet, by a large margin (averagely 1.72% accuracy improvement).
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 1 Apr 2022.
Builds on
24 of 46 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 51,950
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,492
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,870
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,730
- 2017Prototypical Networks for Few-shot Learningcited by 3,011
- 2016Matching Networks for One Shot Learningcited by 2,251
- 2017Random Erasing Data Augmentationcited by 1,238
- 2021Domain Generalization: A Surveycited by 760
- 2019Self-supervised Visual Feature Learning with Deep Neural Networks: A Surveycited by 656
- 2019On The Power of Curriculum Learning in Training Deep Networkscited by 285
- 2017Automated Curriculum Learning for Neural Networkscited by 252
12 more
- 2017Teacher-Student Curriculum Learningcited by 201
- 2019Task2Vec: Task Embedding for Meta-Learningcited by 201
- 2020Cross-Domain Few-Shot Classification via Learned Feature-Wise Transformationcited by 184
- 2018Optimal Transport for structured data with application on graphscited by 171
- 2020Geometric Dataset Distances via Optimal Transportcited by 158
- 2018Curriculum Learning by Transfer Learning: Theory and Experiments with Deep Networkscited by 113
- 2020Graph Optimal Transport for Cross-Domain Alignmentcited by 103
- 2020Cross-Domain Few-Shot Learning by Representation Fusioncited by 32
- 2018Generalizing Point Embeddings using the Wasserstein Space of Elliptical Distributionscited by 20
- 2019Learning Embeddings into Entropic Wasserstein Spacescited by 15
- 2020Representation Learning from Limited Educational Data with Crowdsourced Labelscited by 4
- 2018Privacy-preserving Stochastic Gradual Learningcited by 2
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Wasserstein Task Embedding for Measuring Task Similaritiescited by 25
- 2022Wasserstein Task Embedding for Measuring Task Similarities24 Aug 2022