AbstainGNN: Teaching Graph Neural Networks to Abstain for Graph Classification
Xixun Lin, Zhiheng Zhou, Zhengyin Zhang, Yancheng Chen, Shuai Zhang, Ge Zhang, Shichao Zhu, Lixin Zou, Chuan Zhou, Peng Zhang, Shirui Pan, Yanan Cao
Abstract
Graph classification is a core task in graph data mining with widespread real-world applications. Recent advances in graph neural networks (GNNs) have led to substantial performance improvements for graph classification. However, existing GNNs are typically forced to make predictions even under high uncertainty or unknown conditions, resulting in unreliable decisions that can severely impact downstream tasks, particularly in safety-critical scenarios. To address this critical limitation, we propose AbstainGNN, a novel and theory-driven framework for graph classification with abstention, which enables GNNs to reject uncertain predictions instead of producing incorrect decisions. Specifically, AbstainGNN explicitly models both the predictive function and the abstention function, allowing for effective utilization of graph structural information. Moreover, unlike existing heuristic abstention methods, we theoretically characterize the trade-off between classification errors and rejection costs from a PAC-Bayesian generalization perspective, and derive a unified learning objective for model optimization. Guided by this theoretical insight, we further develop an efficient two-stage training strategy consisting of predictive function warm-start and abstention function calibration. Extensive experiments on five benchmark datasets show that AbstainGNN outperforms existing abstention methods, achieving superior classification performance under the same rejection rates.
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 0923ead0-d0ff-414c-a915-4acf762fb17eBuilds on10
- A Fair Comparison of Graph Neural Networks for Graph ClassificationFederico Errica, Marco Podda, Davide Bacciu, Alessio MicheliICLR 2020 · 508 citations
- Weisfeiler and Lehman Go Topological: Message Passing Simplicial NetworksCristian Bodnar, Fabrizio Frasca, Yuguang Wang, Nina Otter et al.ICML 2021 · 315 citations
- Self-Adaptive Training: beyond Empirical Risk MinimizationLang Huang, Chao Zhang, Hongyang ZhangNeurIPS 2020 · 256 citations
- Rethinking pooling in graph neural networksDiego Mesquita, Amauri H. Souza Jr., Samuel KaskiNeurIPS 2020 · 147 citations
- Classification with Rejection Based on Cost-sensitive ClassificationNontawat Charoenphakdee, Zhenghang Cui, Yivan Zhang, Masashi SugiyamaICML 2021 · 78 citations
Related papers
- Better with Less: A Data-Active Perspective on Pre-Training Graph Neural NetworksJiarong Xu, Renhong Huang, Xin Jiang, Yuxuan Cao et al.NeurIPS 2023 · 26 citations
- Uncertainty-Matching Graph Neural Networks to Defend Against Poisoning AttacksUday Shankar Shanthamallu, Jayaraman J. Thiagarajan, Andreas SpaniasAAAI 2021 · 19 citations
- Distribution Free Prediction Sets for Node ClassificationJase ClarksonICML 2023 · 30 citations
- Balanced Confidence Calibration for Graph Neural NetworksHao Yang, Min Wang, Qi Wang, Mingrui Lao et al.KDD 2024 · 3 citations
- Graph Stochastic Neural Networks for Semi-supervised LearningHaibo Wang, Chuan Zhou, Xin Chen, Jia Wu et al.NeurIPS 2020 · 44 citations
