Meta-Learning for Online Update of Recommender Systems
Not on the map. Why?
Abstract (arXiv)
Online recommender systems should be always aligned with users' current interest to accurately suggest items that each user would like. Since user interest usually evolves over time, the update strategy should be flexible to quickly catch users' current interest from continuously generated new user-item interactions. Existing update strategies focus either on the importance of each user-item interaction or the learning rate for each recommender parameter, but such one-directional flexibility is insufficient to adapt to varying relationships between interactions and parameters. In this paper, we propose MeLON, a meta-learning based novel online recommender update strategy that supports two-directional flexibility. It is featured with an adaptive learning rate for each parameter-interaction pair for inducing a recommender to quickly learn users' up-to-date interest. The procedure of MeLON is optimized following a meta-learning approach: it learns how a recommender learns to generate the optimal learning rates for future updates. Specifically, MeLON first enriches the meaning of each interaction based on previous interactions and identifies the role of each parameter for the interaction; and then combines these two pieces of information to generate an adaptive learning rate. Theoretical analysis and extensive evaluation on three real-world online recommender datasets validate the effectiveness of MeLON.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 13 of its 29 references that are in the map. First posted on arXiv 19 Mar 2022.
Builds on
13 of 29 references.
References · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Graph Attention Networkscited by 8,923
- 2017Neural Collaborative Filteringcited by 1,111
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
- 2019Neural Graph Collaborative Filteringcited by 661
- 2016Learning to learn by gradient descent by gradient descentcited by 620
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
- 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 379
- 2019Online Meta-Learningcited by 137
- 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 101
- 2020How to Retrain Recommender System? A Sequential Meta-Learning Methodcited by 42
1 more
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 1.
6 papers.
- 2023Ensuring User-side Fairness in Dynamic Recommender Systemscited by 27
- 2022Meta Policy Learning for Cold-Start Conversational Recommendationcited by 6
- 2023Robust Graph Clustering via Meta Weighting for Noisy Graphscited by 5
- 2024LiMAML: Personalization of Deep Recommender Models via Meta Learningcited by 2
- 2025Efficient Multimodal Streaming Recommendation via Expandable Side Mixture-of-Expertscited by 2
- 2023STAG: Enabling Low Latency and Low Staleness of GNN-based Services with Dynamic Graphscited by 1
- 2025Efficient Multimodal Streaming Recommendation via Expandable Side Mixture-of-Experts8 Aug 2025
- 2024LiMAML: Personalization of Deep Recommender Models via Meta Learning23 Feb 2024
- 2023Robust Graph Clustering via Meta Weighting for Noisy Graphs1 Nov 2023
- 2023STAG: Enabling Low Latency and Low Staleness of GNN-based Services with Dynamic Graphs27 Sep 2023
- 2023Ensuring User-side Fairness in Dynamic Recommender Systems29 Aug 2023
- 2022Meta Policy Learning for Cold-Start Conversational Recommendation24 May 2022