Search arXiv⌕ Search

arXiv · 2610.36973

KL-MOPD: Discrepancy-Aware Multi-Objective On-Policy Distillation for Generative Recommendation

Abstract

Coordinating multiple recommendation objectives (e.g., click and conversion) is critical for real-world generative recommendation (GR). However, since a positive item in GR can be retrieved only when its tokens are successively selected at every decoding step, traditional item-wise methods lack fine-grained token-wise supervision to guide intermediate steps. Motivated by its success in foundation models, we consider introducing multi-objective on-policy distillation (MOPD) into GR to distill two single-objective teachers into a student at each token. Yet, we find that in vanilla MOPD, (i) teachers exhibit unequal distillation difficulty at each token (i.e., token-level imbalance), and (ii) the harder-to-distill teacher varies across tokens (i.e., cross-token inconsistency), leaving each objective poorly learned at certain steps and hindering positive item retrieval for both objectives, leading to suboptimal performance. To address this challenge, we propose KL-MOPD (KL-Weighted Multi-Objective On-Policy Distillation), a simple yet effective distillation method that allocates token-wise teacher weights proportional to the initial student-teacher token-wise KL divergences, thereby strengthening supervision for the harder-to-distill teacher at every decoding step. Despite its simplicity, we theoretically prove that KL-MOPD strictly outperforms vanilla MOPD in the additive joint recommendation objective under mild conditions. Moreover, KL-MOPD is plug-and-play and computationally efficient, requiring only a one-time pre-training weight calibration with negligible training overhead. Extensive experiments on three public benchmarks, a billion-scale industrial dataset, and online A/B tests on our e-commerce advertising platform demonstrate that KL-MOPD significantly improves both individual and joint recommendation performance. The anonymous code is provided for peer review.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Weiqin Yang, Yandong Wang, Yuan Gao, Hao Deng, Jinxin Hu, Jing Cao, Jiawei Chen. 2026-10-27. KL-MOPD: Discrepancy-Aware Multi-Objective On-Policy Distillation for Generative Recommendation. https://arxiv.org/abs/2610.36973

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Role-Augmented Intent-Driven Generative Search Engine Optimization

Generative search engines (GSEs), which combine large language models (LLMs) with retrieval-augmented generation (RAG), are reshaping how users access Web information and making source visibility and influence in generated responses new optimization objectives. Existing generative search engine optimization (G-SEO) methods seek to improve content visibility, but many rely on direct access to target queries or GSE feedback elicited by those queries. However, Web content is typically optimized and published before future user queries are known, making G-SEO without access to target queries or their associated feedback an important yet underexplored problem. To address this, we propose RAID, a Role-Augmented Intent-Driven G-SEO method that operates without access to target queries or query-dependent GSE feedback. RAID infers a primary retrieval intent from source content, refines it through 4W multi-role deep reflection on prospective searchers' information needs, and uses both the primary and refined intents to jointly plan and rewrite source content. We further extend GEO-BENCH with diverse topic-related query variants, using both the original queries and their variants exclusively for evaluation to assess generalization to queries unseen during optimization. Across 100 samples and 500 evaluation queries, RAID achieves Relative Improvement Scores (RIS) of 3.00\% for Objective Overall and 1.32\% for Subjective Average, exceeding the best corresponding results among the nine predefined GEO rewriting strategies by 1.31 and 0.74 percentage points, respectively. With an optimization considered effective when $\mathrm{RIS}>0$, its effective optimization rates for Objective Overall and Subjective Average average 58.0\%, exceeding the highest corresponding average among the predefined strategies by 4.5 percentage points.

cs.IR↗

LRanker: Scaling LLM Ranking to Millions of Candidates with Test-Time Scaling

Large language models (LLMs) offer strong semantic representations for ranking, but processing candidate texts within limited contexts and repeatedly invoking an LLM for candidate-level comparisons can be costly when candidate pools contain millions of items. We propose LRanker, a framework for scaling LLM ranking to millions of candidates with test-time scaling. The framework combines two complementary components. A candidate aggregation encoder summarizes offline candidate embeddings using K-means clustering and conditions the LLM on compact global candidate information; ranking then uses inner-product scores with cached candidate embeddings. A graph-based test-time scaling mechanism allocates additional inference computation to partition-conditioned query embeddings and ensembles their ranking scores. This separates the ability to score large candidate pools from the use of additional test-time computation to improve ranking quality. We evaluate LRanker on seven tasks across three scenarios in RBench, including a recommendation task with more than 6.8M candidates. Against the strongest baseline reported for each task, the relative MRR improvements in RBench-Large are 27.5%, 3.9%, 0.9%, and 8.9% on Rec-Movie, Rec-Toy, MS MARCO, and ESCI, respectively. On RBench-Small, the reported task scores improve by 26.7% on Rec-Music and 6.1% on Routing-Balance; on the 6.8M-candidate Rec-Clothing task, the improvement over Tiger is 27.0%. Ablations support the complementary contributions of candidate aggregation and test-time ensembling. These results demonstrate a practical approach to million-scale LLM ranking, with test-time computation providing an additional means of improving ranking effectiveness.

cs.IR↗

When Do Pretrained Audio Representations Help Music Recommendation? A Study Across Ranking and Generative Interfaces

Pretrained audio encoders are increasingly used to provide content representations for music recommendation, but their downstream value can change substantially with the recommendation interface through which they are used. We study this effect across six pretrained audio encoders and three representative settings: content-based retrieval, sequential recommendation, and Semantic-ID-based generative recommendation. Using matched random-feature and ID-only controls, we distinguish absolute recommendation performance from gains over content-free inputs. Across two music datasets and a full-catalog evaluation, music-pretrained and audio-text-aligned encoders are generally stronger when their pretrained geometry is used directly or converted into Semantic IDs, while these differences become much smaller after interaction-based adaptation in SASRec. We further examine how audio representations should be discretized for generative recommendation by varying residual-quantization width, depth, and retained layers. At epoch 10, depth one performs best at every tested width, while larger codebooks generally help at depth three; the best single-layer subset also outperforms the full three-layer identifier in every evaluated comparison. For CLAP-Music, the third-layer identifier ranks higher under both original and shuffled assignments, whereas the full three-layer identifier gains more from the original assignment. Better reconstruction likewise does not ensure better ranking. Overall, our results show that the utility of pretrained audio representations is interface-dependent and that Semantic-ID quality should be assessed by downstream ranking rather than representation fidelity alone.

cs.IR↗