AI & ML
KL-MOPD: Discrepancy-Aware Multi-Objective On-Policy Distillation for Generative Recommendation
arXiv cs.IR0 views
arXiv:2610.36973v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2610.36973PreviousPailitaoMMSearch2.0 Technical Report: Scaling Generative Retrieval to Unified End-to-End Multimodal SearchNextTessera: Structure-Completed Evidence Units for Web Retrieval-Augmented Generation
Related posts
Testing Desktop Apps with AI Without Blocking Your Main Computer
0dev.to Programming
AI Engineer Roadmap 2026: What 390 Job Postings Actually Require
0dev.to Programming
Locus Earth: Building an Open-Source 3D Globe That Runs Directly in Your Browser 🌍
0dev.to JavaScript
Ingeniería de Software TPV Local para Comercio de Moda y Calzado: Optimización de Inventario por Lotes y Matriz de Tallas (Vol. 41)
0dev.to Database
Ingeniería de Software TPV Local para Alimentación y Supermercados: Conexión a Balanzas Homologadas y Tickets con Trazabilidad (Vol. 42)
0dev.to Database
The Autonomous Edge — Issue #13: Cheaper Agents, Harder Governance (Week of November 2, 2026)
0dev.to AI