LGAIJun 30, 2025

WATS: Calibrating Graph Neural Networks with Wavelet-Aware Temperature Scaling

arXiv:2506.23782v2h-index: 14
Originality Highly original
AI Analysis

This work addresses calibration issues in GNNs for safety-critical domains, representing a novel method for a known bottleneck rather than a fundamental breakthrough.

The paper tackles the problem of miscalibrated confidence estimates in Graph Neural Networks (GNNs), which limits their deployment in safety-critical applications, by proposing Wavelet-Aware Temperature Scaling (WATS), a post-hoc calibration framework that reduces Expected Calibration Error (ECE) by up to 42.3% compared to baselines and lowers calibration variance by 17.24% on average.

Graph Neural Networks (GNNs) have demonstrated strong predictive performance on relational data; however, their confidence estimates often misalign with actual predictive correctness, posing significant limitations for deployment in safety-critical settings. While existing graph-aware calibration methods seek to mitigate this limitation, they primarily depend on coarse one-hop statistics, such as neighbor-predicted confidence, or latent node embeddings, thereby neglecting the fine-grained structural heterogeneity inherent in graph topology. In this work, we propose Wavelet-Aware Temperature Scaling (WATS), a post-hoc calibration framework that assigns node-specific temperatures based on tunable heat-kernel graph wavelet features. Specifically, WATS harnesses the scalability and topology sensitivity of graph wavelets to refine confidence estimates, all without necessitating model retraining or access to neighboring logits or predictions. Extensive evaluations across seven benchmark datasets with varying graph structures and two GNN backbones demonstrate that WATS achieves the lowest Expected Calibration Error (ECE) among all compared methods, outperforming both classical and graph-specific baselines by up to 42.3\% in ECE and reducing calibration variance by 17.24\% on average compared with graph-specific methods. Moreover, WATS remains computationally efficient, scaling well across graphs of diverse sizes and densities. Code will be released based on publication.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes