Accelerating Generative Recommendation via Simple Categorical User Sequence Compression

January 27, 2026 ยท Grace Period ยท ๐Ÿ› Web Search and Data Mining

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Qijiong Liu, Lu Fan, Zhongzhou Liu, Xiaoyu Dong, Yuankai Luo, Guoyuan An, Nuo Chen, Wei Guo, Yong Liu, Xiao-Ming Wu arXiv ID 2601.19158 Category cs.IR: Information Retrieval Citations 0 Venue Web Search and Data Mining
Abstract
Although generative recommenders demonstrate improved performance with longer sequences, their real-time deployment is hindered by substantial computational costs. To address this challenge, we propose a simple yet effective method for compressing long-term user histories by leveraging inherent item categorical features, thereby preserving user interests while enhancing efficiency. Experiments on two large-scale datasets demonstrate that, compared to the influential HSTU model, our approach achieves up to a 6x reduction in computational cost and up to 39% higher accuracy at comparable cost (i.e., similar sequence length).
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Retrieval