mlsanityData to 7 Oct 2026

How to Retrain Recommender System? A Sequential Meta-Learning Method

arXiv 2005.13258 ↗First posted 27 May 2020cs.IRcited by 42

Not on the map. Why?

Abstract (arXiv)

Practical recommender systems need be periodically retrained to refresh the model with new interaction data. To pursue high model fidelity, it is usually desirable to retrain the model on both historical and new data, since it can account for both long-term and short-term user preference. However, a full model retraining could be very time-consuming and memory-costly, especially when the scale of historical data is large. In this work, we study the model retraining mechanism for recommender systems, a topic of high practical values but has been relatively little explored in the research community. Our first belief is that retraining the model on historical data is unnecessary, since the model has been trained on it before. Nevertheless, normal training on new data only may easily cause overfitting and forgetting issues, since the new data is of a smaller scale and contains fewer information on long-term user preference. To address this dilemma, we propose a new training method, aiming to abandon the historical data during retraining through learning to transfer the past training experience. Specifically, we design a neural network-based transfer component, which transforms the old model to a new model that is tailored for future recommendations. To learn the transfer component well, we optimize the "future performance" -- i.e., the recommendation accuracy evaluated in the next time period. Our Sequential Meta-Learning(SML) method offers a general training paradigm that is applicable to any differentiable model. We demonstrate SML on matrix factorization and conduct experiments on two real-world datasets. Empirical results show that SML not only achieves significant speed-up, but also outperforms the full model retraining in recommendation accuracy, validating the effectiveness of our proposals. We release our codes at: https://github.com/zyang1580/SML.

Key facts. Cited by 42 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 May 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 11; 2022: 12; 2023: 4; 2024: 9; 2025: 6.

42 papers.

Sort:

By area:

  1. 2022Recommendation Unlearningcited by 71
  2. 2023OneNet: Enhancing Time Series Forecasting Models under Concept Drift by Online Ensemblingcited by 71
  3. 2021AutoDebias: Learning to Debias for Recommendationcited by 68
  4. 2023Ensuring User-side Fairness in Dynamic Recommender Systemscited by 27
  5. 2021Cross-Market Product Recommendationcited by 22
  6. 2023DoubleAdapt: A Meta-learning Approach to Incremental Learning for Stock Trend Forecastingcited by 21
  7. 2021User Response Prediction in Online Advertisingcited by 15
  8. 2021Causal Incremental Graph Convolution for Recommender System Retrainingcited by 14
  9. 2022RETE: Retrieval-Enhanced Temporal Event Forecasting on Unified Query Product Evolutionary Graphcited by 11
  10. 2022KEEP: An Industrial Pre-Training Framework for Online Recommendation via Knowledge Extraction and Pluggingcited by 11
  11. 2024Deep Configuration Performance Learning: A Systematic Survey and Taxonomycited by 8
  12. 2022Online Caching with Optimistic Learningcited by 7
30 more
  1. 2022Meta-Learning for Online Update of Recommender Systemscited by 6
  2. 2021CMML: Contextual Modulation Meta Learning for Cold-Start Recommendationcited by 4
  3. 2021Adversarial Gradient Driven Exploration for Deep Click-Through Rate Predictioncited by 4
  4. 2022Online Caching with no Regret: Optimistic Learning via Recommendationscited by 4
  5. 2022Lightweight Compositional Embeddings for Incremental Streaming Recommendationcited by 3
  6. 2022Future Gradient Descent for Adapting the Temporal Shifting Data Distribution in Online Recommendation Systemscited by 3
  7. 2022On the Permanence of Backdoors in Evolving Modelscited by 2
  8. 2024Improving conversion rate prediction via self-supervised pre-training in online advertisingcited by 2
  9. 2024Towards Stable Machine Learning Model Retraining via Slowly Varying Sequencescited by 2
  10. 2024Fair Recommendations with Limited Sensitive Attributes: A Distributionally Robust Optimization Approachcited by 2
  11. 2024Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendationcited by 2
  12. 2024Adversarial Attacks on Data Attributioncited by 2
  13. 2025HAKES: Scalable Vector Database for Embedding Search Servicecited by 2
  14. 2025Efficient Multimodal Streaming Recommendation via Expandable Side Mixture-of-Expertscited by 2
  15. 2025Ultra Fast Warm Start Solution for Graph Recommendationscited by 2
  16. 2021Learning to Learn a Cold-start Sequential Recommendercited by 1
  17. 2023CPMR: Context-Aware Incremental Sequential Recommendation with Pseudo-Multi-Task Learningcited by 1
  18. 2024Better Late Than Never: Formulating and Benchmarking Recommendation Editingcited by 1
  19. 2025From Aggregation to Selection: User-Validated Distributed Social Recommendationcited by 1
  20. 2021Online Interaction Detection for Click-Through Rate Predictioncited by 0
  21. 2021Next Period Recommendation Reality Checkcited by 0
  22. 2021Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Modelscited by 0
  23. 2021Leaping Through Time with Gradient-based Adaptation for Recommendationcited by 0
  24. 2022CVTT: Cross-Validation Through Timecited by 0
  25. 2022Situating Recommender Systems in Practice: Towards Inductive Learning and Incremental Updatescited by 0
  26. 2022Meta-Shop: Improving Item Advertisement For Small Businessescited by 0
  27. 2024FINED: Feed Instance-Wise Information Need with Essential and Disentangled Parametric Knowledge from the Pastcited by 0
  28. 2024Automatic Self-supervised Learning for Social Recommendationscited by 0
  29. 2025Feature Staleness Aware Incremental Learning for CTR Predictioncited by 0
  30. 2025MEGG: Replay via Maximally Extreme GGscore in Incremental Learning for Neural Recommendation Modelscited by 0