mlsanityData to 7 Oct 2026

Infinite Recommendation Networks: A Data-Centric Approach

arXiv 2206.02626 ↗First posted 3 Jun 2022cs.IR cs.LGcited by 20

Not on the map. Why?

Abstract (arXiv)

We leverage the Neural Tangent Kernel and its equivalence to training infinitely-wide neural networks to devise ∞-AE: an autoencoder with infinitely-wide bottleneck layers. The outcome is a highly expressive yet simplistic recommendation model with a single hyper-parameter and a closed-form solution. Leveraging ∞-AE's simplicity, we also develop Distill-CF for synthesizing tiny, high-fidelity data summaries which distill the most important knowledge from the extremely large and sparse user-item interaction matrix for efficient and accurate subsequent data-usage like model training, inference, architecture search, etc. This takes a data-centric approach to recommendation, where we aim to improve the quality of logged user-feedback data for subsequent modeling, independent of the learning algorithm. We particularly utilize the concept of differentiable Gumbel-sampling to handle the inherent data heterogeneity, sparsity, and semi-structuredness, while being scalable to datasets with hundreds of millions of user-item interactions. Both of our proposed approaches significantly outperform their respective state-of-the-art and when used together, we observe 96-105% of ∞-AE's performance on the full dataset with as little as 0.1% of the original dataset size, leading us to explore the counter-intuitive question: Is more data what you need for better recommendation?

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). Builds on 50 of its 79 references that are in the map. First posted on arXiv 3 Jun 2022.

Builds on

50 of 79 references.

References · 50

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  4. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  5. 2014Conditional Generative Adversarial Netscited by 2,152
  6. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
  7. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  8. 2017Neural Collaborative Filteringcited by 1,108
  9. 2018Experience Replay for Continual Learningcited by 1,074
  10. 2016Wide & Deep Learning for Recommender Systemscited by 745
  11. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  12. 2020Contrastive Learning with Hard Negative Samplescited by 619
38 more
  1. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  2. 2020Dataset Condensation with Gradient Matchingcited by 510
  3. 2020Hard Negative Mixing for Contrastive Learningcited by 399
  4. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
  5. 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
  6. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  7. 2021Dataset Condensation with Differentiable Siamese Augmentationcited by 290
  8. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  9. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
  10. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  11. 2020Dataset Meta-Learning from Kernel Ridge-Regressioncited by 230
  12. 2021Dataset Distillation with Infinitely Wide Convolutional Networkscited by 215
  13. 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
  14. 2019Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approachescited by 181
  15. 2018Bayesian Deep Convolutional Networks with Many Channels are Gaussian Processescited by 164
  16. 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 156
  17. 2021Graph Condensation for Graph Neural Networkscited by 150
  18. 2019Neural Tangents: Fast and Easy Infinite Neural Networks in Pythoncited by 149
  19. 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
  20. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  21. 2019Learning Disentangled Representations for Recommendationcited by 110
  22. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 93
  23. 2019Harnessing the Power of Infinitely Wide Deep Nets on Small-data Taskscited by 87
  24. 2020Off-policy Bandits with Deficient Supportcited by 60
  25. 2021Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoodscited by 57
  26. 2021ECLARE: Extreme Classification with Label Graph Correlationscited by 38
  27. 2022Submodularity In Machine Learning and Artificial Intelligencecited by 37
  28. 2018Sequential Variational Autoencoders for Collaborative Filteringcited by 31
  29. 2020How Useful are Reviews for Recommendation? A Critical Review and Potential Improvementscited by 24
  30. 2020ADER: Adaptively Distilled Exemplar Replay Towards Continual Learning for Session-based Recommendationcited by 22
  31. 2021Linear, or Non-Linear, That is the Question!cited by 19
  32. 2021Simple, Fast, and Flexible Framework for Matrix Completion with Infinite Width Neural Networkscited by 17
  33. 2020Regularized Submodular Maximization at Scalecited by 15
  34. 2021Training Data Subset Selection for Regression with Controlled Generalization Errorcited by 14
  35. 2020Developing a Recommendation Benchmark for MLPerf Training and Inferencecited by 12
  36. 2022Top-N Recommendation Algorithms: A Quest for the State-of-the-Artcited by 12
  37. 2021Rethinking Neural vs. Matrix-Factorization Collaborative Filtering: the Theoretical Perspectivescited by 8
  38. 2022On Sampling Collaborative Filtering Datasetscited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 9; 2024: 7; 2025: 1; 2026: 3.

20 papers.

Sort:

By area: