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.
Abstract
Sequential recommenders are typically trained on long user histories to capture rich behavioral signals, yet serving with training-length sequences is often impractical due to real-time efficiency constraints. Directly using only recent behaviors leads to a severe performance drop. To bridge this gap, existing approaches compress user histories into persistent per-user states, storing and retrieving them at inference time; while effective, they impose non-trivial infrastructure overhead and offer little remedy in cold-start scenarios. In this paper, we empirically identify two structural flaws rooted in geometric properties and dataset sparsity, and propose a novel two-stage framework to close the long-short-view performance gap. Specifically, in the first stage, we replace the commonly used dot-product with angular similarity scoring and leverage a modified softmax to counter prefix position bias. In the second stage, we fine-tune only bias and LayerNorm components, which are universal to standard sequential backbones, for further improvement. Both stages are guided by carefully designed learning objectives. Extensive experiments on two representative backbones across three public datasets demonstrate the effectiveness of our proposed framework.
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
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
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-ra...
Lin Guan, Jia-Qi Yang, Zhi-Shan Zhao et al.· Proceedings of the 20th ACM...· 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
Long-tailed interactions make collaborative evidence vary sharply across user histories. Existing dual-view methods alleviate sparsity but typically use static fusion and uniform auxiliary supervision. We propose TAGRec (Tailness-Aware Gated Recommendation), a unified framework in which TAG estimates contextual tailnes...
Feng-Ying Li, Jia-Wei Gao, Sen Li et al.· Proceedings of the 20th ACM...· 0 citations
This work proposes a decorrelation-regularized training framework that augments next-item prediction with an auxiliary redundancy-reduction term, and instantiate it with BT-SR, which uses the Barlow Twins objective to form label-consistent positive pairs without synthetic corruptions.
Veronika Ivanova, Marina Munkhoeva, Ivan Razvorotnev et al.· 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.