Sep 2026· Proceedings of the 20th ACM Conference on Recommender Systems· 0 citations· 62 references
Computer Science
TL;DR
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.
Abstract
Transformers have redefined sequential recommendation by effectively modeling dynamic user behaviors and long-range dependencies. However, they remain inherently inefficient: standard architectures operate at a fixed rate, allocating comparable computation to every item in a user’s history regardless of its information content. This leads to prohibitive computational overhead on long sequences and increased sensitivity to behavioral noise. To address this, practitioners often resort to lossy sequence compression, staged modeling, or truncation. This limits the model’s ability to leverage the full context of long histories during inference. Inspired by the recent success of Byte Latent Transformer, we propose DP-Rec, a dynamic latent patching architecture for recommendation. DP-Rec shifts from item-level modeling to patch-level modeling by segmenting interaction sequences using contrastive entropy surprise to identify informative behavioral boundaries. A lightweight patch encoder compresses these temporally contextualized segments into a reduced set of dynamic latent behavior vectors, which are then processed by a larger latent transformer and decoded for next-item prediction. Extensive experiments show that, under constrained computational budgets, DP-Rec scales effectively to long sequences and achieves a superior efficiency–accuracy trade-off over both non-compressed and fixed-size compression baselines.
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
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
The Hierarchical Semantic Interest Evolution Network (HSIEN), a novel generative-discriminative framework that significantly alleviates modality misalignment and enhances CTR prediction performance through feature complementarity, is proposed.
Yi-Fan Cao, Rui Wu, Xiang Wang et al.· Proceedings of the Thirty-Fi...· 0 citations
ChronicleRec is a pre-train-and-transfer framework that compresses an ultra-long behavior sequence once into a chronologically ordered set of Chronicle Tokens, which can be cached per user, decoupling ultra-long sequence modeling from online candidate scoring.
Chengkai Huang, Yu-Bin Sheng, Liang Guo et al.· 0 citations
A novel Dual-End Adapter for Sequential Recommendation (DEASRec) is presented, which employs lightweight adapters as flexible plugins without modifying backbone architectures to achieve stable performance improvements with low computational cost.
Juntao Hu, Wei Zhou, Huayi Shen et al.· Proceedings of the 32nd ACM...· 0 citations
Existing sequential recommendation models rely on absolute positional encodings and fixed context windows, producing two structural failure modes: out-of-distribution degradation on histories longer than the training window, and hard context limits that discard long-range interactions. We present CONGA (COntinual Neura...
Hoang-Duong Le, Tuong Bach Hy Nguyen, Bac Le· Proceedings of the 20th ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.