Automatic Representation for Lifetime Value Recommender Systems
Assaf Hallak, Yishay Mansour, Elad Yom-Tov

TL;DR
This paper introduces an automated RL-based architecture for lifetime value recommender systems that simplifies representation learning and is validated on real-world offline data.
Contribution
It proposes a novel architecture that automates state-space representation in RL for recommendations, reducing the need for manual feature engineering.
Findings
Effective on real-world offline recommendation data
Simplifies RL integration in recommender systems
Addresses practical challenges in RL-based recommendations
Abstract
Many modern commercial sites employ recommender systems to propose relevant content to users. While most systems are focused on maximizing the immediate gain (clicks, purchases or ratings), a better notion of success would be the lifetime value (LTV) of the user-system interaction. The LTV approach considers the future implications of the item recommendation, and seeks to maximize the cumulative gain over time. The Reinforcement Learning (RL) framework is the standard formulation for optimizing cumulative successes over time. However, RL is rarely used in practice due to its associated representation, optimization and validation techniques which can be complex. In this paper we propose a new architecture for combining RL with recommendation systems which obviates the need for hand-tuned features, thus automating the state-space representation construction process. We analyze the…
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
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research · Smart Grid Energy Management
