no code implementations • 2 Mar 2023 • Acong Zhang, Ping Li, Guanrong Chen
In the semi-supervised setting where labeled data are largely limited, it remains to be a big challenge for message passing based graph neural networks (GNNs) to learn feature representations for the nodes with the same class label that is distributed discontinuously over the graph.
no code implementations • 17 Feb 2023 • Acong Zhang, Jincheng Huang, Ping Li, Kai Zhang
Multiple recent studies show a paradox in graph convolutional networks (GCNs), that is, shallow architectures limit the capability of learning information from high-order neighbors, while deep architectures suffer from over-smoothing or over-squashing.
no code implementations • 23 May 2022 • Jincheng Huang, Ping Li, Rui Huang, Chen Na, Acong Zhang
Alternatively, it is possible to exploit the information about the presence of heterophilous neighbors for feature learning, so a hybrid message passing approach is devised to aggregate homophilious neighbors and diversify heterophilous neighbors based on edge classification.