AdarGCN: Adaptive Aggregation GCN for Few-Shot Learning

Jianhong Zhang, Manli Zhang, Zhiwu Lu, Tao Xiang

Abstract

Few-Shot Learning (FSL) often suffers from data scarcity in the source domain, particularly in fine-grained classification tasks. While web-crawled data can supplement training sets, it introduces significant noise. This paper proposes AdarGCN, a Graph Convolutional Network (GCN) architecture utilizing adaptive, multi-level aggregation to filter noise and prevent over-smoothing. By dynamically weighting information propagation across different neighborhood scales, AdarGCN achieves state-of-the-art performance on benchmarks like mini-ImageNet and CUB.

Introduction

Standard Few-Shot Learning assumes abundant "source" classes for pre-training. However, in specialized domains like fine-grained bird recognition, even source data is limited—a problem termed Scarce-Source Few-Shot Learning (SSFSL). Web crawling offers a solution but brings "noisy" data (e.g., irrelevant images). Traditional GCNs propagate this noise indiscriminately and suffer from over-smoothing in deeper layers, where node features become indistinguishable. AdarGCN addresses these issues by automatically learning how far information should propagate between nodes.

Methodology

The AdarGCN framework operates in a two-stage process designed to leverage noisy web data effectively.

The overall AdarGCN framework, illustrating the pipeline from web image crawling to label denoising and final few-shot classification.

Two-Stage Framework

  1. Stage 1 (Label Denoising - LDN): AdarGCN is first used to classify web-crawled images as "relevant" or "irrelevant" to clean the dataset.
  2. Stage 2 (Few-Shot Learning): The cleaned images are merged with the original data, and a second AdarGCN is trained to perform the final classification task.

Adaptive Aggregation Mechanism

The core innovation is the Adaptive Aggregation module within the GCN layers. Unlike fixed neighborhood updates, AdarGCN employs parallel branches to aggregate information at varying scales:

  • Branch c: Self-features (0-hop).
  • Branch b: Immediate neighbors (1-hop).
  • Branch d: Extended neighborhood (2-hop).
Detailed architecture of the GCN inner block, showing the multi-branch adaptive aggregation (NU) and edge updating (EU) modules.

A learnable gating mechanism assigns weights to these branches for every node. This allows the model to "quarantine" noisy nodes by prioritizing their own features over neighborhood information, effectively acting as a spatial filter.

Key Results

AdarGCN was evaluated on mini-ImageNet and the CUB (Caltech-UCSD Birds-200-2011) fine-grained dataset.

  • Label Denoising: On mini-ImageNet with only 10 clean samples, AdarGCN achieved 63.37% accuracy, significantly outperforming standard GCNs (61.22%) and Label Propagation (60.21%).
  • Conventional FSL: Even without web-crawling, AdarGCN sets a new state-of-the-art for GCN-based few-shot learning. On mini-ImageNet (5-way, 5-shot), it reached 71.48% accuracy, beating previous GCN methods like EGCN (66.85%).
  • Fine-Grained Success: On the CUB dataset, the model achieved 78.04% accuracy in the 5-shot setting.

Discussion and Conclusion

AdarGCN effectively addresses the SSFSL problem by treating aggregation depth as a learnable parameter. Its architecture mitigates over-smoothing, allowing for deeper GCNs (up to 7 layers) that maintain high performance. While the multi-head structure adds computational complexity, the gains in robustness to web noise make it a powerful tool for data-scarce scenarios. Future work may explore applying this adaptive logic to other graph-based tasks like recommendation systems or social network analysis.

Summary updated

Abstract

Existing few-shot learning (FSL) methods assume that there exist sufficient training samples from source classes for knowledge transfer to target classes with few training samples. However, this assumption is often invalid, especially when it comes to fine-grained recognition. In this work, we define a new FSL setting termed few-shot fewshot learning (FSFSL), under which both the source and target classes have limited training samples. To overcome the source class data scarcity problem, a natural option is to crawl images from the web with class names as search keywords. However, the crawled images are inevitably corrupted by large amount of noise (irrelevant images) and thus may harm the performance. To address this problem, we propose a graph convolutional network (GCN)-based label denoising (LDN) method to remove the irrelevant images. Further, with the cleaned web images as well as the original clean training images, we propose a GCN-based FSL method. For both the LDN and FSL tasks, a novel adaptive aggregation GCN (AdarGCN) model is proposed, which differs from existing GCN models in that adaptive aggregation is performed based on a multi-head multi-level aggregation module. With AdarGCN, how much and how far information carried by each graph node is propagated in the graph structure can be determined automatically, therefore alleviating the effects of both noisy and outlying training samples. Extensive experiments show the superior performance of our AdarGCN under both the new FSFSL and the conventional FSL settings.
BibTeX
@inproceedings{zhang2021adargcn,
  author = {Jianhong Zhang and Manli Zhang and Zhiwu Lu and Tao Xiang},
  title = {{AdarGCN: Adaptive Aggregation GCN for Few-Shot Learning}},
  booktitle = {IEEE/CVF Winter Conference on Applications of Computer Vision},
  year = {2021},
  doi = {10.1109/wacv48630.2021.00352},
}
Figure