REVIEW 2 cited by
Neural Collaborative Filtering vs. Matrix Factorization Revisited
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Embedding based models have been the state of the art in collaborative filtering for over a decade. Traditionally, the dot product or higher order equivalents have been used to combine two or more embeddings, e.g., most notably in matrix factorization. In recent years, it was suggested to replace the dot product with a learned similarity e.g. using a multilayer perceptron (MLP). This approach is often referred to as neural collaborative filtering (NCF). In this work, we revisit the experiments of the NCF paper that popularized learned similarities using MLPs. First, we show that with a proper hyperparameter selection, a simple dot product substantially outperforms the proposed learned similarities. Second, while a MLP can in theory approximate any function, we show that it is non-trivial to learn a dot product with an MLP. Finally, we discuss practical issues that arise when applying MLP based similarities and show that MLPs are too costly to use for item recommendation in production environments while dot products allow to apply very efficient retrieval algorithms. We conclude that MLPs should be used with care as embedding combiner and that dot products might be a better default choice.
Forward citations
Cited by 2 Pith papers
-
On the Role of Weight Decay in Collaborative Filtering: A Popularity Perspective
Weight decay in collaborative filtering primarily encodes item popularity into embedding magnitudes, and a popularity-based initialization, PRISM, can replace it with comparable or better accuracy and faster training.
-
Model-agnostic post-hoc explainability for recommender systems
Deleting each user or item from training data and retraining the model shows which observations help or hurt a recommender's overall performance, a straightforward application of leave-one-out influence analysis.
Discussion (0). Continue with ORCID to comment.