Maximizing Cumulative User Engagement in Sequential Recommendation: An Online Optimization Perspective
To maximize cumulative user engagement (e.g. cumulative clicks) in sequential recommendation, it is often needed to tradeoff two potentially conflicting objectives, that is, pursuing higher immediate user engagement (e.g., click-through rate) and encouraging user browsing (i.e., more items exposured). Existing works often study these two tasks separately, thus tend to result in sub-optimal results. In this paper, we study this problem from an online optimization perspective, and propose a flexible and practical framework to explicitly tradeoff longer user browsing length and high immediate user engagement. Specifically, by considering items as actions, user's requests as states and user leaving as an absorbing state, we formulate each user's behavior as a personalized Markov decision process (MDP), and the problem of maximizing cumulative user engagement is reduced to a stochastic shortest path (SSP) problem. Meanwhile, with immediate user engagement and quit probability estimation, it is shown that the SSP problem can be efficiently solved via dynamic programming. Experiments on real-world datasets demonstrate the effectiveness of the proposed approach. Moreover, this approach is deployed at a large E-commerce platform, achieved over 7% improvement of cumulative clicks.
Code (0)
등록된 구현이 없습니다.
Tasks
Sequential RecommendationSimilar Papers 제목 키워드 기반
Incentivising Exploration and Recommendations for Contextual Bandits with Payments
We propose a contextual bandit based model to capture the learning and social welfare goals of a web platform in the presence of myopic users. By using payments to incentivize these agents to explore different items/reco…
Multi-Armed BanditsModeling User Retention through Generative Flow Networks
Recommender systems aim to fulfill the user's daily demands. While most existing research focuses on maximizing the user's engagement with the system, it has recently been pointed out that how frequently the users come b…
Learning-To-RankRecommendation SystemsLeveraging heterogeneous spillover in maximizing contextual bandit rewards
Recommender systems relying on contextual multi-armed bandits continuously improve relevant item recommendations by taking into account the contextual information. The objective of bandit algorithms is to learn the best …
Multi-Armed BanditsRecommendation SystemsResAct: Reinforcing Long-term Engagement in Sequential Recommendation with Residual Actor
Long-term engagement is preferred over immediate engagement in sequential recommendation as it directly affects product operational metrics such as daily active users (DAUs) and dwell time. Meanwhile, reinforcement learn…
Reinforcement Learning (RL)Sequential RecommendationMeasuring Recency Bias In Sequential Recommendation Systems
Recency bias in a sequential recommendation system refers to the overly high emphasis placed on recent items within a user session. This bias can diminish the serendipity of recommendations and hinder the system's abilit…
Recommendation SystemsSequential Recommendation