mlsanityData to 14 Oct 2026

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

arXiv 2609.33764 ↗First posted 27 Sep 2026cs.LG cs.AI cs.IRcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) perform well on homophilic graphs but struggle in heterophilic settings, where connected nodes often carry dissimilar labels. Existing evaluations typically compare architectures under a fixed node-feature representation, leaving unclear whether conclusions about heterophily robustness remain stable as the input representation changes. We address this question by constructing parallel feature variants of two large-scale heterophilic benchmarks, Roman-Empire and Amazon-Ratings, pairing each graph with representations ranging from static fastText vectors to contextual Transformer embeddings and evaluating seven GNN architectures across these representations. We find that the effect of representation varies across architectures: on Roman-Empire, the contextual gain ranges from 2.38 percentage points for GCN-sep to 13.67 points for GAT, with H2GCN gaining 8.77 points. On Amazon-Ratings, where node text is limited to short product titles, GAT improves by 6.78 points from fastText to MPNet, while GCN-sep changes by only 0.20 points. These results show that architectural performance is conditional on node representation: the same representation change can produce different magnitudes of performance gain across architectures, so architecture and representation cannot be treated as independent evaluation factors. A rank-correlation analysis on these two benchmarks further shows that the relative ordering of architectures remains highly stable across representations, isolating differential sensitivity, rather than ranking instability, as the primary effect.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 18 references that are in the map. First posted on arXiv 27 Sep 2026.

Builds on

14 of 18 references.

References · 14

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  5. 2017Graph Attention Networkscited by 8,923
  6. 2017Inductive Representation Learning on Large Graphscited by 6,320
  7. 2020MPNet: Masked and Permuted Pre-training for Language Understandingcited by 981
  8. 2020Simple and Deep Graph Convolutional Networkscited by 860
  9. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
  10. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 343
  11. 2018Learning Word Vectors for 157 Languagescited by 280
  12. 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
2 more
  1. 2021Simplifying approach to Node Classification in Graph Neural Networkscited by 56
  2. 2025HeTGB: A Comprehensive Benchmark for Heterophilic Text-Attributed Graphscited by 5

Built on by

Not cited yet.