Skip to content

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

Sep 2026 · 0 citations · 39 references
Computer Science

TL;DR

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, achieves the best mean Expected Calibration Error (ECE) of 4.79%, the best average rank, and the most reliable confidence ranking in selective classification.

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.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

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

Graph neural networks are widely used for transductive node classification, with accuracy typically measured on randomly drawn train/validation/test splits. Reported accuracy has been shown to shift substantially across different random splits of the same dataset, making published comparisons between architectures unre...

Naga Venkata Sai Jitin Jami, Thomas R. Altstidl, S. Hoefler et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Beyond Fixed Features: Architecture-Dependent Sensitivity to Node Representations under Heterophily

Graph Neural Networks perform well on homophilic graphs but struggle in heterophilic settings, where connected nodes often carry dissimilar labels, so architecture and representation cannot be treated as independent evaluation factors.

Priyanath Maji, Sidharth Gaur, Rajavinoth Paul Durai · 0 citations
#graph neural networks Open access Sep 2026

Preserving the Motif-Relevant Structure in Graph Neural Networks: An Entropy-Aware Study of Aggregation and Depth

Graph neural networks have shown strong potential for learning structural representations of biological networks. However, repeated message passing may blur local structural signals that are relevant for motif- and graphlet-based analysis. This paper investigates multilabel graphlet classification in protein–protein in...

Lidija Kunst, Friedhelm Schwenker, H. Kestler · 0 citations

Heterophily-Aware Node Classification in Multiplex Graphs

This work proposes HAAM, an adaptive node classification approach for multiplex graphs that models per-dimension degrees of homophily and heterophily through dimension-specific compatibility matrices, and shows that HAAM achieves competitive performance compared to representative baseline methods.

K. Abdous, Nairouz Mrabah, Mohamed Bouguessa · 0 citations
Sep 2026

Generalizing on Diverse Shifts: A Unified Topology-Aware Reweighting Algorithm for Graphs.

Topology-Aware Dynamic Reweighting (TAR+), a model-agnostic framework for node classification under strict graph distribution shifts and related robustness stressors, is proposed, supporting the broad applicability of topology-aware reweighting across heterogeneous graph learning conditions.

Jia-Xing Li, Jia-Shuo Liu, Wei-Huang Zheng et al. · 0 citations
#machine learning Preprint Sep 2026

Learning the Graph and the Embedding Together: Classifier-Independent Rewiring for Heterophilic Node Classification

An affinity-guided rewiring method that estimates the graph and the node representation together and alternates, in the spirit of expectation maximisation, between training a lightweight graph neural network on the current graph and re-weighting candidate edges under a modularity objective with a pseudo-label homophily...

Harshit Kumar, Sujan Chakraborty, Priyanka Saha et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.