arXiv Machine Learning By Sujan Chakraborty, Priyanka Saha, Saptarshi Bej

HERALD: High-Fidelity Exemplar Retrieval with Adaptive Landmark Distillation for Heterophily-Aware Graph Condensation

Read the original on arXiv Machine Learning →

HERALD is a new gradient‑free graph condensation framework that adapts node scoring and feature selection to a graph’s heterophily level. It selects features using a joint Fisher‑discriminability and activation‑density criterion, and scores nodes with a weighted combination of prototype representativeness, decision‑boundary proximity, and Local Intrinsic Dimensionality, where the weights depend on the heterophily ratio. The selected nodes are assembled into a condensed subgraph via score‑ordered BFS expansion, Personalized PageRank pruning, and class rebalancing, achieving comparable storage to BONSAI and outperforming state‑of‑the‑art condensers on heterophilic graphs while remaining competitive on homophilic ones across multiple GNN architectures.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 19

HyPE-GT: where Graph Transformers meet Hyperbolic Positional Encodings

HyPE-GT introduces a framework that generates learnable hyperbolic positional encodings for Graph Transformers, enabling the capture of complex hierarchical relationships in graph-structured data. Unlike traditional Euclidean encodings, HyPE’s hyperbolic encodings can be selected to suit specific downstream tasks and help mitigate oversmoothing in deep Graph Neural Networks. Experiments on molecular benchmarks and large-scale Open Graph Benchmark datasets demonstrate improved performance, while additional tests on Coauthor and Copurchase networks confirm HyPE’s effectiveness in controlling oversmoothing.

By Kushal Bose, Swagatam Das
arXiv Machine Learning
Jun 10

When Design Rules Break: Benchmark Composition Determines Whether Label Informativeness Predicts GNN Aggregator Choice

arXiv:2606. 10249v1 Announce Type: new Abstract: We examine whether graph neural network (GNN) design rules generalize across benchmark families by studying aggregator selection (sum, mean, max) on 24 node-classification datasets spanning citation, heterophilic, LINKX Facebook-100, co-purchase, and co-authorship graphs.

By Neha Sharma, Ritesh Sharma