mlsanityData to 7 Oct 2026

Optimizing Memory Efficiency of Graph Neural Networks on Edge Computing Platforms

arXiv 2104.03058 ↗First posted 7 Apr 2021cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Graph neural networks (GNN) have achieved state-of-the-art performance on various industrial tasks. However, the poor efficiency of GNN inference and frequent Out-Of-Memory (OOM) problem limit the successful application of GNN on edge computing platforms. To tackle these problems, a feature decomposition approach is proposed for memory efficiency optimization of GNN inference. The proposed approach could achieve outstanding optimization on various GNN models, covering a wide range of datasets, which speeds up the inference by up to 3x. Furthermore, the proposed feature decomposition could significantly reduce the peak memory usage (up to 5x in memory efficiency improvement) and mitigate OOM problems during GNN inference.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 8 of its 12 references that are in the map. First posted on arXiv 7 Apr 2021.

Builds on

8 of 12 references.

References · 8

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  6. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
  7. 2018Link Prediction Based on Graph Neural Networkscited by 829
  8. 2020Characterizing and Understanding GCNs on GPUcited by 22

Built on by

Cited by year

Citing papers per year: 2022: 4; 2023: 1; 2024: 1.

6 papers.