paper-with-me

Papers

Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing

2023-02-03 · Yunchong Song, Chenghu Zhou, Xinbing Wang, Zhouhan Lin

Most graph neural networks follow the message passing mechanism. However, it faces the over-smoothing problem when multiple times of message passing is applied to a graph, causing indistinguishable node representations and prevents the model to effectively learn dependencies between farther-away nodes. On the other hand, features of neighboring nodes with different labels are likely to be falsely mixed, resulting in the heterophily problem. In this work, we propose to order the messages passing into the node representation, with specific blocks of neurons targeted for message passing within specific hops. This is achieved by aligning the hierarchy of the rooted-tree of a central node with the ordered neurons in its node representation. Experimental results on an extensive set of datasets show that our model can simultaneously achieve the state-of-the-art in both homophily and heterophily settings, without any targeted design. Moreover, its performance maintains pretty well while the model becomes really deep, effectively preventing the over-smoothing problem. Finally, visualizing the gating vectors shows that our model learns to behave differently between homophily and heterophily settings, providing an explainable graph neural model.

📄 PDF Abstract BibTeX arXiv:2302.01524

Code (1)

lumia-group/orderedgnn 공식 구현 pytorch

Tasks

Node Classification

Similar Papers 제목 키워드 기반

Fast OBDD Reordering using Neural Message Passing on Hypergraph

2018-11-06 · Feifan Xu, Fei He, Enze Xie, Liang Li

Ordered binary decision diagrams (OBDDs) are an efficient data structure for representing and manipulating Boolean formulas. With respect to different variable orders, the OBDDs' sizes may vary from linear to exponential…

Sparse Bayesian Message Passing under Structural Uncertainty

2026-01-03 · Yoonhyuk Choi, Jiho Choi, Chanran Kim, Yumin Lee 외 arxiv

Semi-supervised learning on real-world graphs is frequently challenged by heterophily, where the observed graph is unreliable or label-disassortative. Many existing graph neural networks either rely on a fixed adjacency …

Make Heterophily Graphs Better Fit GNN: A Graph Rewiring Approach

2022-09-17 · Wendong Bi, Lun Du, Qiang Fu, Yanlin Wang 외

Graph Neural Networks (GNNs) are popular machine learning methods for modeling graph data. A lot of GNNs perform well on homophily graphs while having unsatisfactory performance on heterophily graphs. Recently, some rese…

Node Classification

HL-Net: Heterophily Learning Network for Scene Graph Generation

2022-05-03 · CVPR 2022 1 · Xin Lin, Changxing Ding, Yibing Zhan, Zijian Li 외

Scene graph generation (SGG) aims to detect objects and predict their pairwise relationships within an image. Current SGG methods typically utilize graph neural networks (GNNs) to acquire context information between obje…

Graph ClassificationGraph GenerationScene Graph ClassificationScene Graph Generation

A partial order view of message-passing communication models

2022-10-24 · Cinzia Di Giusto, Davide Ferré, Laetitia Laversa, Etienne Lozes

There is a wide variety of message-passing communication models, ranging from synchronous ''rendez-vous'' communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the communi…

Distributed Computing