Skip to content
Preprint

Progressive Learning from Content to Relevance to Personalization for CTR Prediction

Oct 2026 · 0 citations · 23 references
Computer Science

TL;DR

FineSID is proposed, a progressive learning framework that unifies content tokenization, query--item semantic pretraining, and personalized post-training via a shared fine-grained discrete representation that improves within-product creative discrimination and improves within-product creative discrimination.

Abstract

Multimodal click-through rate (CTR) prediction is central to search systems, where ranking depends on item content, query relevance, and user preference. Existing approaches incorporate content through dense embeddings or coarse discrete IDs, yet effectively integrating fine-grained heterogeneous content with ID-based predictors remains challenging. We propose FineSID, a progressive learning framework that unifies content tokenization, query--item semantic pretraining, and personalized post-training via a shared fine-grained discrete representation. Each stage optimizes an explicit objective while preserving token-level access to content. First, a pretrained multi-scale visual tokenizer and text tokenizers convert heterogeneous content into fine-grained Semantic IDs (SIDs), explicitly aligning them with the ID features. Second, full-parameter semantic pretraining under query--item relevance supervision establishes a robust matching prior, jointly optimizing the interactions of multimodal SIDs and conventional fields within a shared predictor. Third, this initialized predictor is directly fine-tuned with user click supervision to capture implicit personalized preferences. Extensive offline and online evaluations demonstrate substantial gains in both standard CTR prediction and core business metrics. Furthermore, FineSID improves within-product creative discrimination, demonstrating its semantic generalization beyond conventional ID memorization.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Personalized LLM Recommendation with Semantic IDs: Autoregressive Beam Search vs. Multi-Token Prediction

The experiments show single-head beam search consistently beats MTP on most product-critical metrics: ranking and content QA, and trains at roughly 2.6x lower dollar cost on Qwen3-8B scale; MTP wins only on raw inference throughput.

Sejoon Oh, Fernando Amat Gil, Evan Smothers et al. · 0 citations
Preprint Sep 2026

VARG: Value-Aware and Ranking-Aligned Generative Retrieval for Dynamic E-commerce Search

VARG, a generative retrieval system for Tmall App search that directly admits generated item candidates to the existing final ranker and improves GMV, per-user IPV, and PCTR and online shopping-guide query evaluations further show that VARG maintains competitive relevance with a smaller candidate quota.

Xiao-Peng Chu, Jian-Bo Zhu, Ming-Min Jin et al. · 1 citation
Book Open access Sep 2026

End-to-End User and Item Embeddings: Specializing Retrieval Representations for Ranking

Industrial recommender systems typically operate in two stages: retrieving a candidate set from a large catalog, then ranking those candidates using contextual information. The ranking stage relies on features that summarize a user’s prior interactions with the system. These features are often carefully hand-crafted, a...

Simon Rauch, Vito Bellini, Anton Thielmann et al. · 0 citations
Book Open access Sep 2026

Bridge the Unseen Gap: Enhancing Non-overlapping Cross-domain CTR Prediction via Profile Retrieval

Click-through rate (CTR) prediction is a fundamental task in industrial recommender systems. Cross-domain CTR prediction, which leverages data from a source domain to improve performance in a target domain, has emerged as a key strategy. However, most existing methods rely on overlapping users or items across domains t...

Jing-Yang Bin, Xing Tang, Wei Zeng et al. · 0 citations
Preprint Oct 2026

Bezier-Guided Adaptive Flow for Cross-domain Sequential Recommendation

Cross-domain sequential recommendation aims to alleviate data sparsity and cold-start problems by transferring useful preference knowledge across domains. However, users exhibit varying degrees of preference consistency across domains, while existing methods often rely on global alignment objectives or coarse-grained t...

Ziang Lu, Yu Zhang, Xin-Zhe Jiang et al. · 0 citations
Preprint Oct 2026

DuoLM: Fast and Effective Personalized Recommendation with Language Models

DuoLM is introduced, a framework for fast and effective personalized recommendation that integrates a compact recommendation model with an efficient serving runtime that accelerates inference through virtual token IDs for embedding access, shared history computation, and CUDA Graph replay.

Jiang Wu, Yu-Tong Song, Hong-Bo 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.