Convolutional Gaussian Embeddings for Personalized Recommendation with
Uncertainty
- URL: http://arxiv.org/abs/2006.10932v1
- Date: Fri, 19 Jun 2020 02:10:38 GMT
- Title: Convolutional Gaussian Embeddings for Personalized Recommendation with
Uncertainty
- Authors: Junyang Jiang and Deqing Yang and Yanghua Xiao and Chenlu Shen
- Abstract summary: Most existing embedding based recommendation models use embeddings corresponding to a single fixed point in low-dimensional space.
We propose a unified deep recommendation framework employing Gaussian embeddings, which are proven adaptive to uncertain preferences.
Our framework adopts Monte-Carlo sampling and convolutional neural networks to compute the correlation between the objective user and the candidate item.
- Score: 17.258674767363345
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Most of existing embedding based recommendation models use embeddings
(vectors) corresponding to a single fixed point in low-dimensional space, to
represent users and items. Such embeddings fail to precisely represent the
users/items with uncertainty often observed in recommender systems. Addressing
this problem, we propose a unified deep recommendation framework employing
Gaussian embeddings, which are proven adaptive to uncertain preferences
exhibited by some users, resulting in better user representations and
recommendation performance. Furthermore, our framework adopts Monte-Carlo
sampling and convolutional neural networks to compute the correlation between
the objective user and the candidate item, based on which precise
recommendations are achieved. Our extensive experiments on two benchmark
datasets not only justify that our proposed Gaussian embeddings capture the
uncertainty of users very well, but also demonstrate its superior performance
over the state-of-the-art recommendation models.
Related papers
- Towards a Theoretical Understanding of Two-Stage Recommender Systems [0.5439020425819]
Production-grade recommender systems rely heavily on a large-scale corpus used by online media services, including Netflix, Pinterest, and Amazon.
We study the behaviors of the two-stage recommender that entail a strong convergence to the optimal recommender system.
We show numerically that the two-stage recommender enables encapsulating the impacts of items' and users' attributes on ratings.
arXiv Detail & Related papers (2024-02-23T21:11:55Z) - Recommendation with User Active Disclosing Willingness [20.306413327597603]
We study a novel recommendation paradigm, where the users are allowed to indicate their "willingness" on disclosing different behaviors.
We conduct extensive experiments to demonstrate the effectiveness of our model on balancing the recommendation quality and user disclosing willingness.
arXiv Detail & Related papers (2022-10-25T04:43:40Z) - Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
We show how to return a set of items rigorously guaranteed to contain mostly good items.
Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate.
We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
arXiv Detail & Related papers (2022-07-04T17:49:25Z) - Debiasing Learning for Membership Inference Attacks Against Recommender
Systems [79.48353547307887]
Learned recommender systems may inadvertently leak information about their training data, leading to privacy violations.
We investigate privacy threats faced by recommender systems through the lens of membership inference.
We propose a Debiasing Learning for Membership Inference Attacks against recommender systems (DL-MIA) framework that has four main components.
arXiv Detail & Related papers (2022-06-24T17:57:34Z) - Introducing a Framework and a Decision Protocol to Calibrate Recommender
Systems [0.0]
This paper proposes an approach to create recommendation lists with a calibrated balance of genres.
The main claim is that calibration can contribute positively to generate fairer recommendations.
We propose a conceptual framework and a decision protocol to generate more than one thousand combinations of calibrated systems.
arXiv Detail & Related papers (2022-04-07T19:30:55Z) - CausPref: Causal Preference Learning for Out-of-Distribution
Recommendation [36.22965012642248]
The current recommender system is still vulnerable to the distribution shift of users and items in realistic scenarios.
We propose to incorporate the recommendation-specific DAG learner into a novel causal preference-based recommendation framework named CausPref.
Our approach surpasses the benchmark models significantly under types of out-of-distribution settings.
arXiv Detail & Related papers (2022-02-08T16:42:03Z) - Top-N Recommendation with Counterfactual User Preference Simulation [26.597102553608348]
Top-N recommendation, which aims to learn user ranking-based preference, has long been a fundamental problem in a wide range of applications.
In this paper, we propose to reformulate the recommendation task within the causal inference framework to handle the data scarce problem.
arXiv Detail & Related papers (2021-09-02T14:28:46Z) - Control Variates for Slate Off-Policy Evaluation [112.35528337130118]
We study the problem of off-policy evaluation from batched contextual bandit data with multidimensional actions.
We obtain new estimators with risk improvement guarantees over both the PI and self-normalized PI estimators.
arXiv Detail & Related papers (2021-06-15T06:59:53Z) - 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) - Latent Unexpected Recommendations [89.2011481379093]
We propose to model unexpectedness in the latent space of user and item embeddings, which allows to capture hidden and complex relations between new recommendations and historic purchases.
In addition, we develop a novel Latent Closure (LC) method to construct hybrid utility function and provide unexpected recommendations based on the proposed model.
arXiv Detail & Related papers (2020-07-27T02:39:30Z) - Reward Constrained Interactive Recommendation with Natural Language
Feedback [158.8095688415973]
We propose a novel constraint-augmented reinforcement learning (RL) framework to efficiently incorporate user preferences over time.
Specifically, we leverage a discriminator to detect recommendations violating user historical preference.
Our proposed framework is general and is further extended to the task of constrained text generation.
arXiv Detail & Related papers (2020-05-04T16:23:34Z)
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.