Offline Meta-level Model-based Reinforcement Learning Approach for Cold-Start Recommendation
Yanan Wang, Yong Ge, Li Li, Rui Chen, Tong Xu

TL;DR
This paper introduces a meta-level model-based reinforcement learning method that enables recommender systems to quickly adapt to new users with limited interactions by inferring user preferences and recovering policies efficiently.
Contribution
It proposes a novel meta-level RL approach with inverse reinforcement learning for fast cold-start user adaptation in recommender systems.
Findings
Effective adaptation to new users with only one interaction sequence
Improved recommendation performance in cold-start scenarios
Theoretical bounds on recommendation performance
Abstract
Reinforcement learning (RL) has shown great promise in optimizing long-term user interest in recommender systems. However, existing RL-based recommendation methods need a large number of interactions for each user to learn a robust recommendation policy. The challenge becomes more critical when recommending to new users who have a limited number of interactions. To that end, in this paper, we address the cold-start challenge in the RL-based recommender systems by proposing a meta-level model-based reinforcement learning approach for fast user adaptation. In our approach, we learn to infer each user's preference with a user context variable that enables recommendation systems to better adapt to new users with few interactions. To improve adaptation efficiency, we learn to recover the user policy and reward from only a few interactions via an inverse reinforcement learning method to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Reinforcement Learning in Robotics · Recommender Systems and Techniques
