Research Editor selected
Pseudo-Riemannian Attention Network (PRAT) for Heterophilic Graphs
This paper identifies a geometric mismatch in Graph Neural Networks on heterophilic graphs, where positive-definite metrics fail to capture dissimilarity. The authors introduce the Graph Signature Index to measure this mismatch and propose PRAT, a network using a learnable pseudo-Riemannian metric. PRAT outperforms or matches strong baselines on fifteen node-classification benchmarks, with ablations confirming the importance of the indefinite metric.
Why it matters: This work offers a novel theoretical insight and a practical method that improves GNN performance on heterophilic graphs, a challenging and active research area.
Graph Neural NetworksGeometric Deep LearningHeterophily