Aug 2026· Proceedings of the 20th ACM Conference on Recommender Systems· 0 citations· 22 references
Computer Science
Abstract
Foundation model(FM) for recommendation has shown strong ability to model long-horizon sequential user behavior. In practice, a single pretrained foundation model is often adapted to diverse downstream serving surfaces through Supervised Fine-Tuning(SFT). However, optimizing task-specific objectives such as clicks or likes does not necessarily align the serving policy with the business metrics that determine recommendation quality. We propose a three-phase progressive post-training framework that explicitly separates downstream adaptation from business-metric alignment. The adaptation stage is decomposed into Linear Probing(LP) and Full Fine-Tuning(FFT): LP first stabilizes randomly initialized downstream heads within a frozen pretrained representation space, and FFT then jointly specializes the full model for the target task. On top of this stabilized policy, Reinforcement Fine-Tuning(RFT) aligns the model with practical business objectives using a learned reward model. Rather than directly optimizing the serving policy on sparse business targets, we train the policy on dense implicit feedback and use business-metric supervision only for reward modeling. Offline experiments show that the progressive LP-FFT-RFT framework outperforms single-phase alternatives, and that reward-based alignment yields a stronger serving policy than directly using the reward model itself for ranking. Large-scale online A/B tests further show that the proposed framework improves production recommendation quality over a conventional non-foundation baseline. A reference implementation is available at https://github.com/webtoon/rec-fm-progressive-alignment.
High-capacity Click-Through Rate (CTR) models for ads recommendation often exhibit pronounced one-epoch overfitting: performance peaks after a single training pass (epoch) over the data, while additional epochs degrade generalization as the model memorizes noise in high-variance click labels. To address this challenge,...
Yunzhe Qi, Qinghai Zhou, Bo-Yang Liu et al.· Proceedings of the 32nd ACM...· 0 citations
Hierarchical Residual Policy Optimization (HRPO), a post-training framework that converts item-level outcomes into dense, token-aligned learning signals for conservative token-wise improvement, is proposed.
Kaifeng Guo, Yiming Yang, Jingtong Gao et al.· Proceedings of the 32nd ACM...· 0 citations
Core Task Attention (CTAtt), a core-task-centric method that employs a novel attention mechanism to adaptively aggregate informative representations from auxiliary tasks into the core task’s prediction tower, and achieves strong performance even when built upon a simple Shared-Bottom architecture.
Jing-Yang Chen, Chen-Ye Sun, Man Zhou et al.· Proceedings of the 20th ACM...· 0 citations
The end-to-end treatment policy delivered a statistically significant $+7.20\% lift in the primary long-term-value metric, demonstrating the feasibility of production-scale causal optimization under business constraints.
Changshuai Wei, John Bencina, Phuc Nguyen et al.· 0 citations
Two key components are introduced: Dual-Relative Policy Optimization (DRPO), a post-training policy optimization method for robust and risk-aware advantage estimation; and Long-term Reward Predictor (LRP), which estimates long-term outcomes by modeling population heterogeneity with disentangled representation learning...
Wei Zhang, Hong-Ji Li, Song Sun et al.· 0 citations
Industrial recommender systems typically integrate multiple objectives—such as clicks, watch time, likes, and follows—to perform a holistic ranking. However, effectively fusing these diverse tasks to reflect overall user satisfaction remains a formidable challenge. Existing approaches struggle with distributional discr...
Qing Luo, Ge Chen, Huayi Shen et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.