Maximizing Cumulative User Engagement in Sequential Recommendation: An Online Optimization Perspective

• URL: http://arxiv.org/abs/2006.04520v1
• Date: Tue, 2 Jun 2020 09:02:51 GMT
• Title: Maximizing Cumulative User Engagement in Sequential Recommendation: An Online Optimization Perspective
• Authors: Yifei Zhao, Yu-Hang Zhou, Mingdong Ou, Huan Xu, Nan Li
• Abstract summary: It is often needed to tradeoff two potentially conflicting objectives, that is, pursuing higher immediate user engagement and encouraging user browsing. We propose a flexible and practical framework to explicitly tradeoff longer user browsing length and high immediate user engagement. This approach is deployed at a large E-commerce platform, achieved over 7% improvement of cumulative clicks.
• Score: 26.18096797120916
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• CUPID: A Real-Time Session-Based Reciprocal Recommendation System for a One-on-One Social Discovery Platform [12.2116664055055]
  CUPID is a novel approach to session-based reciprocal recommendation systems designed for a real-time one-on-one social discovery platform. CUPID decouples the time-intensive user session modeling from the real-time user matching process to reduce inference time. CUPID reduces response latency by more than 76% compared to non-asynchronous systems.
  arXiv  Detail & Related papers  (2024-10-08T05:44:14Z)
• Quantifying User Coherence: A Unified Framework for Cross-Domain Recommendation Analysis [69.37718774071793]
  This paper introduces novel information-theoretic measures for understanding recommender systems. We evaluate 7 recommendation algorithms across 9 datasets, revealing the relationships between our measures and standard performance metrics.
  arXiv  Detail & Related papers  (2024-10-03T13:02:07Z)
• Prompt Tuning as User Inherent Profile Inference Machine [53.78398656789463]
  We propose UserIP-Tuning, which uses prompt-tuning to infer user profiles. A profile quantization codebook bridges the modality gap by profile embeddings into collaborative IDs. Experiments on four public datasets show that UserIP-Tuning outperforms state-of-the-art recommendation algorithms.
  arXiv  Detail & Related papers  (2024-08-13T02:25:46Z)
• Retrieval Augmentation via User Interest Clustering [57.63883506013693]
  Industrial recommender systems are sensitive to the patterns of user-item engagement. We propose a novel approach that efficiently constructs user interest and facilitates low computational cost inference. Our approach has been deployed in multiple products at Meta, facilitating short-form video related recommendation.
  arXiv  Detail & Related papers  (2024-08-07T16:35:10Z)
• Modeling User Retention through Generative Flow Networks [34.74982897470852]
  Flow-based modeling technique can back-propagate the retention reward towards each recommended item in the user session. We show that the flow combined with traditional learning-to-rank objectives eventually optimized a non-discounted cumulative reward for both immediate user feedback and user retention.
  arXiv  Detail & Related papers  (2024-06-10T06:22:18Z)
• Persona-DB: Efficient Large Language Model Personalization for Response Prediction with Collaborative Data Refinement [79.2400720115588]
  We introduce Persona-DB, a simple yet effective framework consisting of a hierarchical construction process to improve generalization across task contexts. In the evaluation of response prediction, Persona-DB demonstrates superior context efficiency in maintaining accuracy with a significantly reduced retrieval size. Our experiments also indicate a marked improvement of over 10% under cold-start scenarios, when users have extremely sparse data.
  arXiv  Detail & Related papers  (2024-02-16T20:20:43Z)
• RESUS: Warm-Up Cold Users via Meta-Learning Residual User Preferences in CTR Prediction [14.807495564177252]
  Click-Through Rate (CTR) prediction on cold users is a challenging task in recommender systems. We propose a novel and efficient approach named RESUS, which decouples the learning of global preference knowledge contributed by collective users from the learning of residual preferences for individual users. Our approach is efficient and effective in improving CTR prediction accuracy on cold users, compared with various state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-10-28T11:57:58Z)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• RETE: Retrieval-Enhanced Temporal Event Forecasting on Unified Query Product Evolutionary Graph [18.826901341496143]
  Temporal event forecasting is a new user behavior prediction task in a unified query product evolutionary graph. We propose a novel RetrievalEnhanced Event forecasting framework. Unlike existing methods, we propose methods that enhance user representations via roughly connected entities in the whole graph.
  arXiv  Detail & Related papers  (2022-02-12T19:27:56Z)
• TEA: A Sequential Recommendation Framework via Temporally Evolving Aggregations [12.626079984394766]
  We propose a novel sequential recommendation framework based on dynamic user-item heterogeneous graphs. We exploit the conditional random field to aggregate the heterogeneous graphs and user behaviors for probability estimation. We provide scalable and flexible implementations of the proposed framework.
  arXiv  Detail & Related papers  (2021-11-14T15:54:23Z)
• PURS: Personalized Unexpected Recommender System for Improving User Satisfaction [76.98616102965023]
  We describe a novel Personalized Unexpected Recommender System (PURS) model that incorporates unexpectedness into the recommendation process. Extensive offline experiments on three real-world datasets illustrate that the proposed PURS model significantly outperforms the state-of-the-art baseline approaches.
  arXiv  Detail & Related papers  (2021-06-05T01:33:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.