Pith. sign in

REVIEW 3 cited by

A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions

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

arxiv 2401.09769 v4 pith:BSLGRDE5 submitted 2024-01-18 cs.SI cs.AIcs.LG

classification cs.SIcs.AIcs.LG
keywords graphsheterophilylearningexistinggraphsurveyapplicationsbenchmark
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graphs are structured data that models complex relations between real-world entities. Heterophilic graphs, where linked nodes are prone to be with different labels or dissimilar features, have recently attracted significant attention and found many real-world applications. Meanwhile, increasing efforts have been made to advance learning from graphs with heterophily. Various graph heterophily measures, benchmark datasets, and learning paradigms are emerging rapidly. In this survey, we comprehensively review existing works on learning from graphs with heterophily. First, we overview over 500 publications, of which more than 340 are directly related to heterophilic graphs. After that, we survey existing metrics of graph heterophily and list recent benchmark datasets. Further, we systematically categorize existing methods based on a hierarchical taxonomy including GNN models, learning paradigms and practical applications. In addition, broader topics related to graph heterophily are also included. Finally, we discuss the primary challenges of existing studies and highlight promising avenues for future research.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement

    cs.LG 2026-07 conditional novelty 6.0 of 10

    ACE adds a heterophily-aware auxiliary loss to coarsening-based GNN training, recovering discarded node-level information and improving accuracy on heterophilic graphs by up to ~15 points.

  2. Dynamic Triangulation-Based Graph Rewiring for Graph Neural Networks

    cs.LG 2025-08 conditional novelty 6.0 of 10

    A learned triangle-selection module rewires graphs for GNNs, improving node classification over prior rewiring methods on 9 of 10 benchmarks.

  3. Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A partition-wise graph filtering method, CPF, unifies graph-wise and node-wise filtering and achieves state-of-the-art node classification on 13 benchmark graphs and anomaly detection on 3 datasets.

Pith tools