A Survey of Geometric Graph Neural Networks: Data Structures, Models and Applications
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7F4KXTQ3record.jsonopen to challenge →
read the original abstract
Geometric graphs are a special kind of graph with geometric features, which are vital to model many scientific problems. Unlike generic graphs, geometric graphs often exhibit physical symmetries of translations, rotations, and reflections, making them ineffectively processed by current Graph Neural Networks (GNNs). To address this issue, researchers proposed a variety of geometric GNNs equipped with invariant/equivariant properties to better characterize the geometry and topology of geometric graphs. Given the current progress in this field, it is imperative to conduct a comprehensive survey of data structures, models, and applications related to geometric GNNs. In this paper, based on the necessary but concise mathematical preliminaries, we formalize geometric graph as the data structure, on top of which we provide a unified view of existing models from the geometric message passing perspective. Additionally, we summarize the applications as well as the related datasets to facilitate later research for methodology development and experimental evaluation. We also discuss the challenges and future potential directions of geometric GNNs at the end of this survey.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
PAINET: A Principled Efficient Transformer for 3D Dynamics Modeling
PAINET proposes an SE(3)-equivariant transformer with physics-inspired attention from energy minimization for 3D dynamics modeling, reporting 4.7-41.5% error reductions on human motion, molecular, and protein benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.