CompressGNN: Accelerating Graph Neural Network Training via Hierarchical Compression

摘要

Graph Neural Networks (GNNs) are widely used in various applications and consist of two main operations: Propagation and Transformation. By permuting and combining these two operations, we can obtain different GNN architectures for different downstream tasks. Despite the effectiveness and popularity of GNNs, their training is time-consuming and memory-intensive, which limits their practical usage. Various methods have been proposed to tackle this issue, such as sampling and distributed training. In this work, we carefully revisit the two basic operations of GNNs and observe two types of redundancy in these operations: 1) propagation data redundancy, and 2) transformation computation redundancy. To address these problems, we propose CompressGNN, a framework that leverages hierarchical compression to accelerate GNNs by reducing data and computational redundancy. The framework comprises a propagation compression module and a transformation compression module. In the propagation compression module, we compress the graph structure to eliminate data redundancy. In the transformation compression module, we achieve computation compression by compressing similar node features at runtime. Extensive experiments demonstrate that our method achieves an average speedup of 2.32× across multiple datasets and models.