pith. sign in

arxiv: 2501.08695 · v1 · pith:B5RKXE3O · submitted 2025-01-15 · cs.IR

Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization Retriever

pith:B5RKXE3Oopen to challenge →

classification cs.IR
keywords streamingindexmodelsrankingcomplicateddouyinexistingindexes
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Brownian Bridge Diffusion for Sequential Recommendation

    cs.IR 2025-07 unverdicted novelty 6.0

    BBDRec applies Brownian bridge diffusion to enable direct item-to-history transitions in sequential recommendation, outperforming prior diffusion and sequential baselines on public datasets.

  2. From Extraction to Navigation: Progressive Retrieval with Indirectly Infinite Depth

    cs.IR 2026-06 unverdicted novelty 4.0

    IID-Nav enables progressive retrieval in large-scale recommenders by treating it as iterative goal-driven graph traversal with recursive state evolution supporting unlimited depth without rising inference cost.