PGADA: Perturbation-Guided Adversarial Alignment for Few-shot Learning Under the Support-Query Shift
Not on the map. Why?
Abstract (arXiv)
Few-shot learning methods aim to embed the data to a low-dimensional embedding space and then classify the unseen query data to the seen support set. While these works assume that the support set and the query set lie in the same embedding space, a distribution shift usually occurs between the support set and the query set, i.e., the Support-Query Shift, in the real world. Though optimal transportation has shown convincing results in aligning different distributions, we find that the small perturbations in the images would significantly misguide the optimal transportation and thus degrade the model performance. To relieve the misalignment, we first propose a novel adversarial data augmentation method, namely Perturbation-Guided Adversarial Alignment (PGADA), which generates the hard examples in a self-supervised manner. In addition, we introduce Regularized Optimal Transportation to derive a smooth optimal transportation plan. Extensive experiments on three benchmark datasets manifest that our framework significantly outperforms the eleven state-of-the-art methods on three datasets.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 36 references that are in the map. First posted on arXiv 8 May 2022.
Builds on
28 of 36 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2022Generative Adversarial Networkscited by 5,627
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2017Prototypical Networks for Few-shot Learningcited by 3,015
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,311
- 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,143
16 more
- 2018LEAF: A Benchmark for Federated Settingscited by 792
- 2019A Closer Look at Few-shot Classificationcited by 684
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2018Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Modelscited by 362
- 2017Few-Shot Learning with Graph Neural Networkscited by 324
- 2019Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examplescited by 315
- 2019A Baseline for Few-Shot Image Classificationcited by 298
- 2017Data Augmentation Generative Adversarial Networkscited by 278
- 2018Learning to Propagate Labels: Transductive Propagation Network for Few-shot Learningcited by 211
- 2018Generalized Zero- and Few-Shot Learning via Aligned Variational Autoencoderscited by 206
- 2018Low-Shot Learning from Imaginary Datacited by 181
- 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
- 2020Self-training for Few-shot Transfer Across Extreme Task Differencescited by 76
- 2020Transductive Information Maximization For Few-Shot Learningcited by 45
- 2020Domain-Adaptive Few-Shot Learningcited by 40
- 2021Bridging Few-Shot Learning and Adaptation: New Challenges of Support-Query Shiftcited by 9
Built on by
Citing papers per year: 2023: 1.
1 paper.