Geometric deep learning on graphs and manifolds using mixture model CNNs
Abstract
Deep learning has achieved a remarkable performance breakthrough in several fields, most notably in speech recognition, natural language processing, and computer vision. In particular, convolutional neural network (CNN) architectures currently produce state-of-the-art performance on a variety of image analysis tasks such as object detection and recognition. Most of deep learning research has so far focused on dealing with 1D, 2D, or 3D Euclidean-structured data such as acoustic signals, images, or videos. Recently, there has been an increasing interest in geometric deep learning, attempting to generalize deep learning methods to non-Euclidean structured data such as graphs and manifolds, with a variety of applications from the domains of network analysis, computational social science, or computer graphics. In this paper, we propose a unified framework allowing to generalize CNN architectures to non-Euclidean domains (graphs and manifolds) and learn local, stationary, and compositional task-specific features. We show that various non-Euclidean CNN methods previously proposed in the literature can be considered as particular instances of our framework. We test the proposed method on standard tasks from the realms of image-, graph- and 3D shape analysis and show that it consistently outperforms previous approaches.
Benchmark Results
Tested on 2 datasets
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 best reported | best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 157 | DCNN | 0.8680 best reported | best today: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 435 | DeepWalk | 0.8290 best reported | best today: Graph Representation Learning: A Survey (2019) |
| 567 | mixture model CNNs | 0.8169
±0.0048 | This paper |
| 724 | MLP | 0.7768 | |
| 762 | Planetoid | 0.7570 | This paper |
| 835 | LP | 0.6820 best reported | best at pub: Revisiting Semi-Supervised Learning with Graph Embeddings (ICML 2016) best today: Transformers from Diffusion: A Unified Framework for Neural Message Passing (JMLR 2024) |
| 875 | ManiReg | 0.6040
±0.0080 best reported | best at pub: Revisiting Semi-Supervised Learning with Graph Embeddings (ICML 2016) best today: Transformers from Diffusion: A Unified Framework for Neural Message Passing (JMLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 880 | SemiEmb | 0.5900 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | |
| 78 | DCNN | 0.8980 best reported | best today: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 210 | MLP | 0.8690
±0.0074 | |
| 223 | DeepWalk | 0.8652
±0.0012 best reported | |
| 613 | mixture model CNNs | 0.7881
±0.0044 | This paper |
| 727 | Planetoid | 0.7720 | This paper |
| 826 | SemiEmb | 0.7170 best reported | best today: Graph Attention Networks (ICLR 2017) |
| 831 | ManiReg | 0.7130
±0.0140 best reported | best today: Discovering Data Geometry: Energy-Driven Neural Diffusion (ICLR 2023) Difference within reported uncertainty; not counted as underperformance. |
| 861 | LP | 0.6580 best reported | best today: Discovering Data Geometry: Energy-Driven Neural Diffusion (ICLR 2023) |
