Bayesian Probabilistic Matrix Factorization
Matrix factorization is a widely used technique in recommendation systems. Probabilistic Matrix Factorization (PMF) [1] extends traditional matrix factorization by incorporating probability distributions over latent factors, allowing for uncertainty quantification. However, computing the posterior distribution is intractable due to the high-dimensional integral. To address this, we employ two Bayesian inference methods: Markov Chain Monte Carlo (MCMC) [2] and Variational Inference (VI) [3] to approximate the posterior. We evaluate their performance on MovieLens dataset and compare their convergence speed, predictive accuracy, and computational efficiency. Experimental results demonstrate that VI offers faster convergence, while MCMC provides more accurate posterior estimates.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian InferenceComputational EfficiencyRecommendation SystemsUncertainty QuantificationVariational InferenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Linearly constrained Bayesian matrix factorization for blind source separation
We present a general Bayesian approach to probabilistic matrix factorization subject to linear constraints. The approach is based on a Gaussian observation model and Gaussian priors with bilinear equality and inequality …
blind source separationA Bayesian Perspective for Determinant Minimization Based Robust Structured Matrix Factorizatio
We introduce a Bayesian perspective for the structured matrix factorization problem. The proposed framework provides a probabilistic interpretation for existing geometric methods based on determinant minimization. We mod…
Bayesian Probabilistic Matrix Factorization: A User Frequency Analysis
Matrix factorization (MF) has become a common approach to collaborative filtering, due to ease of implementation and scalability to large data sets. Two existing drawbacks of the basic model is that it does not incorpora…
Collaborative FilteringVariational InferenceFlexible and Hierarchical Prior for Bayesian Nonnegative Matrix Factorization
In this paper, we introduce a probabilistic model for learning nonnegative matrix factorization (NMF) that is commonly used for predicting missing values and finding hidden patterns in the data, in which the matrix facto…
Bayesian InferenceMissing ValuesKernelized Bayesian Matrix Factorization
We extend kernelized matrix factorization with a fully Bayesian treatment and with an ability to work with multiple side information sources expressed as different kernels. Kernel functions have been introduced to matrix…
Recommendation Systems