arXiv paper· recommender systems (industrial machine learning)· method paper

SequenceO1: End-to-End Ultra-Long (100K) Sequence Modeling in Recommendation with Low-Rank Caching

Lin Guan, Jia-Qi Yang, Zhishan Zhao, Jiaqi Huang, Hangyu Wang, Longbin Li, Beichuan Zhang, Haonan Jiang, et al.

cs.IR · cs.AI

Quick verdict

ByteDance's SequenceO1 brings 100K-sequence ranking to full Douyin traffic with strong A/B gains; credible but proprietary, with FLOPs-only system evidence.

Summary

SequenceO1 is a ByteDance production framework deployed at full traffic on Douyin that extends end-to-end fine-ranking from 10K-token to 100K-token user behavior sequences. The design is compress-then-reason: Sketch Attention (SA) uses learnable prototypes with prototype-wise normalization — each token allocates mass across prototypes — to compress the ultra-long history into a fixed-size, user-only, cacheable sketch (deployed 1K×128); stacked target-conditioned STCA then attends over a recent 10K suffix and the sketch, fused by MixFormer. System-side, a training local KVCache (3h TTL, ~0.5 hit rate), serving cache (1h TTL, ~0.6), multi-request-level batching (R=40 train / 300 serving), pipeline lift, and a fused FlashSA kernel amortize the length-dependent path, making cache hits O(1) in raw length. In lightweight ablations SA gains +1.07% Finish AUC over STCA(512) and beats five equal-budget compressors (Table 3); in production offline evaluation it replaces lifelong TWIN V2 with +0.29% Finish AUC (Dislike +1.29%, Table 4); a one-month full-traffic A/B on Douyin and Douyin Lite shows Finish +2.33%/+3.49%, Like +2.36%/+2.94%, and Dislike -6.98%/-6.00% (Table 5), all declared statistically significant without reported statistics. Main limitations: proprietary data and no code, efficiency evidence restricted to analytic FLOPs with no measured latency or throughput, and unexamined training-time cache staleness.

Review complete

Assessment at a glance

recommender systems (industrial machine learning)

5

risk flags identified

● high 0

● medium 3

● low 2

Reproducibility readinesslow
Code & data availablenot stated
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viable

4 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Sketch Attention compresses 100K-token histories into a fixed-size (1K×128), user-only, cacheable sketch, gaining +1.07% Finish AUC over STCA(512) and beating five equal-budget compression methods (Table 3).
  • The cache-hit path is O(1) in raw history length, cutting ultra-long-branch FLOPs ~49.9× in training (R=40, hit 0.5) and ~63.9× in serving (R=300, hit 0.6) versus direct STCA at 100K.
  • Replacing lifelong TWIN V2 with the end-to-end 100K sketch branch improves all ten offline objectives in the full production ranker (e.g., Finish +0.29% AUC, Dislike +1.29% AUC, Table 4).
  • A one-month full-traffic A/B on Douyin and Douyin Lite shows Finish +2.33%/+3.49%, Like +2.36%/+2.94%, and Dislike -6.98%/-6.00%, with gains stable across activity segments (Table 5).

Strengths

  • Full-traffic production evidence at exceptional scale

    One-month A/B on Douyin and Douyin Lite across five activity segments (Table 5, e.g., Finish +2.3256%/+3.4872%, Dislike -6.9829%/-5.9972% overall), plus full-ranker offline gains replacing TWIN V2 (Table 4, +0.29% Finish AUC) — external validity few recsys papers can offer.

  • Unusually honest calibration of its own evidence

    §5.1 and App. C.1 explicitly state the Fig. 3 histograms 'should not be compared as direct evidence'; §5.5 refuses an apples-to-apples reading of LLaTTE/SOLARIS transfer ratios; App. A.5 explicitly rejects the 'Linformer for recommendation' interpretation.

  • Fully re-derivable analytic cost accounting

  • Equal-budget compressor comparison

Weaknesses

  • No measured system metrics

  • Statistical reporting is blank

  • Reproducibility is effectively nil

  • Mechanistic coverage claim under-supported

  • Training-side cache staleness unanalyzed

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

This is an industrial method paper from ByteDance (RecSys '26) presenting SequenceO1, a fine-ranking framework deployed at full traffic on Douyin and Douyin Lite that extends end-to-end user-history modeling from the 10K to the 100K regime. Four claims: (1) Sketch Attention (SA) compresses a 100K history into a fixed-size, user-only sketch (deployed k=1K, d=128) via learnable prototypes and prototype-wise normalization; (2) two-time-scale STCA — target cross-attention over a recent 10K suffix and over the sketch — preserves most of the quality of direct 100K scaling, retaining 83% of directly scaled STCA's +1.29% ablation gain (+1.07%, Fig. 1c); (3) cache-first amortization (training KVCache hit≈0.5, serving hit≈0.6, MRLB R=40/300, pipeline lift, FlashSA) makes the cache-hit path O(1) in raw length, cutting branch FLOPs ~49.9× (training) and ~63.9× (serving) versus direct STCA; (4) replacing lifelong TWIN V2 improves all ten offline objectives (Table 4) and delivers month-long A/B gains (Table 5). Appendix A explicitly scopes the "low-rank" framing as a conceptual lens, not an approximation guarantee — commendable precision.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 4 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What is SequenceO1?

SequenceO1 is a ByteDance production framework deployed at full traffic on Douyin that lets the fine-ranking model use ultra-long (up to 100,000-event) user behavior sequences end-to-end. It compresses each user's history once into a fixed-size 'sketch' that is cached and reused across candidate items and requests, combining model changes (Sketch Attention plus target-conditioned cross-attention) with system optimizations (KV caches, user-level batching, and a fused GPU kernel).

How is Sketch Attention different from standard attention?

Standard attention normalizes weights across the sequence, so tokens compete to be selected by each query. Sketch Attention instead normalizes across prototypes: every history token distributes a fixed total mass over a set of learned prototype slots. The authors argue this enforces coverage of the whole history, which matters because the compressed sketch must serve many future target items before any target is known. The output is a fixed-size representation (about 1K×128) whether the raw history is 10K or 100K long.

What results did SequenceO1 achieve on Douyin?

In offline ablations it gained +1.07% Finish AUC over a 512-length STCA baseline and beat five alternative compression methods at the same budget. In the full production offline comparison it replaced the TWIN V2 lifelong module with +0.29% Finish AUC (and up to +1.29% Dislike AUC). In a one-month full-traffic A/B on Douyin and Douyin Lite, Finish rose +2.33% and +3.49%, Like +2.36% and +2.94%, and Dislike fell about 6-7%; all metrics were declared statistically significant, though no test details are given.

Is SequenceO1 code or data publicly available?

No. All experiments use proprietary Douyin production data; the paper releases no code, datasets, or checkpoints, so its numbers cannot currently be reproduced externally. The analytic FLOPs derivations in its appendix are the only fully checkable component.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Figures 1-3 are present only as captions and embedded axis labels in the extraction; curve and histogram shapes (e.g., Fig. 3's distribution separation) cannot be visually assessed, so figure-based judgments rest on captions and surrounding text alone.

Go deeper on this paper

Reproduce ResultsNot feasible for this paper — the core results cannot be re-derived by sandboxed code simulation.

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
SequenceO1: End-to-End Ultra-Long (100K) Sequence Modeling in Recommendation with Low-Rank Caching | Evolve.Pub