Deformable Graph Convolutional Networks
Jinyoung Park, Sungdong Yoo, Jihwan Park, Hyunwoo J. Kim

TL;DR
Deformable GCNs enhance graph neural networks by adaptively capturing long-range dependencies and heterophily through deformable convolution kernels and learned node positional embeddings, improving node classification on heterophilic graphs.
Contribution
The paper introduces Deformable GCNs that perform adaptive convolution in multiple latent spaces and learn node positions, addressing limitations in capturing long-range dependencies and heterophily.
Findings
Achieves state-of-the-art performance on six heterophilic graph datasets.
Effectively captures long-range dependencies and heterophily.
Flexible handling of diverse graph structures.
Abstract
Graph neural networks (GNNs) have significantly improved the representation power for graph-structured data. Despite of the recent success of GNNs, the graph convolution in most GNNs have two limitations. Since the graph convolution is performed in a small local neighborhood on the input graph, it is inherently incapable to capture long-range dependencies between distance nodes. In addition, when a node has neighbors that belong to different classes, i.e., heterophily, the aggregated messages from them often negatively affect representation learning. To address the two common problems of graph convolution, in this paper, we propose Deformable Graph Convolutional Networks (Deformable GCNs) that adaptively perform convolution in multiple latent spaces and capture short/long-range dependencies between nodes. Separated from node representations (features), our framework simultaneously…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Recommender Systems and Techniques
MethodsConvolution
