Skip to content
Preprint

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

Aug 2026 · 0 citations · 49 references
Computer Science

TL;DR

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, and adaptively aggregates the corresponding structured interests to construct the target-specific user representation.

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.

View source

Similar papers

Book Open access Sep 2026

UniTraj: Cross-Domain Long-Sequence Modeling for Commercial Recommendation

UniTraj, a practical framework that extends sequence construction beyond the advertising domain by incorporating behaviors from content-consumption scenarios, forming unified commercial trajectories across domains and scenarios, is proposed and deployed in a large-scale online advertising system.

Xian Hu, Ming Yue, Zhi-Xiang Feng et al. · 0 citations
Book Open access Sep 2026

Information-Aware Long Sequence Compression for Sequential Recommendation

Sequential recommendation (SR) aims to predict a user’s next interaction by modeling temporal dependencies in historical behavior sequences. However, modeling long sequences introduces two challenges: longer histories often include noisy interactions irrelevant to a user’s core interests, and increasing sequence length...

Woo-Seung Kang, Minje Kim, Suwon Lee et al. · 0 citations
Book Open access Sep 2026

DP-Rec: Towards Dynamic Patching for Efficient Long-Sequence Recommendation

Transformers have redefined sequential recommendation by effectively modeling dynamic user behaviors and long-range dependencies. However, they remain inherently inefficient: standard architectures operate at a fixed rate, allocating comparable computation to every item in a user’s history regardless of its information...

Dwipam Katariya, T. Caputo, Akshat Shreemali et al. · 0 citations
Book Open access Sep 2026

CoSID: Concept-Conditioned Semantic-ID Decoding for Efficient Generative Recommendation

CoSID is introduced, a concept-conditioned SID decoder that encodes the history once into a compact next-item concept and delegates the entire beam search to a lightweight KV-cached decoder.

Danil Gusak, A. Volodkevich, Evgeny Frolov · 1 citation
Preprint Sep 2026

ChronicleRec: Pre-training Temporally Anchored Tokens for Lifelong User Modeling

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
Conference Open access Sep 2026

Bridging the Semantic Gap: Leveraging LLMs for Hierarchical Interest Evolution in Sequential Recommendation

The Hierarchical Semantic Interest Evolution Network (HSIEN), a novel generative-discriminative framework that significantly alleviates modality misalignment and enhances CTR prediction performance through feature complementarity, is proposed.

Yi-Fan Cao, Rui Wu, Xiang Wang 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.