Recommendation systems improve by combining semantic and collaborative signals
Neither Black nor White: Balancing Semantic and Collaborative Signals with Graph-Informed Semantic IDs (GrIS)
Artificial IntelligenceInformation RetrievalMachine Learning
Summary
Generating good product or content recommendations can be tricky because you want to consider both what the item is about (its meaning) and how users interact with it. The authors argue that instead of just encoding items into categories based on meaning alone, it's better to think of items as nodes in a network that connects similar things by meaning and user behavior. They created a new way to group items on this network to make recommendations that better balance content and collaboration information. Their method leads to more accurate recommendations on real datasets compared to existing techniques.
What this means in practice
- •For recommender system engineers: Develop better recommendation algorithms by using graph-based item grouping that balances content and user interactions for improved accuracy.
- •For e-commerce platform developers: Enhance product recommendation quality by integrating graph-informed clustering to capture both product features and shopping patterns.
Authors
Aleksei Medvedev, Alejandro Ariza-Casabona, Steven Derby, Gonzalo Fiz Pontiveros, Xinyang Shao, Florian Spiess
Abstract
Existing work on Semantic IDs (SIDs) for generative recommendation treats SID construction as a representation learning problem: encode items into a quantised latent space and read off codes. We argue this view is incidental. SID construction is, at heart, a recursive clustering problem, and once stated this way the natural object to cluster is a graph whose nodes carry semantic content and whose edges carry collaborative signal; SID assignment becomes a hierarchical graph partition. This reframing yields a unified framework, Graph-Informed Semantic IDs (GrIS), that subsumes prior approaches rather than displacing them. RQ-VAE and RQ-KMeans are recovered as the special case where the graph is empty, exposing content-only quantisation as one corner of a larger design space along two so-far-collapsed axes: graph construction and recursive partition algorithm. We explore two contrasting instantiations: RecDMoN, which performs hierarchical assignment via differentiable graph pooling, and RQ-GAE, which extends RQ-VAE with graph-aware item representations and a graph reconstruction objective. On multiple real-world datasets, GrIS consistently improves over CF-aware SOTA, with gains of up to +52\% Hit@10. Because graph construction and partition are explicit, separately configurable components, improvements on either axis can be combined and evaluated systematically.