Implicit optimal variational collaborative filtering
TL;DR: In this article , an implicit optimal variational autoencoder model for collaborative filtering (IOVA-CF) is proposed, which utilizes a novel implicit optimal prior, which aids in generating excellent latent representations.
read more
Abstract: Abstract Recently, variational autoencoder (VAE), a model that supports Bayesian inference and variational posterior distribution approximation, has been used to address the prevailing challenge of inefficient modelling of non-linear user-item interactions in collaborative filtering (CF). However, the choices of prior distributions in these VAE-based CF models are inadequate to determine the underlying distributions, leading to skewed maximum likelihood estimation of model parameters. In this paper, we present an Implicit Optimal Variational autoencoder model for collaborative filtering (IOVA-CF) to alleviate this challenge. Specifically, IOVA-CF utilizes a novel implicit optimal prior, which aids in generating excellent latent representations. This implicit optimal prior (IoP) is an aggregated posterior prior (AP), that is, the posterior’s expectation of the data distribution. However, unlike previous AP, IoP utilizes the density ratio technique to compute the Kullback-Leibler (KL) divergence without explicitly capturing the aggregated posterior. Besides, we can calculate the KL divergence between the aggregated posterior and the inference network in a closed-form using the density ratio technique, making IoP an optimal prior for maximizing the objective function. Additionally, unlike earlier VAE-based recommendation models, IOVA-CF significantly alleviates the over-regularization issue. Furthermore, IOVA-CF can adequately capture the latent space’s uncertainty. Finally, empirical evaluations with several competitive baseline models on four (4) real-world datasets reveal the superior performance of IOVA-CF.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Weight normalization optimization movie recommendation algorithm based on three-way neural interaction networks
Zhenlu Liang,Zhisheng Yang,Jingyong Cheng +2 more
- 27 Apr 2023
TL;DR: In this article , a weight-normalized movie recommendation model (SCLW_MCRec) based on a three-way neural interaction network is proposed to better apply the interaction information.
4
References
Generative Adversarial Nets
Ian Goodfellow,Jean Pouget-Abadie,Mehdi Mirza,Bing Xu,David Warde-Farley,Sherjil Ozair,Aaron Courville,Yoshua Bengio +7 more
- 08 Dec 2014
TL;DR: A new framework for estimating generative models via an adversarial process, in which two models are simultaneously train: a generative model G that captures the data distribution and a discriminative model D that estimates the probability that a sample came from the training data rather than G.
•Proceedings Article
Auto-Encoding Variational Bayes
Diederik P. Kingma,Max Welling +1 more
- 01 Jan 2014
TL;DR: A stochastic variational inference and learning algorithm that scales to large datasets and, under some mild differentiability conditions, even works in the intractable case is introduced.
Matrix Factorization Techniques for Recommender Systems
TL;DR: As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels.
Neural Collaborative Filtering
Xiangnan He,Lizi Liao,Hanwang Zhang,Liqiang Nie,Xia Hu,Tat-Seng Chua +5 more
- 03 Apr 2017
TL;DR: This work strives to develop techniques based on neural networks to tackle the key problem in recommendation --- collaborative filtering --- on the basis of implicit feedback, and presents a general framework named NCF, short for Neural network-based Collaborative Filtering.
•Proceedings Article
Probabilistic Matrix Factorization
Andriy Mnih,Ruslan Salakhutdinov +1 more
- 03 Dec 2007
TL;DR: The Probabilistic Matrix Factorization (PMF) model is presented, which scales linearly with the number of observations and performs well on the large, sparse, and very imbalanced Netflix dataset and is extended to include an adaptive prior on the model parameters.