mlsanityData to 7 Oct 2026

Rethinking Neural vs. Matrix-Factorization Collaborative Filtering: the Theoretical Perspectives

arXiv 2110.12141 ↗First posted 23 Oct 2021cs.IR cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

The recent work by Rendle et al. (2020), based on empirical observations, argues that matrix-factorization collaborative filtering (MCF) compares favorably to neural collaborative filtering (NCF), and conjectures the dot product's superiority over the feed-forward neural network as similarity function. In this paper, we address the comparison rigorously by answering the following questions: 1. what is the limiting expressivity of each model; 2. under the practical gradient descent, to which solution does each optimization path converge; 3. how would the models generalize under the inductive and transductive learning setting. Our results highlight the similar expressivity for the overparameterized NCF and MCF as kernelized predictors, and reveal the relation between their optimization paths. We further show their different generalization behaviors, where MCF and NCF experience specific tradeoff and comparison in the transductive and inductive collaborative filtering setting. Lastly, by showing a novel generalization result, we reveal the critical role of correcting exposure bias for model evaluation in the inductive setting. Our results explain some of the previously observed conflicts, and we provide synthetic and real-data experiments to shed further insights to this topic.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 33 of its 66 references that are in the map. First posted on arXiv 23 Oct 2021.

Builds on

33 of 66 references.

References · 33

  1. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  2. 2017Neural Collaborative Filteringcited by 1,108
  3. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
  4. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  5. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
  6. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  7. 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
  8. 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 413
  9. 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
  10. 2015An Introduction to Matrix Concentration Inequalitiescited by 391
  11. 2017Implicit Regularization in Matrix Factorizationcited by 318
  12. 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
21 more
  1. 2019Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networkscited by 290
  2. 2017Size-Independent Sample Complexity of Neural Networkscited by 289
  3. 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 267
  4. 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 259
  5. 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
  6. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
  7. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  8. 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
  9. 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 146
  10. 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
  11. 2017Deep Learning based Recommender System: A Survey and New Perspectivescited by 136
  12. 2018Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernelcited by 131
  13. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  14. 2018Offline A/B testing for Recommender Systemscited by 94
  15. 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
  16. 2015Modeling User Exposure in Recommendationcited by 69
  17. 2021Understanding the role of importance weighting for deep learningcited by 38
  18. 2014Transductive Rademacher Complexity and its Applicationscited by 25
  19. 2020Adversarial Counterfactual Learning and Evaluation for Recommender Systemcited by 16
  20. 2019Evaluation Metrics for Item Recommendation under Samplingcited by 6
  21. 2021Theoretical Understandings of Product Embedding for E-commerce Machine Learningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 1; 2024: 1; 2025: 1; 2026: 1.

8 papers.