Optimization of Graph Neural Networks with Natural Gradient Descent
arXiv:2008.09624
Abstract
In this work, we propose to employ information-geometric tools to optimize a graph neural network architecture such as the graph convolutional networks. More specifically, we develop optimization algorithms for the graph-based semi-supervised learning by employing the natural gradient information in the optimization process. This allows us to efficiently exploit the geometry of the underlying statistical model or parameter space for optimization and inference. To the best of our knowledge, this is the first work that has utilized the natural gradient for the optimization of graph neural networks that can be extended to other semi-supervised problems. Efficient computations algorithms are developed and extensive numerical studies are conducted to demonstrate the superior performance of our algorithms over existing algorithms such as ADAM and SGD.
References in corpus (9)
- Adam: A Method for Stochastic Optimization
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- Semi-Supervised Classification with Graph Convolutional Networks
- Geometric deep learning: going beyond Euclidean data
- Graph Neural Networks: A Review of Methods and Applications
- Fast Graph Representation Learning with PyTorch Geometric
- FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling
- Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasis
- Limitations of the Empirical Fisher Approximation for Natural Gradient Descent
Cited by in corpus (5)
- GCNBoost: Artwork Classification by Label Propagation through a Knowledge Graph
- Quadratic GCN for Graph Classification
- Feature Level Fusion from Facial Attributes for Face Recognition
- Spatio-temporal Modeling for Large-scale Vehicular Networks Using Graph Convolutional Networks
- An Energy-Based View of Graph Neural Networks