REVIEW 2 cited by
Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization Retriever
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Retrievers, which form one of the most important recommendation stages, are responsible for efficiently selecting possible positive samples to the later stages under strict latency limitations. Because of this, large-scale systems always rely on approximate calculations and indexes to roughly shrink candidate scale, with a simple ranking model. Considering simple models lack the ability to produce precise predictions, most of the existing methods mainly focus on incorporating complicated ranking models. However, another fundamental problem of index effectiveness remains unresolved, which also bottlenecks complication. In this paper, we propose a novel index structure: streaming Vector Quantization model, as a new generation of retrieval paradigm. Streaming VQ attaches items with indexes in real time, granting it immediacy. Moreover, through meticulous verification of possible variants, it achieves additional benefits like index balancing and reparability, enabling it to support complicated ranking models as existing approaches. As a lightweight and implementation-friendly architecture, streaming VQ has been deployed and replaced all major retrievers in Douyin and Douyin Lite, resulting in remarkable user engagement gain.
Forward citations
Cited by 2 Pith papers
-
Hierarchical Group-wise Ranking Framework for Recommendation Models
User embeddings are quantized into hierarchical codes, and listwise ranking losses are applied within each code-defined user group to create harder negatives without retrieval infrastructure.
-
MISS: Multi-Modal Tree Indexing and Searching with Lifelong Sequential Behavior for Retrieval Recommendation
MISS builds a k-means index tree on interaction-supervised multi-modal embeddings and adds two behavior search units (Co-GSU, MM-GSU) plus ESU/MMoE, reporting ~30-47% relative recall gains over TDM+MMoE on Kuaishou da...
Discussion (0). Continue with ORCID to comment.