Papers for

video streaming service developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Large recommendation models made efficient through shared sequence encoding

SepLRM: A Foundation Model Paradigm for Recommendation

Abstract: Large recommendation models (LRMs) improve recommendation performance by scaling behavior sequence length, model capacity, and training compute. However, the return on investment (ROI) of continued scaling deteriorates as marginal gains diminish and long-sequence encoding costs rise, especially when this computation is repeatedly executed by distinct models for diverse recommendation stages and business scenarios. To address this issue, we propose SepLRM, a recommendation foundation model (RFM) paradigm that identifies reusable sequence encoding and reorganizes multiple end-to-end (E2E) LRMs into one RFM and multiple independently optimized vertical models (VMs). The RFM adopts an encoder-decoder architecture and exports its final-layer encoder state as the shared key-value (KV) cache that is independent of downstream task-offered candidates. Unlike candidate-specific logits or aggregated user embeddings, the KV cache preserves fine-grained behavioral information. Separation at this native KV interface also allows each VM to construct candidate-conditioned queries while retaining the same query-KV interaction as its E2E counterpart, enabling high-fidelity capability transfer. To ensure both transfer effectiveness and system efficiency, we co-design cache compression, the training and serving workflows, and LG-Store, a distributed storage system for KV caches. Experiments on three large-scale datasets show that SepLRM achieves state-of-the-art offline performance with a transfer rate of approximately 100%. It also demonstrates strong transferability across model iterations, recommendation stages, and business scenarios. Deployment in two large-scale industrial scenarios substantially improves the ROI of sequence scaling and delivers consistent gains in online A/B tests at ByteDance.

Sat 7 NovInformation Retrieval
The gist
Recommendation systems try to predict what you might like based on your past behaviors, but as they get bigger, they become slower and cost more to run. The authors propose a new way called SepLRM that splits the recommendation work into one big shared part and several smaller specialized parts. This method saves effort by reusing detailed user behavior information across different recommendation tasks without losing accuracy. Their experiments show this approach works well on large datasets and improves real-world recommendation services at ByteDance.
Open → 2611.10356v1

Flow based method improves personalized recommendation accuracy

SourceFlow: Collaborative Source Coupling for Flow-Based Recommendation

Abstract: Diffusion-based recommenders learn user preferences by denoising interaction histories, but the added noise can distort the original preference signals. Flow-based collaborative filtering (CF) instead learns a discrete path from a sampled source to the user's observed training interactions (the target history), enabling inference in a few steps. Existing flow-based CF methods sample sources using global item frequencies to reflect the sparsity and popularity of observed interactions. Each source is sampled independently of its target history, leaving the predictor without user-specific source cues for learning to reconstruct that history. We propose SourceFlow, which brings collaborative structure into the source distribution itself rather than adding further conditioning to the predictor. Like inference from observed histories, training uses collaborative evidence to predict missing interactions. Specifically, Neighborhood Coupling constructs displaced binary sources by replacing historical items with unobserved collaborative alternatives. Collaborative Consensus further refines replacement probabilities using evidence from other interactions of users who share the observed item. Stretched Restoration retains these replacements at late flow times during training, providing more opportunities to recover the original interactions. Experiments on five recommendation datasets show consistent improvements over competitive baselines, including a mean relative Recall@10 gain of 15.7% over the strongest flow-based baseline. Controlled experiments confirm that these gains depend on correctly pairing collaborative sources with their target histories, as reassigning the same source vectors across users reverses the gains. Code will be publicly released upon acceptance.

Tue 3 NovInformation Retrieval
The gist
Recommendation systems try to predict what you might like by looking at your past choices, but the noise added in some methods can hide your true preferences. The authors propose SourceFlow, a technique that better guesses missing favorite items by using patterns from similar users' interactions. This method replaces some past choices with related guesses based on shared tastes, making it easier for the model to learn and recover the original preferences. Tests across multiple datasets show this approach gives more accurate recommendations than previous flow-based methods.
Open → 2611.04455v1

Adaptive user memory improves recommendations with language models

MATE: Adaptive Long- and Short-Term User Memory for LLM-Based Recommendation

Abstract: Large language model (LLM)-enhanced recommender systems leverage rich item semantics to support personalized recommendation. However, semantic representations alone do not determine which historical behaviors reflect persistent preferences and which mainly indicate recent interests, leaving an important aspect of user understanding unresolved. Recent advances in LLM inference show that newly available information can be used to refine the internal state during inference, thereby improving subsequent predictions. Inspired by this principle, we propose MATE (Memory Adaptation with Temporal Evidence), an adaptive user modeling framework for LLM-enhanced sequential recommendation. MATE first evaluates each newly observed interaction from two temporal perspectives: whether it is repeatedly supported by historical behaviors and whether it is consistent with recent interactions. The resulting temporal evidence controls the updates of two user-specific memories, where the long-term memory conservatively preserves persistent preferences while the short-term memory rapidly adapts to recent interests. For each recommendation, a recent-context representation dynamically determines how strongly the two memories contribute to the current user representation. During offline training, next-item prediction is jointly optimized with temporal supervision, while during online adaptation, the shared model remains fixed and only the two user memories are updated from newly observed interactions. Experiments on MovieLens-10M, Amazon Luxury Beauty, and KuaiRec show that MATE improves mean NDCG@10 over the strongest external baseline by 7.0--13.2%. Further analyses support its ability to adapt to recent interests while retaining useful information about recurring earlier preferences.

Mon 5 OctInformation Retrieval
The gist
Recommender systems try to guess what you like based on your past actions, but it's hard to tell if some actions show long-term tastes or just recent interests. The authors designed MATE, a system that keeps two types of memories: one for long-term preferences and another for short-term interests. It updates these memories differently depending on whether new actions match past or recent behavior, helping the system recommend better items by balancing old and new signals. Tests show that MATE improves recommendation quality consistently across several datasets.
Open → 2610.06050v1

RouteRec guides recommendation models using session behavior patterns

RouteRec: Behavior-Guided Sparse Routing for Sequential Recommendation

Abstract: Sessionized interaction histories contain behavioral patterns that can improve sequential recommendation. However, existing models process all sessions through the same parameterized blocks, regardless of their behavioral differences. Mixture of Experts (MoE) enables conditional computation, but it leaves open what should guide expert allocation. We propose RouteRec, a sequential recommender that uses observed session behavior as the routing criterion. RouteRec summarizes four types of behavioral evidence from sessionized histories: interaction tempo, item-group focus, repetition and carryover, and popularity tendency. It uses these cues to route computation at macro, mid, and micro scopes. Cue-derived scores first select expert groups; within each selected group, the current backbone state then refines expert selection. Across six public datasets and 18 dataset-metric combinations, RouteRec ranks first in 12 and second in three, yielding the best overall average rank of 1.61 compared with 4.11 for the next-best baseline. Additional analyses suggest that the behavioral cues guide expert allocation beyond added capacity and produce routing patterns aligned with observed behavior. Our code is available at https://github.com/jy1559/RouteRec

Wed 30 SeptInformation RetrievalMachine Learning
The gist
Sequential recommendation systems try to predict what you might want to see next based on what you have interacted with before. The authors found that treating all user sessions the same way misses important differences in how people behave. They created RouteRec, which looks closely at different behavior clues—like how fast you interact, if you repeat items, and how popular the items are—to decide how to process each session differently. This approach helps the system give better predictions about what you might like next.
Open → 2609.39007v1

Helix improves recommendation ranking by scaling feature and sequence models

HELIX: Purified and Unified - Rethinking Feature Interaction and Sequence Modeling for Large-Scale Recommendation

Abstract: Industrial recommendation ranking models typically scale along two modeling axes: feature interaction over heterogeneous user, item, context, and cross features, and sequence modeling over long, informative, and multi-type user behavior histories. We find that scaling either capability in isolation is insufficient, as each exhibits a limited scaling ceiling and a suboptimal scaling-law slope. We conjecture that achieving a more favorable scaling-law slope requires jointly scaling both axes. To support this, we present HELIX, a purified and unified architecture for large-scale recommendation. HELIX interleaves sequence retrieval and feature interaction while enforcing one-way information flow from reusable sequence states to candidate-conditioned mix-tokens. This design preserves cross-depth communication between the two modeling axes while keeping user-side sequence computation amortizable, enabling flexible and asymmetric scaling of sequence modeling and feature interaction. Deployed in TikTok's e-commerce recommendation system, HELIX consistently improves offline CTR AUC, CVR AUC, and other ranking metrics. In online A/B tests, it achieves an approximately 6% increase in e-commerce video GMV per user.

Tue 29 SeptInformation Retrieval
The gist
Recommendation systems try to guess what you want by looking at your past behavior and other information. The authors found that improving just one part of this guesswork, like looking only at features or only at past actions, doesn’t work very well. They designed a method called HELIX that combines both parts smoothly, making the system better at predicting what users want. When used in TikTok’s shopping recommendations, it helped show better videos and increased sales.
Open → 2609.37183v1

Octree method speeds video processing with fewer data points

Octree-based Video Representation

Abstract: Video models commonly use uniform grids even though visual complexity varies substantially across space and time. We introduce OctVideo, which approximates a video clip with an octree. This hierarchy recursively partitions a spatio-temporal volume into eight subvolumes, so that smooth regions remain coarse while detailed regions receive finer cells. Each leaf stores local RGB values and spatio-temporal gradients, supplemented by a lightweight learned residual. For reconstruction, a Conv1D VAE maps the serialized cells to a regular latent grid and selectively refines details during decoding. Our VAE achieves 36.12 dB PSNR with 38.2M parameters and 189.4 GFLOPs per clip on Kinetics-400 (K400). It also generalizes zero-shot to the high-resolution Densely Annotated VIdeo Segmentation (DAVIS) 2016 dataset with reconstruction quality comparable to the best evaluated models. On both datasets, it requires the fewest model FLOPs and achieves the fastest encoding and decoding among the evaluated models. OctVideo also supports video understanding, achieving competitive recognition performance with few input tokens when trained from scratch. By exploiting the redundancy already present in video signals and efficiently processing sparse structures, OctVideo provides an efficient representation for video.

Sun 27 SeptComputer Vision and Pattern Recognition
The gist
Videos have lots of repeated and simple parts mixed with detailed sections, but current methods treat all parts the same, making processing inefficient. The authors introduce OctVideo, a way to represent video using a tree-like structure that breaks up space and time so simple areas are stored coarsely and detailed parts finely. This method uses fewer computations, encodes and decodes faster, and still produces good quality video reconstructions. It also works well on different video datasets without extra training and helps recognize video content using fewer inputs.
Open → 2609.33100v1

Semantic IDs improve item recommendation by tracing interests

From Interests to Semantic IDs: Retrieval-Grounded Credit Assignment for Generative Recommendation

Abstract: Semantic IDs (SIDs) encode each catalog item as a short token sequence, enabling generative recommenders to predict the next item autoregressively. Reasoning-enhanced variants, an increasingly common extension, first generate a textual trace and then decode a next-item SID by beam search. Such recommenders are commonly trained with group-relative policy optimization under an exact-match SID reward, which is sparse in large catalogs. Two failure modes follow. When all rollouts in a group miss the target, the group yields zero advantage and no learning signal. Rollouts sharing the same SID reward receive identical advantages, however much their traces differ. In both cases the reward reflects only the decoded SID, never the reasoning that produced it. This creates a credit-assignment gap. We address this gap with retrieval-grounded query attribution. Each trace is structured into a history summary, a set of interest hypotheses, and a final SID. A frozen retriever executes every hypothesis as a catalog query, so that each hypothesis becomes independently verifiable rather than judged only through the final SID. A rollout is rewarded when any of its queries retrieves the target within the \mbox{top-$K$}, and per-query hit indicators localize that reward to individual hypotheses. Credit is thus assigned at the span level: only hypotheses that individually hit receive positive retrieval advantage, while the retrieval channel never updates the final SID span. Rollouts that share a SID reward can therefore receive different updates. Across experiments on three Amazon Reviews datasets, this yields consistent improvements in SID recommendation. On Video Games, an oracle analysis further reveals the potential of interest-conditioned SID decoding: selecting the target-relevant query among generated interests improves both recall and ranking.

Thu 24 SeptInformation RetrievalArtificial Intelligence
The gist
The paper focuses on improving how recommendation systems predict the next item a user might want to see, like in shopping or streaming services. Traditional methods only reward correct item predictions but ignore the reasoning process that led to those predictions, which limits learning. The authors introduce a method that breaks down the reasoning into smaller parts and checks which parts actually helped find the right item, giving more precise feedback. This approach helps the system learn better to recommend items by connecting interests to actual results.
Open → 2609.29983v1

New method improves long sequence item recommendations with better speed and accuracy

Preference-Drift-Aware Subsequence Learning and Hierarchical Context Fusion for Long-Sequence Generative Recommendation

Abstract: Long-sequence generative recommendation methods autoregressively model the user's interaction sequence to generate the next-item representation. Existing methods generally fall into two categories: efficient full-sequence modeling and target-aware context retrieval. Our experiments reveal that as the sequence length increases, the former incurs steadily growing computational cost while its accuracy gains quickly saturate and even degrade due to noise; the latter, though shortening the input sequence, is susceptible to noise that is semantically consistent yet preference-inconsistent, as well as to incomplete contexts. Both paradigms ignore the dynamic changes of user preferences and the cross-subsequence dependencies when handling historical information, thereby limiting accuracy and efficiency. To address these issues, we propose a preference-drift-aware subsequence learning and hierarchical context fusion for long-sequence generative recommendation. Specifically, we learn differentiable soft subsequence boundaries using multidimensional preference-drift information and aggregate items within each subsequence into preference-coherent representations via linear attention with soft assignment weights, thereby circumventing the expense of full-sequence attention. A cross-attention mechanism is then employed to capture dependencies between recent interactions and relevant subsequence contexts, mitigating noise in learning recent-item representations. Finally, a gated fusion mechanism adaptively combines the recent-item representation with the global subsequence context, allowing the resulting target representation to encode both recent and long-term preferences. Extensive experiments demonstrate that our method consistently outperforms existing baselines in both recommendation accuracy and computational efficiency.

Fri 11 SeptInformation Retrieval
The gist
Many recommendation systems try to guess what you’ll like next by looking at everything you've done before, but this can be slow and sometimes less accurate when there’s a lot of history. The authors found that current methods either take too long with long histories or don’t handle changes in your tastes well. They created a new approach that splits your activity into smaller chunks and combines recent and long-term preferences in a smart way. This makes recommendations both faster to compute and better at matching what you want now.
Open → 2609.12556v1