cs.LGSep 26, 2026

HoTS: Homophily-Aware Temperature Scaling for Graph Neural Network Calibration

Authors: Inwoo Tae, Yoontae Hwang, Yongjae Lee

Organizations: UNIST · Pusan National University · UNIST LinqAlpha

Abstract

For graph node classification, calibrated class probabilities are needed when confidence scores, usually the maximum predicted class probability, are used to rank predictions, defer uncertain nodes to human review, or control risk. Existing post-hoc calibrators either apply one global temperature or use graph-aware modules without a principled structural form. We study how local graph structure should enter node-level calibration. Our first results show that a logit-only temperature rule is insufficient when nodes with identical logits but different local homophily require different optimal temperatures. We then analyze a population-concentration contextual stochastic block model with Gaussian features and a one-layer linear GCN. Under equidistant class means, the Bayes posterior over class-template scores is a temperature-scaled softmax whose inverse-temperature is governed by a homophily-dependent signal strength. In the positive-signal homophilic regime, the resulting temperature decreases approximately inversely with normalized local homophily. This law motivates Homophily-aware Temperature Scaling (HoTS), a simple post-hoc calibrator that assigns each node a positive scalar temperature from entropy-based logit concentration and estimated local homophily. HoTS has three temperature parameters, preserves the predicted class, and learns the strength of the structural correction from calibration data. Across 18 node-classification benchmarks, two GNN backbones, and eight calibration baselines, HoTS achieves the best mean Expected Calibration Error (ECE) of 4.79%, the best average rank, and the most reliable confidence ranking in selective classification. Code is available at https://github.com/inu0104/HoTS.

Figures & tables

Appendix figures & tables20 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. When does distribution shift break graph neural networks calibration?

    Jul 12, 2026Abderaouf BahiGraph Neural NetworksModel Calibration

  2. Disentangling Homophily and Rarity: Explaining Failure in Graph Neural Networks

    Aug 14, 2026Preben M. Ness, Fariz Ikhwantri, Dusica MarijanGraph Neural NetworksNode Classification

  3. Not All Nodes Are Created Equal: Homophily-Aware Stratification for Stable GNN Evaluation

    Sep 16, 2026Naga Venkata Sai Jitin Jami, Thomas Altstidl, Sebastian Hoefler +4Graph Neural NetworksNode Classification