Hessian-aware Quantized Node Embeddings For Recommendation

Abstract

Graph Neural Networks (GNNs) have achieved state-of-the-art performance in recommender systems. Nevertheless, the process of searching and ranking from a large item corpus usually requires high latency, which limits the widespread deployment of GNNs in industry-scale applications. To address this issue, many methods compress user/item representations into the binary embedding space to reduce space requirements and accelerate inference. Also, they use the Straight-through Estimator (STE) to prevent vanishing gradients during back-propagation. However, the STE often causes the gradient mismatch problem, leading to sub-optimal results. In this work, we present the Hessian-aware Quantized GNN (HQ-GNN) as an effective solution for discrete representations of users/items that enable fast retrieval. HQ-GNN is composed of two components: a GNN encoder for learning continuous node embeddings and a quantized module for compressing full-precision embeddings into low-bit ones. Consequently, HQ-G

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keychen2023hessian

Related papers

• Learning To Hash With Graph Neural Networks For Recommender Systems (2020)14.02
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Embedding Compression With Hashing For Efficient Representation Learning In Large-scale Graph (2022)8.60
• Combigcn: An Effective GCN Model For Recommender System (2025)6.77
• Position-based Hash Embeddings For Scaling Graph Neural Networks (2021)2.26
• Lightsage: Graph Neural Networks For Large Scale Item Retrieval In Shopee's Advertisement Recommendation (2023)6.77
• Mixed-precision Embeddings For Large-scale Recommendation Models (2024)0.00
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77