Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classification
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) have shown superior performance in node classification. However, GNNs perform poorly in the Few-Shot Node Classification (FSNC) task that requires robust generalization to make accurate predictions for unseen classes with limited labels. To tackle the challenge, we propose the integration of Sharpness-Aware Minimization (SAM)--a technique designed to enhance model generalization by finding a flat minimum of the loss landscape--into GNN training. The standard SAM approach, however, consists of two forward-backward steps in each training iteration, doubling the computational cost compared to the base optimizer (e.g., Adam). To mitigate this drawback, we introduce a novel algorithm, Fast Graph Sharpness-Aware Minimization (FGSAM), that integrates the rapid training of Multi-Layer Perceptrons (MLPs) with the superior performance of GNNs. Specifically, we utilize GNNs for parameter perturbation while employing MLPs to minimize the perturbed loss so that we can find a flat minimum with good generalization more efficiently. Moreover, our method reutilizes the gradient from the perturbation phase to incorporate graph topology into the minimization process at almost zero additional cost. To further enhance training efficiency, we develop FGSAM+ that executes exact perturbations periodically. Extensive experiments demonstrate that our proposed algorithm outperforms the standard SAM with lower computational costs in FSNC tasks. In particular, our FGSAM+ as a SAM variant offers a faster optimization than the base optimizer in most cases. In addition to FSNC, our proposed methods also demonstrate competitive performance in the standard node classification task for heterophilic graphs, highlighting the broad applicability. The code is available at https://github.com/draym28/FGSAM_NeurIPS24.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 35 of its 44 references that are in the map. First posted on arXiv 22 Oct 2024.
Builds on
35 of 44 references.
References · 35
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2016Least Squares Generative Adversarial Networkscited by 1,001
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
23 more
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2019Multi-scale Attributed Node Embeddingcited by 548
- 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 464
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 172
- 2023GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networkscited by 167
- 2023All in One: Multi-task Prompting for Graph Neural Networkscited by 148
- 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
- 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
- 2019Meta-GNN: On Few-shot Node Classification in Graph Meta-learningcited by 105
- 2022Sharpness-Aware Training for Freecited by 95
- 2020Graph Prototypical Networks for Few-shot Learning on Attributed Networkscited by 90
- 2021Few-Shot Graph Learning for Molecular Property Predictioncited by 81
- 2022Sharp-MAML: Sharpness-Aware Model-Agnostic Meta Learningcited by 58
- 2022Task-Adaptive Few-shot Node Classificationcited by 43
- 2023An Adaptive Policy to Employ Sharpness-Aware Minimizationcited by 43
- 2022Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPscited by 42
- 2022MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initializationcited by 31
- 2022Transductive Linear Probing: A Novel Framework for Few-Shot Node Classificationcited by 24
- 2022Adversarial Weight Perturbation Improves Generalization in Graph Neural Networkscited by 21
- 2023LSGNN: Towards General Graph Neural Network in Node Classification by Local Similaritycited by 15
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Decoupled Graph Energy-based Model for Node Out-of-Distribution Detection on Heterophilic Graphscited by 9
- 2026EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrievalcited by 2
- 2025Wide & Deep Learning for Node Classificationcited by 1
- 2025Mitigating Structural Overfitting: A Distribution-Aware Rectification Framework for Missing Feature Imputationcited by 0
- 2026EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval19 Apr 2026
- 2025Mitigating Structural Overfitting: A Distribution-Aware Rectification Framework for Missing Feature Imputation6 Dec 2025
- 2025Wide & Deep Learning for Node Classification4 May 2025
- 2025Decoupled Graph Energy-based Model for Node Out-of-Distribution Detection on Heterophilic Graphs25 Feb 2025