Skip to content

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

Sep 2026 · IEEE Transactions on Pattern Analysis and Machine Intelligence · Vol PP · 0 citations
Medicine

TL;DR

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.

Abstract

Graph Neural Networks (GNNs) have achieved strong performance in node classification, yet their performance often drops when facing graph distribution shifts between training and testing nodes. Existing methods have been explored to improve generalization under such shifts. However, many of them either rely on environment annotations or do not fully use graph topology, structural noise information, and uncertainty from unlabeled nodes. To address these challenges, we propose Topology-Aware Dynamic Reweighting (TAR+), a model-agnostic framework for node classification under strict graph distribution shifts and related robustness stressors. TAR+ formulates sample reweighting as a gradient flow in graph Wasserstein space, allowing node weights to depend on both prediction difficulty and graph topology. A structure-aware Huber penalty limits the influence of nodes whose losses are inconsistent with structurally related neighbors, while prediction entropy provides node-specific proxy losses for unlabeled nodes. Graph extrapolation further exposes the model to perturbed structures and features. We further provide a free-energy interpretation of the reweighting dynamics and show that each variational step admits a local distributionally robust optimization interpretation. Experiments cover covariate and concept shifts as well as noisy supervision, heterophily, class imbalance, label scarcity, unsupervised learning, and graph anomaly detection. TAR+ achieves competitive performance across these settings, supporting the broad applicability of topology-aware reweighting across heterogeneous graph learning conditions.

View source

Similar papers

#graph neural networks Open access Sep 2026

Topology-aware GNNs under structural perturbations: Empirical robustness across domains

Results support a conditional empirical conclusion: combining structure, topology, and stability-oriented training can improve robustness under specified structural perturbations, with dataset-dependent accuracy–stability trade-offs rather than universal guarantees.

Jelena Losic, Charles Fanning · 0 citations

Message Passing Does More with Less for In-Context Learning on Graphs

Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeated costs and effort. Graph in-context learning (ICL) avoids this by using a single pretrained model to predict unknown node labels directly from labeled context nodes. E...

Dooho Lee, Jin-Mo Lee, Minho Jeong et al. · 0 citations
Open access Oct 2026

Decoupled Feature Propagation and Structural Boosting: A Robust Framework for Node Classification on Heterophilous Graphs

Standard Graph Neural Networks (GNNs) frequently struggle with heterophilous structures where local proximity does not imply label similarity, leading to significant performance degradation due to signal oversmoothing. This study aimed to bridge the gap between theoretical complexity and empirical reliability by propos...

Heru Ismanto, Izak Habel Wayangkau · 0 citations
#machine learning Preprint Aug 2026

Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding

Experiments show that incorporating NC-LID-based regularization consistently improves reconstruction performance over the baseline without structural regularization and the method using hub-aware regularization, which highlights NC-LID as a useful structural signal for enhancing distance-based graph autoencoders in dyn...

Aleksandar Tomčić, Milos Savic, Milos Radovanovic · 0 citations
Conference Open access Sep 2026

Mitigating Dynamic Graph Distribution Shifts via Spectral Augmentation

This paper proposes a spectral-based graph augmentation framework designed to investigate and improve generalization behavior in dynamic graphs under distribution shifts and develops a multi-encoder architecture in which each encoder targets a specific spectral shift component to generate referential representations.

Qian-Yu Song, Chao Li, Zhongying Zhao et al. · 0 citations
Conference Open access Sep 2026

ADC-GNN: Adaptive Dual-level Collaborative Graph Neural Networks for Graph Classification

This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.

Wan Tang, Lu Bai, Li-Xin Cui et al. · 0 citations

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