Sequential recommendation improves by thinking harder about key items
Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation
Information RetrievalArtificial IntelligenceComputation and LanguageMachine Learning
Summary
Many recommendation systems treat every item in a user's history the same when predicting what to suggest next, using equal computer effort. The authors found that some items need more detailed thinking, while others settle quickly with less work. They created LoopRec, which decides for each item separately whether to stop analyzing or keep going deeper, saving work on easy items and focusing on important ones. This method improves recommendation quality and naturally spends more effort on rare or recent items.
What this means in practice
- •For ecommerce platform engineers: Improve product recommendations by focusing computation on the most informative user interactions to increase prediction accuracy efficiently.
- •For music streaming service developers: Enhance personalized playlist generation by adaptively reasoning deeper on recent or less frequent tracks in users' listening histories.
Authors
Zhanshuo Cao, Jiakai Tang, Yuqi Zhou, Sunhao Dai, Jun Xu
Abstract
Existing sequential recommenders usually allocate a fixed computational budget to every item in a user's interaction history, regardless of the item's contribution to the final prediction. We challenge this de facto design with two diagnostic findings. (1) Non-uniform computational need: items within the same sequence vary drastically in how much computation they require. Most converge after shallow processing while a critical minority only stabilizes at full depth. (2) Suboptimality of fixed allocation: given oracle access to the target item, a non-uniform depth assignment consistently outranks the fixed one, indicating that existing uniform computation both wastes capacity on already-converged items and sacrifices overall recommendation quality. These observations motivate a shift from fixed-depth computation to item-level adaptive reasoning. To this end, we propose LoopRec. LoopRec recursively applies a single weight-shared block and introduces a lightweight gate at each recursion boundary that makes a binary exit-or-continue decision for every item independently. Items whose representations have sufficiently matured exit early, while those requiring deeper reasoning continue to subsequent recursions. This design converts the fixed global depth into a learned, per-item property without auxiliary depth labels, and is readily adaptable to diverse backbone architectures. Extensive experiments on public benchmarks with four backbone families demonstrate that LoopRec consistently outperforms matched fixed-depth counterparts. Further analysis reveals that LoopRec's learned allocation exhibits interpretable patterns aligned with our post-hoc oracle analysis: lower-frequency items and more recent interactions naturally receive deeper computation. Our code is available at https://github.com/Elpmis117/LoopRec.