Discrete Semantic Tokenization for Deep CTR Prediction
Not on the map. Why?
Abstract (arXiv)
Incorporating item content information into click-through rate (CTR) prediction models remains a challenge, especially with the time and space constraints of industrial scenarios. The content-encoding paradigm, which integrates user and item encoders directly into CTR models, prioritizes space over time. In contrast, the embedding-based paradigm transforms item and user semantics into latent embeddings, subsequently caching them to optimize processing time at the expense of space. In this paper, we introduce a new semantic-token paradigm and propose a discrete semantic tokenization approach, namely UIST, for user and item representation. UIST facilitates swift training and inference while maintaining a conservative memory footprint. Specifically, UIST quantizes dense embedding vectors into discrete tokens with shorter lengths and employs a hierarchical mixture inference module to weigh the contribution of each user--item token pair. Our experimental results on news recommendation showcase the effectiveness and efficiency (about 200-fold space compression) of UIST for CTR prediction.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Mar 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 2; 2026: 3.
8 papers.
- 2024Node Identifiers: Compact, Discrete Representations for Efficient Graph Learningcited by 10
- 2024An Automatic Graph Construction Framework based on Large Language Models for Recommendationcited by 8
- 2026Large Language Model as Token Compressor and Decompressorcited by 4
- 2025PCR-CA: Parallel Codebook Representations with Contrastive Alignment for Multiple-Category App Recommendationcited by 2
- 2025A Survey on LLM-based News Recommender Systemscited by 1
- 2024HMDN: Hierarchical Multi-Distribution Network for Click-Through Rate Predictioncited by 0
- 2026LLM-driven Multimodal Recommendationcited by 0
- 2026Towards a Densing Law for User Representation Learning at Billion-Scale Capacitycited by 0
- 2026Towards a Densing Law for User Representation Learning at Billion-Scale Capacity24 Aug 2026
- 2026Large Language Model as Token Compressor and Decompressor26 Mar 2026
- 2026LLM-driven Multimodal Recommendation5 Feb 2026
- 2025PCR-CA: Parallel Codebook Representations with Contrastive Alignment for Multiple-Category App Recommendation25 Aug 2025
- 2025A Survey on LLM-based News Recommender Systems13 Feb 2025
- 2024An Automatic Graph Construction Framework based on Large Language Models for Recommendation24 Dec 2024
- 2024HMDN: Hierarchical Multi-Distribution Network for Click-Through Rate Prediction2 Aug 2024
- 2024Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning26 May 2024