MétaCan
Menu
Back to cohort
Record W2056720645 · doi:10.1145/2554850.2554925

Comparing the staples in latent factor models for recommender systems

2014· article· en· W2056720645 on OpenAlexaff
Cheng Chen, Lantian Zheng, Alex Thomo, Kui Wu, Venkatesh Srinivasan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRecommender Systems and Techniques
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsRecommender systemFactor (programming language)Computer scienceProbabilistic latent semantic analysisFactor analysisInformation retrievalArtificial intelligenceMachine learningProgramming language

Abstract

fetched live from OpenAlex

Since the Netflix Prize competition, latent factor models (LFMs) have become the comparison "staples" for many of the recent recommender methods. The performance improvement of LFMs over baseline approaches, however, hovers at only low percentage numbers. Therefore, it is time for a better understanding of their real power beyond the overall RMSE (root-mean-square error), which as it happens, lies at a very compressed range, without providing too much chance for deeper insight. This paper provides a detailed experimental study regarding the performance of classical staple LFMs on a classical dataset, Movielens 1M1, that sheds light on a much more pronounced excellence of LFMs for particular categories of users and items, for RMSE and other measures. In particular, LFMs exhibit surprising and excellent advantages when handling several difficult user and item categories. By comparing the distributions of the test and predicted ratings, we show that the performance of LFMs is influenced by the rating distribution. We then propose a method to estimate the performance of LFMs for a given rating dataset. Also, we provide a very simple, open-source, library that implements staple LFMs achieving a similar performance as some very recent (2013) developments in LFMs, and at the same time being more transparent than some other libraries in wide use.

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.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.982
Threshold uncertainty score0.283

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

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.

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

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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicRecommender Systems and TechniquesFrench-language works237,207