arXiv:2505.09361cs.LG2025-05被引 4

提出GNN混合精度量化框架,显著降低计算量且不损失性能。

Efficient Mixed Precision Quantization in Graph Neural Networks

  • 基于定理实现整数消息聚合,保证与浮点精度数值相等。
  • 平均减少5.5倍节点分类、5.1倍图分类的比特操作。
  • 灵活配置各组件位宽,适配现有GNN量化方法。

图神经网络(GNN)在处理大规模图应用中日益重要,但其计算开销迫切需要高效加速方法。混合精度量化成为在不牺牲预测性能前提下提升GNN效率的有力方案。相较于传统深度学习架构,GNN层包含更多可量化的组件,如消息传递函数、聚合函数、更新函数、输入、可学习参数及输出。本文提出一个关于高效量化消息传递的定理,确保使用整数进行消息聚合时,其结果与全精度(FP32)计算数值相等。基于此定理,我们提出混合精度量化图神经网络(MixQ-GNN)框架,可灵活选择各组件的整数位宽。该方法系统化地探索大量可能的位宽组合,在保持相近预测性能的前提下优化效率。MixQ-GNN可与现有GNN量化方法兼容,利用其图结构优势实现更高预测性能。平均而言,相比FP32架构,节点分类任务减少5.5倍比特操作,图分类任务减少5.1倍。

原文摘要 · Abstract (English)

Graph Neural Networks (GNNs) have become essential for handling large-scale graph applications. However, the computational demands of GNNs necessitate the development of efficient methods to accelerate inference. Mixed precision quantization emerges as a promising solution to enhance the efficiency of GNN architectures without compromising prediction performance. Compared to conventional deep learning architectures, GNN layers contain a wider set of components that can be quantized, including message passing functions, aggregation functions, update functions, the inputs, learnable parameters, and outputs of these functions. In this paper, we introduce a theorem for efficient quantized message passing to aggregate integer messages. It guarantees numerical equality of the aggregated messages using integer values with respect to those obtained with full (FP32) precision. Based on this theorem, we introduce the Mixed Precision Quantization for GNN (MixQ-GNN) framework, which flexibly selects effective integer bit-widths for all components within GNN layers. Our approach systematically navigates the wide set of possible bit-width combinations, addressing the challenge of optimizing efficiency while aiming at maintaining comparable prediction performance. MixQ-GNN integrates with existing GNN quantization methods, utilizing their graph structure advantages to achieve higher prediction performance. On average, MixQ-GNN achieved reductions in bit operations of 5.5x for node classification and 5.1x for graph classification compared to architectures represented in FP32 precision.

图神经网络量化混合精度推理加速

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。