The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Neural Collaborative Filtering vs. Matrix Factorization Revisited
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019) · Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) · doi:10.18653/v1/n19-1423 · Cited by 54,325
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
Wu, Y., Schuster, M., Chen, Z., Le, Q. V., Norouzi, M., Macherey, W., Krikun, M., Cao, Y., Gao, Q., Macherey, K., et al. (2016) · arXiv · doi:10.48550/arxiv.1609.08144 · Cited by 5,319
The MovieLens Datasets: History and Context
Harper, F. M., & Konstan, J. A. (2016) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2827872 · Cited by 3,907
Deep Neural Networks for YouTube Recommendations
Covington, P., Adams, J., & Sargin, E. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959190 · Cited by 3,539
Collaborative Filtering for Implicit Feedback Datasets
Hu, Y., Koren, Y., & Volinsky, C. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.22 · Cited by 3,170
Universal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322533223 · Cited by 1,566
Advances in Collaborative Filtering
Koren, Y., & Bell, R. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_5 · Cited by 745
SLIM: Sparse Linear Methods for Top-N Recommender Systems
Ning, X., & Karypis, G. (2011) · 2011 IEEE 11th International Conference on Data Mining · doi:10.1109/icdm.2011.134 · Cited by 714
Leveraging Meta-path based Context for Top- N Recommendation with A Neural Co-Attention Model
Hu, B., Shi, C., Zhao, W. X., & Yu, P. S. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219965 · Cited by 674
A Convergence Theory for Deep Learning via Over-Parameterization
Allen-Zhu, Z., Li, Y., & Song, Z. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.03962 · Cited by 657
An Investigation of Practical Approximate Nearest Neighbor Algorithms
Liu, T., Moore, A., Yang, K., & Gray, A. (2004) · Cited by 375
The BellKor Solution to the Netflix Grand Prize
Koren, Y. (2009) · Cited by 342
Outer Product-based Neural Collaborative Filtering
He, X., Du, X., Wang, X., Tian, F., Tang, J., & Chua, T.-S. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/308 · Cited by 340
Latent Cross: Making Use of Context in Recurrent Recommender Systems
Beutel, A., Covington, P., Jain, S., Xu, C., Li, J., Gatto, V., & Chi, E. H. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159727 · Cited by 313
Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)
Shrivastava, A., & Li, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.5869 · Cited by 242
Learning Image and User Features for Recommendation in Social Networks
Geng, X., Zhang, H., Bian, J., & Chua, T.-S. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.486 · Cited by 218
On the Difficulty of Evaluating Baselines: A Study on Recommender SystemsPreprint
Rendle, S., Zhang, L., & Koren, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.01395 · Cited by 147
Self-citationNeural Personalized Ranking for Image Recommendation
Niu, W., Caverlee, J., & Lu, H. (2018) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3159652.3159728 · Cited by 132
Learning Polynomials with Neural Networks
Andoni, A., Panigrahy, R., Valiant, G. J., & Zhang, L. (2014) · Cited by 112
Self-citationLearning a Joint Search and Recommendation Model from User-Item Interactions
Zamani, H., & Croft, W. B. (2020) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3336191.3371818 · Cited by 67
Sequential Recommendation with Dual Side Neighbor-based Collaborative Relation Modeling
Qin, J., Ren, K., Fang, Y., Zhang, W., & Yu, Y. (2020) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3336191.3371842 · Cited by 59
Improving the Estimation of Tail Ratings in Recommender System with Multi-Latent Representations
Zhao, X., Zhu, Z., Zhang⋆, Y., & Caverlee, J. (2020) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3336191.3371810 · Cited by 25
Cited by
DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems
Wang, R., Shivanna, R., Cheng, D., Jain, S., Lin, D., Hong, L., & Chi, E. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3450078 · Cited by 568
Knowledge Graph Contrastive Learning for Recommendation
Yang, Y., Huang, C., Xia, L., & Li, C. (2022) · Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3477495.3532009 · Cited by 481
Wu, L., He, X., Wang, X., Zhang, K., & Wang, M. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3145690 · Cited by 413
Where to Go Next for Recommender Systems? ID- vs. Modality-based Recommender Models Revisited
Yuan, Z., Yuan, F., Song, Y., Li, Y., Fu, J., Yang, F., Pan, Y., & Ni, Y. (2023) · arXiv · doi:10.48550/arxiv.2303.13835 · Cited by 267
Where to Go Next for Recommender Systems? ID- vs. Modality-based Recommender Models Revisited
Yuan, Z., Yuan, F., Song, Y., Li, Y., Fu, J., Yang, F., Pan, Y., & Ni, Y. (2023) · Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3539618.3591932 · Cited by 200
“, two-tower based DSSM [26, 53] and session-based SASRec [27]) equipped with four powerful ME evaluated on three large-scale”
Method
Metadata
- Authors
- Rendle, S., Krichene, W., Zhang, L., & Anderson, J.
- Venue
- Fourteenth ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2020-09-22
- Pages
- 240-248
- OpenAlex
- W3028108055
- Cited by
- 479
- References
- 31
- FWCI
- 53.98
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.