arXiv Machine Learning

ALINC: Active Learning for Inductive Node Classification via Graph Sampling

arXiv:2606. 04647v1 Announce Type: new Abstract: Active learning (AL) for node classification typically focuses on selecting the most informative nodes for annotation within one or a few large graphs (e.

arXiv Machine Learning
Jun 11

GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs

arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.

By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang
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
arXiv AI
Sep 16

GraphIFE: Rethinking Graph Imbalance Node Classification via Invariant Learning

GraphIFE addresses the class imbalance problem in graph-structured data by tackling a quality inconsistency issue in synthesized nodes. The framework uses graph invariant learning to strengthen embedding space representations and identify invariant features, leading to improved performance on minority classes. Experiments show that GraphIFE consistently outperforms various baselines across multiple datasets.

By Fanlong Zeng, Wensheng Gan, Kangjie Chen, Philip S. Yu
arXiv Machine Learning
Sep 15

Pre-training with Graph Transformers

The paper explores pre‑training methods for graph transformers applied to biochemistry. It finds that supervised pre‑training with computed property labels yields the best improvement on downstream tasks, and it emphasizes that limiting model capacity helps prevent overfitting.

By Jiaming Wang, Thomas Laurent, Xavier Bresson