Sep 2026· Proceedings of the 20th ACM Conference on Recommender Systems· pp. 1471-1480· 0 citations· 51 references
Computer Science
Abstract
Modern short-video recommenders must exploit ultra-long user histories—which can reach hundreds of thousands or even millions of interactions per user—but are constrained by strict latency and training-throughput budgets. As a result, production systems typically truncate histories or rely on two-stage retrieve-then-rank pipelines, sacrificing long-term signals and breaking end-to-end optimization. While Stacked Target-to-History Cross Attention (STCA) enables end-to-end modeling up to the 10K regime, directly scaling it to ultra-long histories remains expensive in both training and serving because its per-layer cost grows linearly with the raw history length. We present SequenceO1, an end-to-end framework deployed at full traffic on Douyin at the 100K scale and designed to extend to million-scale histories. At the model level, we propose Sketch Attention (SA), which compresses an ultra-long history into a fixed-size, user-only sketch using learnable prototypes and prototype-wise normalization (each token distributes mass over prototypes). We then perform target-conditioned reasoning at two time scales: STCA over a recent 10K suffix for recency and STCA over the fixed-size sketch for ultra-long signals, followed by lightweight fusion. At the system level, a training-side local key–value cache reuses user-only sketches across repeated instances of the same user, eliminating n-dependent computation from model execution on cache hits; the same cacheable state is also reused across consecutive serving requests. We further improve efficiency with multi-request user-level batching in training and a fused FlashSA kernel for sketching under ragged batching. Together, these model and system optimizations make end-to-end 100K sequence modeling practical in production and provide a scalable path toward million-scale histories.
This paper empirically identifies two structural flaws rooted in geometric properties and dataset sparsity, and proposes a novel two-stage framework to close the long-short-view performance gap and introduces a modified softmax to counter prefix position bias.
Ling-Feng Shi, Chengkai Huang, Li-Na Yao et al.· 0 citations
RDSR, a Rate–Distortion–based Sequential Recommendation framework grounded in a task-oriented rate-utility view, combines fixed-capacity token selection with VIB-based latent compression to retain task-relevant information under explicit rate control, effectively reducing sequence length and computational overhead.
Woo-Seung Kang, Minje Kim, Suwon Lee et al.· Proceedings of the 20th ACM...· 0 citations
The contribution is a system-level integration that makes long-term, multi-interest, and multimodal modeling jointly deployable in a real-time production pipeline, together with the engineering practices required to sustain it.
Yong-Kang Fu, Bei-Ning Bao, Yu Jiang et al.· 0 citations
UniTraj, a practical framework that extends sequence construction beyond the advertising domain by incorporating behaviors from content-consumption scenarios, forming unified commercial trajectories across domains and scenarios, is proposed and deployed in a large-scale online advertising system.
Xian Hu, Ming Yue, Zhi-Xiang Feng et al.· Proceedings of the 20th ACM...· 0 citations
Inspired by the recent success of Byte Latent Transformer, DP-Rec is proposed, a dynamic latent patching architecture for recommendation that scales effectively to long sequences and achieves a superior efficiency–accuracy trade-off over both non-compressed and fixed-size compression baselines.
Dwipam Katariya, T. Caputo, Akshat Shreemali et al.· Proceedings of the 20th ACM...· 0 citations
KuaFu is a unified behavior-compression layer whose minimal unit is one behavior item, with fidelity-oriented four-stage training and layered intermediate evaluation, which matches or exceeds uncompressed single-task production models on all five headline metrics, raises per-GPU throughput by 37%-350%, and saves 190 GP...
Jia-Hao Hui, Lin Zhu, Beng-Siang Tan et al.· 0 citations