Tubi's Shallow-RHS: An Asymmetric Graph Architecture for Cold-Start Item Recommendation
By
[Submitted on 4 Jun 2026]
A good honest bake. Not flashy, but you'll finish the whole bagel.
Summary
This paper presents Shallow-RHS, an asymmetric graph architecture developed by Tubi to address the cold-start item recommendation problem in production retrieval systems. The approach formulates cold-start recommendation as an inductive graph-completion problem on a temporal bipartite device-content graph. The architecture features a left-hand side (LHS) device tower that uses watch-history message passing for collaborative signals, while the right-hand side (RHS) content tower is intentionally shallow, encoding content solely from intrinsic features without ID-based embeddings or interaction-derived representations. This forces the content encoder to map intrinsic features into a collaborative-filtering-aware embedding space, enabling embeddings for both warm and newly ingested content. The system also extends to device cold-start using cohort-based embeddings from demographic features. Large-scale online experiments showed consistent improvements in content cold-start engagement, promotion speed, impression acquisition, and device cold-start engagement.
Key quotes
· 5 pulledCollaborative filtering and graph-based recommendation models are highly effective because they leverage observed user interactions, but this dependence creates a fundamental cold-start challenge when newly added content has no interaction history.
We propose Shallow-RHS, an asymmetric link-prediction architecture in which the left-hand side (LHS) device tower leverages temporally valid watch-history message passing to capture collaborative signals, while the right-hand side (RHS) content tower is intentionally shallow with respect to the graph and encodes content solely from intrinsic features.
The RHS tower does not use ID-based embeddings, content-side subgraphs, neighbor aggregation, or interaction-derived representations, forcing the content encoder to map intrinsic features into a collaborative-filtering-aware embedding space.
After training, the learned content encoder generates embeddings for both warm and newly ingested content, enabling implicit graph completion through retrieval of warm surrogate neighbors.
Large-scale online experiments demonstrate consistent relative improvements in content cold-start engagement, promotion speed, impression acquisition, and device cold-start engagement.
You might also wanna read
Adaptive LLM Routing Using Contextual Bandits and Shared Embedding Space
This research paper proposes a novel approach to LLM routing that treats it as a contextual bandit problem rather than supervised learning.
Chroma Context-1: A 20B Parameter Agentic Search Model for Multi-Hop Retrieval
Chroma Context-1 is a 20B parameter agentic search model designed to improve retrieval-augmented generation (RAG) systems. Unlike traditiona
Optimizing Container Image Distribution to Eliminate Cold Starts in AI Applications
The article discusses the persistent problem of container cold starts in latency-sensitive AI applications and proposes solutions for faster
cerebrium.ai·2mo agoClickHouse Rebuilds Full-Text Search with Native Columnar Integration
ClickHouse has completely rebuilt its full-text search (FTS) capability from scratch, moving beyond its older implementation to deliver sign
Technical Reflections on Implementing HNSW Graphs for Vector Similarity Search in Redis
The article is a technical blog post by antirez (Salvatore Sanfilippo) reflecting on his year-long experience developing Hierarchical Naviga
Theoretical Limitations of Vector Embedding Models for Information Retrieval
This research paper examines the fundamental theoretical limitations of vector embedding models for retrieval tasks. The authors demonstrate
