SOTAVerified

Node Classification on Non-Homophilic (Heterophilic) Graphs

There exists a non-trivial set of graphs where graph-aware models underperform their corresponding graph-agnostic models, e.g. SGC and GCN underperform MLP with 1 layer and 2 layers. Although still controversial, people believe the performance degradation results from heterophily, i.e. there exist much more inter-class edges than inner-class edges. This task aims to evaluate models designed for non-homophilic (heterophilic) datasets.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 1–29 of 29 papers

TitleStatusHype
Scale Invariance of Graph Neural NetworksCode0
Edge Directionality Improves Learning on Heterophilic GraphsCode1
Addressing Heterophily in Node Classification with Graph Echo State NetworksCode0
GCNH: A Simple Method For Representation Learning On Heterophilous GraphsCode1
Graph Neural Networks with Learnable and Optimal Polynomial BasesCode1
Clenshaw Graph Neural NetworksCode1
Revisiting Heterophily For Graph Neural NetworksCode1
Finding Global Homophily in Graph Neural Networks When Meeting HeterophilyCode1
Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNsCode1
Deformable Graph Convolutional NetworksCode1
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple MethodsCode1
BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein ApproximationCode1
Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing PatternsCode1
New Benchmarks for Learning on Non-Homophilous GraphsCode1
Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural NetworksCode1
Beyond Low-frequency Information in Graph Convolutional NetworksCode1
Combining Label Propagation and Simple Models Out-performs Graph Neural NetworksCode1
Simple and Deep Graph Convolutional NetworksCode1
Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsCode1
Adaptive Universal Generalized PageRank Graph Neural NetworkCode1
Non-Local Graph Neural NetworksCode1
Geom-GCN: Geometric Graph Convolutional NetworksCode1
Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional NetworksCode0
MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood MixingCode0
Simplifying Graph Convolutional NetworksCode1
Predict then Propagate: Graph Neural Networks meet Personalized PageRankCode0
Graph Attention NetworksCode1
Inductive Representation Learning on Large GraphsCode1
Semi-Supervised Classification with Graph Convolutional NetworksCode1
Show:102550

No leaderboard results yet.