Not Half Bad: Exploring Half-Precision in Graph Convolutional Neural Networks
John Brennan, Stephen Bonner, Amir Atapour-Abarghouei, Philip T, Jackson, Boguslaw Obara, Andrew Stephen McGough

TL;DR
This paper investigates the impact of using half-precision computations and Tensor Cores on the efficiency of graph convolutional neural networks, focusing on reducing memory and runtime for large-scale graph analysis.
Contribution
It provides an in-depth analysis of reduced-precision operations in GCNs, including integration with PyTorch and evaluation across multiple GPU architectures and tasks.
Findings
Reduced precision decreases memory usage significantly.
Tensor Cores improve computational speed for GCNs.
Performance varies across GPU architectures and tasks.
Abstract
With the growing significance of graphs as an effective representation of data in numerous applications, efficient graph analysis using modern machine learning is receiving a growing level of attention. Deep learning approaches often operate over the entire adjacency matrix -- as the input and intermediate network layers are all designed in proportion to the size of the adjacency matrix -- leading to intensive computation and large memory requirements as the graph size increases. It is therefore desirable to identify efficient measures to reduce both run-time and memory requirements allowing for the analysis of the largest graphs possible. The use of reduced precision operations within the forward and backward passes of a deep neural network along with novel specialised hardware in modern GPUs can offer promising avenues towards efficiency. In this paper, we provide an in-depth…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
