Isometric Transformation Invariant and Equivariant Graph Convolutional Networks
By Masanobu Horie, Naoki Morita, Yushi Ihara, Naoto Mitsume. 2020
25 citations recorded by the source corpus.
Graphs are one of the most important data structures for representing pairwise relations between objects. Specifically, a graph embedded in a Euclidean space is essential to solving real problems, such as object detection, structural chemistry analyses, and physical simulation. A crucial requirement to applying a graph in a Euclidean space is learning the isometric transformation invariant and equivariant features. In the present paper, we propose a set of transformation invariant and equivariant models based on graph convolutional networks (GCNs), called IsoGCNs. We demonstrate that the proposed model outperforms state-of-the-art methods on tasks related with geometrical and physical data. Moreover, the proposed model can scale up to the graphs with 1M vertices and conduct an inference faster than a conventional finite element analysis.
Subfields: Computer Vision and Pattern Recognition, Graph Learning
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
- Emiel Hoogeboom
- Victor Garcia Satorras
- Max Welling
- Stefano Ermon
- Luc Van Gool
- Dacheng Tao
- Trevor Darrell
- Andrew Zisserman
In Graph Learning
- Max Welling
- Victor Garcia Satorras
- Emiel Hoogeboom
- Jure Leskovec
- William L. Hamilton
- Jian Tang
- Stephan Günnemann
- Rex Ying
Citations in the corpus
- E(n) Equivariant Graph Neural Networks (2021, background): “Horie et al. (2020) proposes a set of isometric invariant and equivairant transformations for Graph Neural Networks.”