用赫林距离增强注意力聚合,让少样本分类更抗干扰。
ANROT-HELANet: Adverserially and Naturally Robust Attention-Based Aggregation Network via The Hellinger Distance for Few-Shot Classification
- 基于赫林距离设计鲁棒特征聚合,结合注意力机制
- 在ε=0.30扰动下仍保持性能,1-shot/5-shot提升1.20%/1.40%
- 适合需要高鲁棒性的少样本学习场景
少样本学习(FSL)通过少量样本实现泛化,表现优于传统CNN。尽管基于贝叶斯估计与KL散度的方法有所改进,但仍易受对抗攻击和自然噪声影响。本文提出ANROT-HELANet,一种基于赫林距离的对抗与自然鲁棒性特征聚合网络,在对抗扰动ε=0.30和高斯噪声σ=0.30下保持稳定。该方法在miniImageNet上1-shot和5-shot分别提升1.20%和1.40%。引入新型赫林相似性对比损失,适用于变分少样本推理。图像重建FID达2.75,优于VAE(3.43)和WAE(3.38)。在四个基准数据集上验证,其组合策略达成新SOTA,兼具性能与鲁棒性。代码开源于https://github.com/GreedYLearner1146/ANROT-HELANet/tree/main。
原文摘要 · Abstract (English)
Few-Shot Learning (FSL), which involves learning to generalize using only a few data samples, has demonstrated promising and superior performances to ordinary CNN methods. While Bayesian based estimation approaches using Kullback-Leibler (KL) divergence have shown improvements, they remain vulnerable to adversarial attacks and natural noises. We introduce ANROT-HELANet, an Adversarially and Naturally RObusT Hellinger Aggregation Network that significantly advances the state-of-the-art in FSL robustness and performance. Our approach implements an adversarially and naturally robust Hellinger distance-based feature class aggregation scheme, demonstrating resilience to adversarial perturbations up to $ε=0.30$ and Gaussian noise up to $σ=0.30$. The network achieves substantial improvements across benchmark datasets, including gains of 1.20\% and 1.40\% for 1-shot and 5-shot scenarios on miniImageNet respectively. We introduce a novel Hellinger Similarity contrastive loss function that generalizes cosine similarity contrastive loss for variational few-shot inference scenarios. Our approach also achieves superior image reconstruction quality with a FID score of 2.75, outperforming traditional VAE (3.43) and WAE (3.38) approaches. Extensive experiments conducted on four few-shot benchmarked datasets verify that ANROT-HELANet's combination of Hellinger distance-based feature aggregation, attention mechanisms, and our novel loss function establishes new state-of-the-art performance while maintaining robustness against both adversarial and natural perturbations. Our code repository will be available at https://github.com/GreedYLearner1146/ANROT-HELANet/tree/main.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。