Recommenders / Foundations
verifiedCollaborative Filtering
Recommend to you what people like you liked. No understanding of the items is required — the pattern of who interacted with what is enough, and it works better than describing the items usually does. The whole approach rests on there being enough overlap between users to infer from, which is exactly what it lacks for anything new.
The practical divide is not algorithmic but between explicit and implicit signal. Ratings are scarce, biased toward the extremes, and largely absent; clicks and plays are abundant and mean something weaker. Almost every deployed system is implicit, which changes the problem from regression on observed ratings to ranking under an unobserved negative set.
Represent the interaction matrix R with users as rows and items as columns, overwhelmingly unobserved — densities below 1% are normal. Predict the missing entries from the observed ones under an assumption that R is approximately low rank, meaning a small number of latent factors explain most of who interacts with what.
observed holds 8% of the budget; rest holds the remaining 92%.
Interactions actually observed against the pairs never seen, in equal units. Drag the density up to watch the matrix fill — a real one sits at the far left, under one percent observed.
Reviewed by opendroid · 2026-08-18
- arXiv:1708.05031 — Neural Collaborative Filtering
- arXiv:1907.06902 — Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches
Origin · not linkable
- Koren et al. 2009 — Matrix Factorization Techniques for Recommender Systems · IEEE Computer 42(8) · doi:10.1109/MC.2009.263