Pith. sign in

REVIEW 3 cited by

Degree-Quant: Quantization-Aware Training for Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.05000 v3 pith:6OUR5AAL submitted 2020-08-11 cs.LG stat.ML

classification cs.LGstat.ML
keywords modelsdegree-quantgnnstrainingarithmeticbaselinesgraphinference
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Graph neural networks (GNNs) have demonstrated strong performance on a wide variety of tasks due to their ability to model non-uniform structured data. Despite their promise, there exists little research exploring methods to make them more efficient at inference time. In this work, we explore the viability of training quantized GNNs, enabling the usage of low precision integer arithmetic during inference. We identify the sources of error that uniquely arise when attempting to quantize GNNs, and propose an architecturally-agnostic method, Degree-Quant, to improve performance over existing quantization-aware training baselines commonly used on other architectures, such as CNNs. We validate our method on six datasets and show, unlike previous attempts, that models generalize to unseen graphs. Models trained with Degree-Quant for INT8 quantization perform as well as FP32 models in most cases; for INT4 models, we obtain up to 26% gains over the baselines. Our work enables up to 4.7x speedups on CPU when using INT8 arithmetic.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Inference-friendly Graph Compression for Graph Neural Networks

    cs.LG 2025-04 reject novelty 5.0 of 10

    A graph compression scheme that merges inference-equivalent nodes so GNN inference can run on a smaller graph with no or little decompression, claiming 55-85% inference cost reduction with small accuracy loss.

  2. FastCHGNet: Training one Universal Interatomic Potential to 1.5 Hours with 32 GPUs

    cs.DC 2024-12 reject novelty 5.0 of 10

    FastCHGNet trains a CHGNet universal interatomic potential in 1.53 hours on 32 GPUs, but the fastest variant degrades force and stress accuracy.

  3. Diffusion Model Quantization: A Review

    cs.CV 2025-05 conditional novelty 3.0 of 10

    A structured review and benchmark of methods for quantizing diffusion models, with a taxonomy of post-training and quantization-aware approaches and an analysis of quantization artifacts.

Pith tools