REVIEW 4 cited by
New Benchmarks for Learning on Non-Homophilous Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Much data with graph structures satisfy the principle of homophily, meaning that connected nodes tend to be similar with respect to a specific attribute. As such, ubiquitous datasets for graph machine learning tasks have generally been highly homophilous, rewarding methods that leverage homophily as an inductive bias. Recent work has pointed out this particular focus, as new non-homophilous datasets have been introduced and graph representation learning models better suited for low-homophily settings have been developed. However, these datasets are small and poorly suited to truly testing the effectiveness of new methods in non-homophilous settings. We present a series of improved graph datasets with node label relationships that do not satisfy the homophily principle. Along with this, we introduce a new measure of the presence or absence of homophily that is better suited than existing measures in different regimes. We benchmark a range of simple methods and graph neural networks across our proposed datasets, drawing new insights for further research. Data and codes can be found at https://github.com/CUAI/Non-Homophily-Benchmarks.
Forward citations
Cited by 4 Pith papers
-
Effects of Dropout on Performance in Long-range Graph Learning Tasks
Edge-dropping methods like DropEdge reduce sensitivity between distant nodes in GNNs, harming long-range task performance, and a sensitivity-aware variant called DropSens partially restores it.
-
Lorentzian Residual Neural Networks
LResNet performs hyperbolic residual connections with a normalized weighted sum (the Lorentzian centroid), avoiding tangent-space mappings and improving efficiency and accuracy in hyperbolic GNNs, graph transformers, ...
-
Partitioning Message Passing for Graph Fraud Detection
PMP partitions message passing by neighbor label and generates node-specific weights, reporting strong fraud detection results but with an invalid spectral proof.
-
Graph as a feature: improving node classification with non-neural graph-aware logistic regression
Graph-aware Logistic Regression, a linear classifier on node features concatenated with each node's adjacency row, ranks first on average across 13 node classification datasets, ahead of eight GNN baselines.
Discussion (0). Continue with ORCID to comment.