mlsanityData to 7 Oct 2026

Revisiting the Performance of iALS on Item Recommendation Benchmarks

arXiv 2110.14037 ↗First posted 26 Oct 2021cs.IR cs.LGcited by 21

Not on the map. Why?

Abstract (arXiv)

Matrix factorization learned by implicit alternating least squares (iALS) is a popular baseline in recommender system research publications. iALS is known to be one of the most computationally efficient and scalable collaborative filtering methods. However, recent studies suggest that its prediction quality is not competitive with the current state of the art, in particular autoencoders and other item-based collaborative filtering methods. In this work, we revisit the iALS algorithm and present a bag of tricks that we found useful when applying iALS. We revisit four well-studied benchmarks where iALS was reported to perform poorly and show that with proper tuning, iALS is highly competitive and outperforms any method on at least half of the comparisons. We hope that these high quality results together with iALS's known scalability spark new interest in applying and further improving this decade old technique.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). Builds on 12 of its 31 references that are in the map. First posted on arXiv 26 Oct 2021.

Builds on

12 of 31 references.

References · 12

  1. 2017Neural Collaborative Filteringcited by 1,108
  2. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  3. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  4. 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 100
  5. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 93
  6. 2019A Troubling Analysis of Reproducibility and Progress in Recommender Systems Researchcited by 65
  7. 2019RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedbackcited by 63
  8. 2019On the Difficulty of Evaluating Baselines: A Study on Recommender Systemscited by 46
  9. 2021Towards a Better Understanding of Linear Models for Recommendationcited by 18
  10. 2021Item Recommendation from Implicit Feedbackcited by 17
  11. 2016A Generic Coordinate Descent Framework for Learning from Implicit Feedbackcited by 16
  12. 2019Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanismscited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 7; 2024: 4; 2025: 6; 2026: 1.

21 papers.

Sort:

By area:

  1. 2023On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n Recommendationcited by 13
  2. 2024Item-Language Model for Conversational Recommendationcited by 7
  3. 2023RecFusion: A Binomial Diffusion Process for 1D Data for Recommendationcited by 6
  4. 2022Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and Applicationscited by 5
  5. 2023Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)cited by 5
  6. 2021ALX: Large Scale Matrix Factorization on TPUscited by 2
  7. 2024Recommender Systems for Good (RS4Good): Survey of Use Cases and a Call to Action for Research that Matterscited by 2
  8. 2025Fidelity-Aware Recommendation Explanations via Stochastic Path Integrationcited by 2
  9. 2022Efficient Mixed Dimension Embeddings for Matrix Factorizationcited by 1
  10. 2023Improving Sequential Recommendation Models with an Enhanced Loss Functioncited by 1
  11. 2023Safe Collaborative Filteringcited by 1
  12. 2023Performance Comparison of Session-based Recommendation Algorithms based on GNNscited by 1
9 more
  1. 2024Geometric Collaborative Filtering with Convergencecited by 1
  2. 2025Q3R: Quadratic Reweighted Rank Regularizer for Effective Low-Rank Trainingcited by 1
  3. 2023(Debiased) Contrastive Learning Loss for Recommendation (Technical Report)cited by 0
  4. 2024Cross-Domain Latent Factors Sharing via Implicit Matrix Factorizationcited by 0
  5. 2025NDCG-Consistent Softmax Approximation with Accelerated Convergencecited by 0
  6. 2025Leveraging Geometric Insights in Hyperbolic Triplet Loss for Improved Recommendationscited by 0
  7. 2025What Data is Really Necessary? A Feasibility Study of Inference Data Minimization for Recommender Systemscited by 0
  8. 2025Does Weighting Improve Matrix Factorization for Recommender Systems?cited by 0
  9. 2026Why This, Not That? Mining User Profiles for Pair-wise Counterfactualscited by 0