Adaptive Graph Convolutional Neural Networks
Ruoyu Li, Sheng Wang, Feiyun Zhu, Junzhou Huang

TL;DR
This paper introduces an adaptive graph convolutional neural network that learns task-specific graph structures during training, improving performance on diverse graph data.
Contribution
It proposes a flexible, data-driven approach to adaptively learn graph structures within CNNs, addressing variability in real-world graph data.
Findings
Improved convergence speed in training.
Enhanced predictive accuracy across datasets.
Effective learning of task-specific graph structures.
Abstract
Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for each graph data while training. To efficiently learn the graph, a distance metric learning is proposed. Extensive experiments on nine graph-structured datasets have demonstrated the superior performance improvement on both convergence speed and predictive accuracy.
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Brain Tumor Detection and Classification · Recommender Systems and Techniques
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings · Adaptive Graph Convolutional Neural Networks
