mlsanityData to 14 Oct 2026

Pre-train and Fine-tune: Recommenders as Large Models

arXiv 2501.14268 ↗First posted 24 Jan 2025cs.IR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

In reality, users have different interests in different periods, regions, scenes, etc. Such changes in interest are so drastic that they are difficult to be captured by recommenders. Existing multi-domain learning can alleviate this problem. However, the structure of the industrial recommendation system is complex, the amount of data is huge, and the training cost is extremely high, so it is difficult to modify the structure of the industrial recommender and re-train it. To fill this gap, we consider recommenders as large pre-trained models and fine-tune them. We first propose the theory of the information bottleneck for fine-tuning and present an explanation for the fine-tuning technique in recommenders. To tailor for recommendation, we design an information-aware adaptive kernel (IAK) technique to fine-tune the pre-trained recommender. Specifically, we define fine-tuning as two phases: knowledge compression and knowledge matching and let the training stage of IAK explicitly approximate these two phases. Our proposed approach designed from the essence of fine-tuning is well interpretable. Extensive online and offline experiments show the superiority of our proposed method. Besides, we also share unique and important lessons we learned when deploying the method in a large-scale online platform. We also present the potential issues of fine-tuning techniques in recommendation systems and the corresponding solutions. The recommender with IAK technique has been deployed on the homepage of a billion-scale online food platform for several months and has yielded considerable profits in our business.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 23 of its 62 references that are in the map. First posted on arXiv 24 Jan 2025.

Builds on

23 of 62 references.

References · 23

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  4. 2017Deep reinforcement learning from human preferencescited by 3,912
  5. 2017A Survey on Multi-Task Learningcited by 840
  6. 2015Deep Learning and the Information Bottleneck Principlecited by 802
  7. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 419
  8. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
  9. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 240
  10. 2023Is ChatGPT a Good Recommender? A Preliminary Studycited by 193
  11. 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 173
  12. 2020A Simple Convergence Proof of Adam and Adagradcited by 171
11 more
  1. 2020Graph Information Bottleneckcited by 168
  2. 2018Conversational Recommender Systemcited by 115
  3. 2021One Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Predictioncited by 78
  4. 2021End-to-End User Behavior Retrieval in Click-Through RatePrediction Modelcited by 45
  5. 2019Learnability for the Information Bottleneckcited by 24
  6. 2021SAR-Net: A Scenario-Aware Ranking Network for Personalized Fair Recommendation in Hundreds of Travel Scenarioscited by 23
  7. 2022Adaptive Domain Interest Network for Multi-domain Recommendationcited by 20
  8. 2023Multi-domain Recommendation with Embedding Disentangling and Domain Alignmentcited by 7
  9. 2023ESMC: Entire Space Multi-Task Model for Post-Click Conversion Rate via Parameter Constraintcited by 3
  10. 2023Mitigating Mainstream Bias in Recommendation via Cost-sensitive Learningcited by 1
  11. 2023Mobile Supply: The Last Piece of Jigsaw of Recommender Systemcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.