Skip to content
Book Open access

NodeBits: A Plug-and-Play Framework for Accelerating Graph Inference by Post-Hoc Binary Quantization

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 568-579 · 0 citations · 61 references

TL;DR

This paper proposes NodeBits, a lightweight plug-and-play framework that accelerates graph inference via a novel post-hoc binary quantization scheme that consistently outperforms existing GNN-to-MLP methods in both accuracy and inference speed.

Abstract

Graph neural networks (GNNs) have become a leading paradigm for graph learning, powering numerous applications, such as recommender systems in e-commerce and social platforms. However, GNN inference requires expensive propagation and aggregation of node features and feature gradients, repeated across layers, the cost of which grows with the graph size. To reduce the inference cost, recent GNN-to-MLP distillation methods use vector quantization (VQ) to discretize node embeddings for MLP prediction, which introduce additional parameters such as codebook size during pre-training that need to be manually tuned to avoid accuracy drop, and which require an extra MLP training stage. In this paper, we propose NodeBits, a lightweight plug-and-play framework that accelerates graph inference via a novel post-hoc binary quantization scheme. Unlike existing GNN-to-MLP distillation methods, NodeBits decouples quantization from GNN training, so can be directly applied to any trained GNN models to accelerate their inference % with negligible accuracy drop. while maintaining competitive predictive performance. The learned node representations are discretized into compact bit strings via a data-aware binary quantizer called DaBQ, which leverages lightweight data statistics on node representations to minimize the information loss induced by binarization. During inference, NodeBits reconstructs node embeddings from these bit strings and feeds them directly to the pre-trained readout layer, avoiding training an extra MLP. To further offset information loss of binarization, we introduce NodeBits^*, which fine-tunes the readout layer to better preserve model accuracy. Extensive experiments on 20 benchmark datasets demonstrate that NodeBits achieves an accuracy comparable to full-precision GNN inference while being orders of magnitude faster. NodeBits consistently outperforms existing GNN-to-MLP methods in both accuracy and inference speed.

Read PDF

Similar papers

#machine learning Preprint Sep 2026

Message Passing Does More with Less for In-Context Learning on Graphs

Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeated costs and effort. Graph in-context learning (ICL) avoids this by using a single pretrained model to predict unknown node labels directly from labeled context nodes. E...

Dooho Lee, Jin-Mo Lee, Minho Jeong et al. · 0 citations
Conference Open access Sep 2026

ADC-GNN: Adaptive Dual-level Collaborative Graph Neural Networks for Graph Classification

This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.

Wan Tang, Lu Bai, Li-Xin Cui et al. · 0 citations
Conference Sep 2026

A graph contrastive learning recommendation algorithm based on variational inference

The results confirm that SGICL effectively enhances recommendation accuracy, robustness, and the capacity to learn rich latent graph representations, providing a practical and scalable framework for graph-based recommender systems.

Chi Ma, Haohao Cao, Hui Hu et al. · 0 citations
#data science Nov 2026

UltraGNN: A Sparse-Operator-Aware Framework for Accelerating Graph Neural Networks on Tensor Cores

Graph Neural Networks (GNNs) have achieved widespread success from social networks to AI-for-Science. Most existing GNN frameworks adopt scatter-first (edge-centric) or gather-first (vertex-centric) scheduling paradigms for message passing. However, these paradigms are closely tied to traditional CUDA-core execution mo...

Jin-Liang Shi, Shi-Gang Li, Rong-Tian Fu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.