Leveraging Cross Feedback of User and Item Embeddings with Attention for Variational Autoencoder based Collaborative Filtering

• URL: http://arxiv.org/abs/2002.09145v3
• Date: Mon, 22 Aug 2022 04:31:20 GMT
• Title: Leveraging Cross Feedback of User and Item Embeddings with Attention for Variational Autoencoder based Collaborative Filtering
• Authors: Yuan Jin, He Zhao, Ming Liu, Ye Zhu, Lan Du, Longxiang Gao, He Zhang, Yunfeng Li
• Abstract summary: We propose a VAE-based Bayesian MF framework to approximate the user-item joint distribution. The framework is iterative with cross feedback of user and item embeddings into each other's encoders. It reconstructs the data via the matrix factorization over the currently re-sampled user and item embeddings.
• Score: 25.569930256022925
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Matrix factorization (MF) has been widely applied to collaborative filtering in recommendation systems. Its Bayesian variants can derive posterior distributions of user and item embeddings, and are more robust to sparse ratings. However, the Bayesian methods are restricted by their update rules for the posterior parameters due to the conjugacy of the priors and the likelihood. Variational autoencoders (VAE) can address this issue by capturing complex mappings between the posterior parameters and the data. However, current research on VAEs for collaborative filtering only considers the mappings based on the explicit data information while the implicit embedding information is overlooked. In this paper, we first derive evidence lower bounds (ELBO) for Bayesian MF models from two viewpoints: user-oriented and item-oriented. Based on the ELBOs, we propose a VAE-based Bayesian MF framework. It leverages not only the data but also the embedding information to approximate the user-item joint distribution. As suggested by the ELBOs, the approximation is iterative with cross feedback of user and item embeddings into each other's encoders. More specifically, user embeddings sampled at the previous iteration are fed to the item-side encoders to estimate the posterior parameters for the item embeddings at the current iteration, and vice versa. The estimation also attends to the cross-fed embeddings to further exploit useful information. The decoder then reconstructs the data via the matrix factorization over the currently re-sampled user and item embeddings.

Related papers

• On the Mechanisms of Collaborative Learning in VAE Recommenders [12.77626224639472]
  Variational Autoencoders (VAEs) are a powerful alternative to matrix factorization for recommendation.<n>We analyze how collaboration arises in VAE-based collaborative filtering (CF) and show it is governed by latent proximity.<n>Our analyses are validated on the Netflix, MovieLens-20M, and Million Song datasets.
  arXiv  Detail & Related papers  (2025-11-10T07:13:58Z)
• DUPRE: Data Utility Prediction for Efficient Data Valuation [49.60564885180563]
  Cooperative game theory-based data valuation, such as Data Shapley, requires evaluating the data utility and retraining the ML model for multiple data subsets. Our framework, textttDUPRE, takes an alternative yet complementary approach that reduces the cost per subset evaluation by predicting data utilities instead of evaluating them by model retraining. Specifically, given the evaluated data utilities of some data subsets, textttDUPRE fits a emphGaussian process (GP) regression model to predict the utility of every other data subset.
  arXiv  Detail & Related papers  (2025-02-22T08:53:39Z)
• Bridging User Dynamics: Transforming Sequential Recommendations with Schrödinger Bridge and Diffusion Models [49.458914600467324]
  We introduce the Schr"odinger Bridge into diffusion-based sequential recommendation models, creating the SdifRec model. We also propose an extended version of SdifRec called con-SdifRec, which utilizes user clustering information as a guiding condition.
  arXiv  Detail & Related papers  (2024-08-30T09:10:38Z)
• Personalized Federated Collaborative Filtering: A Variational AutoEncoder Approach [49.63614966954833]
  Federated Collaborative Filtering (FedCF) is an emerging field focused on developing a new recommendation framework with preserving privacy. This paper proposes a novel personalized FedCF method by preserving users' personalized information into a latent variable and a neural model simultaneously. To effectively train the proposed framework, we model the problem as a specialized Variational AutoEncoder (VAE) task by integrating user interaction vector reconstruction with missing value prediction.
  arXiv  Detail & Related papers  (2024-08-16T05:49:14Z)
• MMGRec: Multimodal Generative Recommendation with Transformer Model [81.61896141495144]
  MMGRec aims to introduce a generative paradigm into multimodal recommendation. We first devise a hierarchical quantization method Graph CF-RQVAE to assign Rec-ID for each item from its multimodal information. We then train a Transformer-based recommender to generate the Rec-IDs of user-preferred items based on historical interaction sequences.
  arXiv  Detail & Related papers  (2024-04-25T12:11:27Z)
• Item-based Variational Auto-encoder for Fair Music Recommendation [1.8782288713227568]
  The EvalRS DataChallenge aims to build a more realistic recommender system considering accuracy, fairness, and diversity in evaluation. Our proposed system is based on an ensemble between an item-based variational auto-encoder (VAE) and a Bayesian personalized ranking matrix factorization (BPRMF)
  arXiv  Detail & Related papers  (2022-10-24T06:42:16Z)
• The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm [154.47590401735323]
  Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems. This paper focuses on a challenging scenario where a user has multiple categories of interests. We propose a novel method called textitDiversity-Promoting Collaborative Metric Learning (DPCML)
  arXiv  Detail & Related papers  (2022-09-30T08:02:18Z)
• SUPER-Rec: SUrrounding Position-Enhanced Representation for Recommendation [5.5362209010481855]
  Collaborative filtering problems are commonly solved based on matrix completion techniques. This paper proposes a novel position-enhanced user/item representation training model for recommendation, SUPER-Rec.
  arXiv  Detail & Related papers  (2022-09-09T07:24:55Z)
• Does Recommend-Revise Produce Reliable Annotations? An Analysis on Missing Instances in DocRED [60.39125850987604]
  We show that a textit-revise scheme results in false negative samples and an obvious bias towards popular entities and relations. The relabeled dataset is released to serve as a more reliable test set of document RE models.
  arXiv  Detail & Related papers  (2022-04-17T11:29:01Z)
• Transfer of codebook latent factors for cross-domain recommendation with non-overlapping data [5.145146101802871]
  Data Sparsity is one of the major drawbacks with collaborative filtering technique. In this paper, we come up with a novel transfer learning approach for cross-domain recommendation.
  arXiv  Detail & Related papers  (2022-03-26T05:26:39Z)
• Consistent Collaborative Filtering via Tensor Decomposition [0.2578242050187029]
  Collaborative filtering is the de facto standard for analyzing users' activities and building recommendation systems for items. We develop Sliced Anti-symmetric Decomposition (SAD), a new model for collaborative filtering based on implicit feedback. We demonstrate the efficiency of SAD in both simulated and real world datasets containing over 1M user-item interactions.
  arXiv  Detail & Related papers  (2022-01-28T05:14:37Z)
• Sparse-Interest Network for Sequential Recommendation [78.83064567614656]
  We propose a novel textbfSparse textbfInterest textbfNEtwork (SINE) for sequential recommendation. Our sparse-interest module can adaptively infer a sparse set of concepts for each user from the large concept pool. SINE can achieve substantial improvement over state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-02-18T11:03:48Z)
• A Refined SVD Algorithm for Collaborative Filtering [0.0]
  Collaborative filtering tries to predict the ratings of a user over some items based on opinions of other users with similar taste. Various approaches to collaborative filtering exist, some of the most popular ones being the Singular Value Decomposition (SVD) and K-means clustering.
  arXiv  Detail & Related papers  (2020-12-13T00:04:11Z)
• Modurec: Recommender Systems with Feature and Time Modulation [50.51144496609274]
  We propose Modurec: an autoencoder-based method that combines all available information using the feature-wise modulation mechanism. We show on Movielens datasets that these modifications produce state-of-the-art results in most evaluated settings.
  arXiv  Detail & Related papers  (2020-10-13T09:18:33Z)

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.