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
- Emulating Full Client Participation: A Long-Term Client Selection Strategy for Federated Learning [48.94952630292219]
We propose a novel client selection strategy designed to emulate the performance achieved with full client participation.
In a single round, we select clients by minimizing the gradient-space estimation error between the client subset and the full client set.
In multi-round selection, we introduce a novel individual fairness constraint, which ensures that clients with similar data distributions have similar frequencies of being selected.
arXiv Detail & Related papers (2024-05-22T12:27:24Z) - Persona-DB: Efficient Large Language Model Personalization for Response
Prediction with Collaborative Data Refinement [82.56964750522161]
We introduce Persona-DB, a simple framework consisting of a hierarchical construction process to improve generalization across task contexts.
In the task of response forecasting, Persona-DB demonstrates superior efficiency in maintaining accuracy with a significantly reduced retrieval size.
Our experiments also indicate a marked improvement of over 15% under cold-start scenarios, when users have extremely sparse data.
arXiv Detail & Related papers (2024-02-16T20:20:43Z) - TransAct: Transformer-based Realtime User Action Model for
Recommendation at Pinterest [17.247452803197362]
This paper presents Pinterest's ranking architecture for Homefeed.
We propose TransAct, a sequential model that extracts users' short-term preferences from their realtime activities.
We describe the results of ablation studies, the challenges we faced during productionization, and the outcome of an online A/B experiment.
arXiv Detail & Related papers (2023-05-31T23:45:29Z) - Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform.
Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online.
Intent modeling is thus critical for understanding users and optimizing long-term user experience.
arXiv Detail & Related papers (2022-11-17T19:00:24Z) - 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) - Learning Self-Modulating Attention in Continuous Time Space with
Applications to Sequential Recommendation [102.24108167002252]
We propose a novel attention network, named self-modulating attention, that models the complex and non-linearly evolving dynamic user preferences.
We empirically demonstrate the effectiveness of our method on top-N sequential recommendation tasks, and the results on three large-scale real-world datasets show that our model can achieve state-of-the-art performance.
arXiv Detail & Related papers (2022-03-30T03:54:11Z) - 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) - Adaptive Summaries: A Personalized Concept-based Summarization Approach
by Learning from Users' Feedback [0.0]
This paper proposes an interactive concept-based summarization model, called Adaptive Summaries.
The system learns from users' provided information gradually while interacting with the system by giving feedback in an iterative loop.
It helps users make high-quality summaries based on their preferences by maximizing the user-desired content in the generated summaries.
arXiv Detail & Related papers (2020-12-24T18:27:50Z)
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.