TinyKG: Memory-Efficient Training Framework for Knowledge Graph Neural Recommender Systems
Not on the map. Why?
Abstract (arXiv)
There has been an explosion of interest in designing various Knowledge Graph Neural Networks (KGNNs), which achieve state-of-the-art performance and provide great explainability for recommendation. The promising performance is mainly resulting from their capability of capturing high-order proximity messages over the knowledge graphs. However, training KGNNs at scale is challenging due to the high memory usage. In the forward pass, the automatic differentiation engines (textsle.g., TensorFlow/PyTorch) generally need to cache all intermediate activation maps in order to compute gradients in the backward pass, which leads to a large GPU memory footprint. Existing work solves this problem by utilizing multi-GPU distributed frameworks. Nonetheless, this poses a practical challenge when seeking to deploy KGNNs in memory-constrained environments, especially for industry-scale graphs. Here we present TinyKG, a memory-efficient GPU-based training framework for KGNNs for the tasks of recommendation. Specifically, TinyKG uses exact activations in the forward pass while storing a quantized version of activations in the GPU buffers. During the backward pass, these low-precision activations are dequantized back to full-precision tensors, in order to compute gradients. To reduce the quantization errors, TinyKG applies a simple yet effective quantization algorithm to compress the activations, which ensures unbiasedness with low variance. As such, the training memory footprint of KGNNs is largely reduced with negligible accuracy loss. To evaluate the performance of our TinyKG, we conduct comprehensive experiments on real-world datasets. We found that our TinyKG with INT2 quantization aggressively reduces the memory footprint of activation maps with 7 ×, only with 2% loss in accuracy, allowing us to deploy KGNNs on memory-constrained devices.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Dec 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 6; 2024: 1.
7 papers.
- 2023PokeMQA: Programmable knowledge editing for Multi-hop Question Answeringcited by 23
- 2023An Efficient Content-based Time Series Retrieval Systemcited by 5
- 2023Tango: rethinking quantization for graph neural network training on GPUscited by 4
- 2023Sharpness-Aware Graph Collaborative Filteringcited by 3
- 2024RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networkscited by 2
- 2023Context-aware feature attribution through argumentationcited by 0
- 2023Temporal Treasure Hunt: Content-based Time Series Retrieval System for Discovering Insightscited by 0
- 2024RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networks15 Apr 2024
- 2023PokeMQA: Programmable knowledge editing for Multi-hop Question Answering23 Dec 2023
- 2023Temporal Treasure Hunt: Content-based Time Series Retrieval System for Discovering Insights5 Nov 2023
- 2023Context-aware feature attribution through argumentation24 Oct 2023
- 2023An Efficient Content-based Time Series Retrieval System5 Oct 2023
- 2023Tango: rethinking quantization for graph neural network training on GPUs2 Aug 2023
- 2023Sharpness-Aware Graph Collaborative Filtering18 Jul 2023