Sep 2026· Proceedings of the 20th ACM Conference on Recommender Systems· 0 citations· 42 references
Computer Science
TL;DR
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.
Abstract
Sequential recommendation must operate under long-tailed item distributions and popularity-driven concentration, often forcing practitioners to trade short-list accuracy against long-tail exposure. In this work, we study feature decorrelation as a mechanism for shaping representation geometry in dot‑product sequential recommenders, and analyze how this, in turn, affects popularity‑driven concentration. We propose 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, we pair user histories that share the same next-item target. Beyond accuracy, we provide a geometric analysis suggesting how decorrelation suppresses shared low-rank directions in the user representation space that may give popular items a global scoring advantage, and we introduce a bucket-based alignment concentration metric to quantify this effect. Experiments on five public benchmarks show that BT-SR consistently improves next-item ranking quality, while the decorrelation strength acts as a simple control knob that reallocates accuracy across head and tail items, enabling accuracy–exposure trade‑offs. Our analysis also reveals that the impact on head‑vs‑tail exposure differs across datasets, reflecting interactions between decorrelation and data temporal structure.
The phenomenon of information overload on digital platforms frequently leads to a skewed long-tail distribution, where user interactions concentrate on popular items while the majority remains undiscovered. This popularity bias is particularly acute in the book domain, where metaphorical titles defy traditional lexical...
Andy Maulana Yusuf, Miftah Farid Adiwisastra, Faizal Riza et al.· JITK (Jurnal Ilmu Pengetahua...· 0 citations
Sequential recommendation aims to predict the next item from a user’s past interaction sequence, and has largely advanced around how accurately the ground-truth item is ranked. In practice, however, a recommendation list influences subsequent user behavior and item exposure, forming a closed-loop feedback process. As t...
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
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
In recommender systems, user feedback typically follows a long-tail distribution, which leads many recommendation algorithms to exacerbate popularity bias by disproportionately favoring popular items. To mitigate this issue, recent studies have employed Inverse Propensity Scoring (IPS) to rebalance training data via re...
Tian-Yu Zhu, Jian-Dong Ding, Yan-Song Shi et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.