Robust Few-shot Learning Without Using any Adversarial Samples
Not on the map. Why?
Abstract (arXiv)
The high cost of acquiring and annotating samples has made the `few-shot' learning problem of prime importance. Existing works mainly focus on improving performance on clean data and overlook robustness concerns on the data perturbed with adversarial noise. Recently, a few efforts have been made to combine the few-shot problem with the robustness objective using sophisticated Meta-Learning techniques. These methods rely on the generation of adversarial samples in every episode of training, which further adds a computational burden. To avoid such time-consuming and complicated procedures, we propose a simple but effective alternative that does not require any adversarial samples. Inspired by the cognitive decision-making process in humans, we enforce high-level feature matching between the base class data and their corresponding low-frequency samples in the pretraining stage via self distillation. The model is then fine-tuned on the samples of novel classes where we additionally improve the discriminability of low-frequency query set features via cosine similarity. On a 1-shot setting of the CIFAR-FS dataset, our method yields a massive improvement of 60.55% & 62.05% in adversarial accuracy on the PGD and state-of-the-art Auto Attack, respectively, with a minor drop in clean accuracy compared to the baseline. Moreover, our method only takes 1.69× of the standard training time while being ≈ 5× faster than state-of-the-art adversarial meta-learning methods. The code is available at https://github.com/vcl-iisc/robust-few-shot-learning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 31 of its 51 references that are in the map. First posted on arXiv 3 Nov 2022.
Builds on
31 of 51 references.
References · 31
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2016Wide Residual Networkscited by 3,070
- 2017Prototypical Networks for Few-shot Learningcited by 3,015
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,143
- 2019A Closer Look at Few-shot Classificationcited by 684
- 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 497
19 more
- 2019Meta-Learning with Differentiable Convex Optimizationcited by 461
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 416
- 2018Meta-learning with differentiable closed-form solverscited by 397
- 2019High Frequency Component Helps Explain the Generalization of Convolutional Neural Networkscited by 310
- 2019A Baseline for Few-Shot Image Classificationcited by 298
- 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 297
- 2019Are Labels Required for Improving Adversarial Robustness?cited by 163
- 2021Revisiting Adversarial Robustness Distillation: Robust Soft Labels Make Student Bettercited by 79
- 2019Jacobian Adversarially Regularized Networks for Robustnesscited by 40
- 2017Adversarial Example Defenses: Ensembles of Weak Defenses are not Strongcited by 32
- 2020Towards Frequency-Based Explanation for Robust CNNcited by 29
- 2018Adversarial Meta-Learningcited by 16
- 2019Improving Adversarial Robustness via Guided Complement Entropycited by 15
- 2020Towards Achieving Adversarial Robustness by Enforcing Feature Consistency Across Bit Planescited by 15
- 2019Mimic and Fool: A Task Agnostic Adversarial Attackcited by 11
- 2020Finding Physical Adversarial Examples for Autonomous Driving with Fast and Differentiable Image Compositingcited by 10
- 2022InfoAT: Improving Adversarial Training Using the Information Bottleneck Principlecited by 7
- 2021Long-term Cross Adversarial Training: A Robust Meta-learning Method for Few-shot Classification Taskscited by 4
- 2022A Simple Approach to Adversarial Robustness in Few-shot Image Classificationcited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Enabling Validation for Robust Few-Shot Recognition
- 2022Towards Alternative Techniques for Improving Adversarial Robustness: Analysis of Adversarial Training at a Spectrum of Perturbations
- 2026Learning Better Certified Models from Empirically-Robust Teachers
- 2023Adversarial Examples Are Not Real Features
- 2026Learning Robustness at Test-Time from a Non-Robust Teacher
- 2024Unsupervised Meta-Learning via Dynamic Head and Heterogeneous Task Construction for Few-Shot Classification
- 2024Few-Shot Adversarial Prompt Learning on Vision-Language Models
- 2026Toward Understanding Adversarial Distillation: Why Robust Teachers Fail