Search Results for author:
Found 3 papers, 1 papers with code
Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks
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.
Robust Mid-Pass Filtering Graph Convolutional Networks
Theoretical analyses guarantee the robustness of signals through the mid-pass filter, and we also shed light on the properties of different frequency signals under adversarial attacks.
Revisiting the role of heterophily in graph representation learning: An edge classification perspective
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
