- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes SimPlex-GT - a GNN/GT hybrid model designed for node classification in graphs with heterophily and mixed homophily/heterophily. The model consists of 2 information streams: one is a classic GCN, the other is based on attention to learnable semantic prototypes (which is more efficient than attention between all pairs of nodes common in GTs). The model uses late fusion for the two streams. The models is further enhanced with complementary filtering of features, prototype smoothing, and orthogonality regularization for stream fusion. Experiments are conducted on a number of node classification, graph classification, and node clustering benchmarks.
Critical strengths
The general approach of using semantic prototypes as a way to implement efficient and scalable global attention for GTs is interesting and might be useful.
Critical weaknesses
Motivation. The entire approach is motivated by the idea that standard GNNs do not perform well under heterophily or mixed homophily/heterophily. However, this idea is not correct: it has been shown many times in prior literature that classic message-passing GNNs perform perfectly fine on heterophilous graphs, typically outperforming heterophily-specific models [1-6]. The paper claims that "on heterophilic graphs, neighbors of v frequently carry labels different from v, so any local averaging contracts v’s representation toward an uninformative or actively misleading mean". However, standard GNNs or GTs do not even have access to nodes' labels - local averaging averages feature information, rather than label information, and dependencies between features and labels can be very complicated, and there can be a lot of useful information about nodes' labels in neighborhood features even in heterophilous graphs. Further, since the entire motivation of the approach is to design a model for learning under heterophily or mixed homophily/heterophily (which are properties of node classification datasets), it is not clear why the paper also conducts experiments on graph classification (where there are no node labels at all). If the approach indeed improves performance on graph classification, then surely there is a mismatch between the entire motivation of the paper and the actual inner workings of the model.
Further, there are several flaws in the experimental setup.
Datasets. The dataset selection for experimental evaluation is very poor. Most of the datasets used have been criticized many times. Most notably, standard citation networks (cora, citeseer, pubmed, ogbn-arxiv) have a lot of mislabeled nodes [7], texas, cornell, wisconsin are too small and do not have enough class representation [3], squirrel-filtered and chameleon-filtered were meant to demonstrate the flaws of the original squirrel and chameleon datasets, not to be used as new datasets [8]. Overall, there has recently been a lot of concern about graph machine learning papers using flawed and unreliable datasets [9, 10] and better benchmarks have been proposed [10, 11, 12]. Datasets from these benchmarks should be used instead of outdated and unreliable datasets used in this paper.
Baselines. It has been shown that classic GNNs like GCN and GAT achieve state-of-the-art results on node classification in heterophilous graphs when simple architetcural improvements like skip-connections, dropout, and normalizations are added to them [3, 5] and proper hyperparameter tuning is performed [5, 8]. These stronger implementations of classic models should be used as baselines. The numbers reported in this work for GCN and GAT show that weaker and/or untuned model implementations are used.
Overall, while the method proposed might be promising, its true benefits do not appear to be related to the provided motivation, and poor dataset and baseline selection for the experimental evaluation does not allow to reliably evaluate its performance compared to existing models.
[1] Is homophily a necessity for graph neural networks? (ICLR 2022)
[2] Revisiting heterophily for graph neural networks (NeurIPS 2022)
[3] A critical look at the evaluation of GNNs under heterophily: Are we really making progress? (ICLR 2023)
[4] Characterizing Graph Datasets for Node Classification: Homophily–Heterophily Dichotomy and Beyond (NeurIPS 2023)
[5] Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification (NeurIPS 2024)
[6] Oversmoothing, Oversquashing, Heterophily, Long-Range, and more: Demystifying Common Beliefs in Graph Machine Learning (ICLR 2026)
[7] GraphCleaner: Detecting Mislabelled Samples in Popular Graph Learning Benchmarks (ICML 2023)
[8] A Fair Evaluation of Graph Foundation Models for Node Property Prediction (2026)
[9] Graph Learning Will Lose Relevance Due To Poor Benchmarks (ICML 2025)
[10] GraphLand: Evaluating Graph Machine Learning Models on Diverse Industrial Data (NeurIPS 2025)
[11] GraphBench: Next-generation graph learning benchmarking (2025)
[12] Bridging Academia and Industry: A Comprehensive Benchmark for Attributed Graph Clustering (2026)
Questions for authors
Can the authors address the issues raised in weaknesses?