Graph Neural Networks: A Review of Methods and Applications
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:U7YTQEC2record.jsonopen to challenge →
read the original abstract
Lots of learning tasks require dealing with graph data which contains rich relation information among elements. Modeling physics systems, learning molecular fingerprints, predicting protein interface, and classifying diseases demand a model to learn from graph inputs. In other domains such as learning from non-structural data like texts and images, reasoning on extracted structures (like the dependency trees of sentences and the scene graphs of images) is an important research topic which also needs graph reasoning models. Graph neural networks (GNNs) are neural models that capture the dependence of graphs via message passing between the nodes of graphs. In recent years, variants of GNNs such as graph convolutional network (GCN), graph attention network (GAT), graph recurrent network (GRN) have demonstrated ground-breaking performances on many deep learning tasks. In this survey, we propose a general design pipeline for GNN models and discuss the variants of each component, systematically categorize the applications, and propose four open problems for future research.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks
EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
-
Graph Star Net for Generalized Multi-Task Learning
GraphStar is a new GNN that adds star nodes and relay attention to achieve non-local representations for node, graph, and link tasks, claiming 2-5% gains over prior SOTA on benchmarks.
-
The Montparnasse Algorithm for RNA Design
Montparnasse Monte Carlo framework solves all Eterna100 V1 puzzles faster than DesiRNA and finds mRNA sequences with more paired bases than LinearDesign's MFE solution.
-
Fast Training of Sparse Graph Neural Networks on Dense Hardware
Techniques enable training the sparse GNN from Allamanis et al. [2018] on dense TPU hardware in 13 minutes versus a full day originally.
-
Machine Learning for Multi-messenger Probes of New Physics and Cosmology: A Review and Perspective
A review summarizing machine learning methods for multi-messenger probes of dark matter and new physics, with a proposed plan for future integrated analyses.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.