Imbalanced graph learning via mixed entropy minimization

Abstract

Abstract Imbalanced datasets, where the minority class is underrepresented, pose significant challenges for node classification in graph learning. Traditional methods often address this issue through synthetic oversampling techniques for the minority class, which can complicate the training process. To address these challenges, we introduce a novel training paradigm for node classification on imbalanced graphs, based on mixed entropy minimization (ME). Our proposed method, GraphME, offers a ‘free imbalance defense’ against class imbalance without requiring additional steps to improve classification performance. ME aims to achieve the same goal as cross-entropy-maximizing the model’s probability for the correct classes-while effectively reducing the impact of incorrect class probabilities through a “guidance” term that ensures a balanced trade-off. We validate the effectiveness of our approach through experiments on multiple datasets, where GraphME consistently outperforms the traditional cross-entropy objective, demonstrating enhanced robustness. Moreover, our method can be seamlessly integrated with various adversarial training techniques, leading to substantial improvements in robustness. Notably, GraphME enhances classification accuracy without compromising efficiency, a significant improvement over existing methods. The GraphME code is available at: https://github.com/12chen20/GraphME .

Keywords

• Imbalanced node classification
• Mixed entropy minimization (ME)
• Graph learning