arXiv AI By Fanlong Zeng, Wensheng Gan, Kangjie Chen, Philip S. Yu

GraphIFE: Rethinking Graph Imbalance Node Classification via Invariant Learning

Read the original on arXiv AI →

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.

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 AI.

arXiv AI
Jun 17

Handling Feature Heterogeneity with Learnable Graph Patches

arXiv:2606. 17667v1 Announce Type: cross Abstract: In recent years, the rapid development of foundation models and graph pre-training technologies has spurred increasing interest in constructing a universal pre-trained graph model or Graph Foundation Model (GFM).

By Yifei Sun, Yang Yang, Xiao Feng, Zijun Wang, Haoyang Zhong, Chunping Wang, Lei Chen
arXiv AI
Aug 28

Rethinking Message Passing as Retrieval for Text-Attributed Graph Learning

The paper reinterprets graph neural networks (GNNs) as retrieval-augmented models, where each layer uses an MLP on a node representation and a permutation‑invariant summary of retrieved graph context instead of traditional message passing. It introduces RTA, a lightweight MLP‑based framework that replaces structural message passing with label‑aware retrieval and propagation, and provides theoretical links to softmax‑attention message passing and robustness to mis‑retrieved outliers. Experiments on text‑attributed graph benchmarks demonstrate that RTA matches or surpasses strong GNN and graph LLM baselines while improving efficiency and robustness.

By Jintang Li, Yuhong Chen, Ruofan Wu, Binli Luo, Jiayi Ji, Hui Li, Rongrong Ji