Learning To Hash With Graph Neural Networks For Recommender Systems

Abstract

Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. In this work, we investigate the problem of hashing with graph neural networks (GNNs) for high quality retrieval, and propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes. Specifically, a deep hashing with GNNs (HashGNN) is presented, which consists of two components, a GNN encoder for learning node representations, and a hash layer for encoding representations to hash codes. The whole architecture is trained end-to-end by jointly optimizing two losses, i.e., reconstruction loss from reconstructing observed links, and ranking loss from preserving the relative ordering of hash codes. A novel discrete optimiza

Stats

• citations73
• S2 citations—
• github stars0
• HF likes0
• heat score14.02
• arxiv keytan2020learning

Related papers

• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Position-based Hash Embeddings For Scaling Graph Neural Networks (2021)2.26
• Hashing-accelerated Graph Neural Networks For Link Prediction (2021)11.49
• Hessian-aware Quantized Node Embeddings For Recommendation (2023)2.26
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• Embedding Compression With Hashing For Efficient Representation Learning In Large-scale Graph (2022)8.60
• Learning To Hash For Recommendation: A Survey (2024)0.00
• Learning To Collide: Recommendation System Model Compression With Learned Hash Functions (2022)0.00