MétaCan
← all works

Bayesian probabilistic matrix factorization using Markov chain Monte Carlo

2008· article· en· 1,453 citations· W2085040216 on OpenAlex· 10.1145/1390156.1390267

Why is this work in the frame?

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

Canadian affiliationAn author listed a Canadian institution. This is the only route the usual frame has.
Canadian funderA Canadian agency funded it. The work may carry no Canadian affiliation at all.

Machine scores (provisional)

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Opus teacher head0.022
GPT teacher head0.235
Teacher spread
0.213 · how far apart the two teachers sit on this one work
Validation status
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Abstract

Low-rank matrix approximation methods provide one of the simplest and most effective approaches to collaborative filtering. Such models are usually fitted to data by finding a MAP estimate of the model parameters, a procedure that can be performed efficiently even on very large datasets. However, unless the regularization parameters are tuned carefully, this approach is prone to overfitting because it finds a single point estimate of the parameters. In this paper we present a fully Bayesian treatment of the Probabilistic Matrix Factorization (PMF) model in which model capacity is controlled automatically by integrating over all model parameters and hyperparameters. We show that Bayesian PMF models can be efficiently trained using Markov chain Monte Carlo methods by applying them to the Netflix dataset, which consists of over 100 million movie ratings. The resulting models achieve significantly higher prediction accuracy than PMF models trained using MAP estimation.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

The record

Venue
Topic
Sparse and Compressive Sensing Techniques
Field
Engineering
Canadian institutions
University of Toronto
Funders
Natural Sciences and Engineering Research Council of Canada
Keywords
Markov chain Monte CarloOverfittingComputer scienceHyperparameterBayesian probabilityProbabilistic logicVariable-order Bayesian networkMarkov chainMatrix decompositionMonte Carlo methodArtificial intelligenceGraphical modelAlgorithmBayesian inferenceMachine learningMathematicsStatisticsArtificial neural network
Has abstract in OpenAlex
yes