MEGA Hub

SITA: Semantic Interest Tokens for Target-Aware Compression in Long-Sequence Recommendation

Authors

Do you know Rui Zhou?You can claim authorship or link another user.Do you know Bo Chen?You can claim authorship or link another user.Do you know Qinglin Jia?You can claim authorship or link another user.Do you know Jiezhou Ji?You can claim authorship or link another user.Do you know Chaoyi Ma?You can claim authorship or link another user.Do you know Ruiming Tang?You can claim authorship or link another user.Do you know Hao Wang?You can claim authorship or link another user.Do you know Enhong Chen?You can claim authorship or link another user.

Abstract

As user behavior histories continue to grow on modern Internet platforms, effectively modeling long behavior sequences has become crucial for predicting user interests in candidate items. Existing methods have evolved along two directions. One line dynamically retrieves target-relevant behaviors from long histories, enabling target-aware modeling but requiring target-dependent computation during inference. The other line compresses entire behavior sequences into compact user representations, achieving high efficiency and scalability but sacrificing target-specific adaptation due to target-independent encoding. The key challenge is therefore to enable target-aware modeling while preserving the efficiency and scalability of compressed user representations. To address this challenge, we propose \textbf{SITA}, a target-aware compression framework for long-sequence recommendation. SITA enables target-aware compression by organizing compressed interests into semantic structures through semantic identifiers learned via parallel semantic quantization. Conditioned on the semantic identifier of the target item, SITA adaptively aggregates the corresponding structured interests to construct the target-specific user representation. Extensive experiments on public datasets and a large-scale industrial dataset demonstrate that SITA consistently outperforms representative baselines while maintaining strong scalability, highlighting its strong potential for real-world recommender systems.

Community

00