A Node-Aware Dynamic Quantization Approach for Graph Collaborative Filtering
Lin Li, Chunyang Li, Yu Yin, Xiaohui Tao, Jianwei Zhang

TL;DR
This paper introduces GNAQ, a graph-aware dynamic quantization method for GNN-based collaborative filtering that significantly reduces model size and training time while maintaining high recommendation accuracy.
Contribution
GNAQ leverages graph structure for adaptive quantization and introduces relation-aware gradient estimation, improving efficiency and accuracy over existing methods.
Findings
Outperforms state-of-the-art quantization methods by 27.8% in Recall@10
Reduces model size by 8-12 times without accuracy loss
Doubles training speed compared to baseline quantization methods
Abstract
In the realm of collaborative filtering recommendation systems, Graph Neural Networks (GNNs) have demonstrated remarkable performance but face significant challenges in deployment on resource-constrained edge devices due to their high embedding parameter requirements and computational costs. Using common quantization method directly on node embeddings may overlooks their graph based structure, causing error accumulation during message passing and degrading the quality of quantized embeddings.To address this, we propose Graph based Node-Aware Dynamic Quantization training for collaborative filtering (GNAQ), a novel quantization approach that leverages graph structural information to enhance the balance between efficiency and accuracy of GNNs for Top-K recommendation. GNAQ introduces a node-aware dynamic quantization strategy that adapts quantization scales to individual node embeddings…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
