GIER: Addressing Class Imbalance in GNNs Through Experience Replay
Liu Yang, Chuyao Liu, Zidong Wang, Tingxuan Chen, Mengni Chen, Hongyu Zhang
Abstract
The prevalent class imbalance in real-world graphs significantly affects the performance of Graph Neural Networks (GNNs). Existing methods for analyzing graph imbalance ignore the influence of minority nodes during the dynamic model training process, resulting in performance limitations. In this paper, we focus on minority class information during model training, identifying and defining the minority class forgetting phenomenon that exists in graph imbalanced method training processes. To address this issue, we propose Graph Imbalance Experience Replay(GIER) framework. On one hand, the method enhances the model's ability to mine minority node information in historical data, thereby achieving feature completion for minority class nodes. On the other hand, the proposed short-term confidence mechanism allows the model to adaptively calibrate the topological relationships in high-confidence nodes, thereby mitigating the model's tendency to propagate erroneous information about minority classes during training. GIER is a unified framework consisting of two synergistic components: Long-term Subgraph Memory (LSM) constructs multi-period feature-representative subgraphs to address distribution imbalance, and Short-term Confidence Calibration (SCC) dynamically reconstructs graph topology through degree-aware node selection and confidence-based filtering to address topological imbalance. The extensive experimental results demonstrate that GIER effectively improves the classification performance of GNNs on imbalanced graphs, achieving up to a 3.44% improvement in BAcc over the state-of-the-art, and is particularly effective in extreme scenarios with very small minority classes.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 473f4e30-7e96-48e2-8661-08a131fdb074Builds on9
- Overcoming Catastrophic Forgetting in Graph Neural Networks with Experience ReplayFan Zhou, Chengtai CaoAAAI 2021 · 175 citations
- Topology-Imbalance Learning for Semi-Supervised Node ClassificationDeli Chen, Yankai Lin, Guangxiang Zhao, Xuancheng Ren et al.NeurIPS 2021 · 143 citations
- Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free DataXin Zheng, Miao Zhang, Chunyang Chen, Quoc Viet Hung Nguyen et al.NeurIPS 2023 · 115 citations
- GraphSR: A Data Augmentation Algorithm for Imbalanced Node ClassificationMengting Zhou, Zhiguo GongAAAI 2023 · 48 citations
- Class-Imbalanced Graph Learning without Class RebalancingZhining Liu, Ruizhong Qiu, Zhichen Zeng, Hyunsik Yoo et al.ICML 2024 · 35 citations
Related papers
- GraphENS: Neighbor-Aware Ego Network Synthesis for Class-Imbalanced Node ClassificationJoonhyung Park, Jaeyun Song, Eunho YangICLR 2022 · 145 citations
- Cluster-guided Contrastive Class-imbalanced Graph ClassificationWei Ju, Zhengyang Mao, Siyu Yi, Yifang Qin et al.AAAI 2025 · 6 citations
- When Imbalance Meets Imbalance: Structure-driven Learning for Imbalanced Graph ClassificationWei Xu, Pengkun Wang, Zhe Zhao, Binwu Wang et al.WWW 2024 · 19 citations
- ImGAGN: Imbalanced Network Embedding via Generative Adversarial Graph NetworksLiang Qu, Huaisheng Zhu, Ruiqi Zheng, Yuhui Shi et al.KDD 2021 · 103 citations
- SamGoG: A Sampling-Based Graph-of-Graphs Framework for Imbalanced Graph ClassificationShangyou Wang, Zezhong Ding, Xike XieKDD 2026
