Revisiting the Performance of iALS on Item Recommendation Benchmarks
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.
Code (2)
Tasks
Collaborative FilteringRecommendation SystemsSimilar Papers 제목 키워드 기반
Revisiting Alternative Experimental Settings for Evaluating Top-N Item Recommendation Algorithms
Top-N item recommendation has been a widely studied task from implicit feedback. Although much progress has been made with neural methods, there is increasing concern on appropriate evaluation of recommendation algorithm…
Revisiting Neighborhood-based Link Prediction for Collaborative Filtering
Collaborative filtering (CF) is one of the most successful and fundamental techniques in recommendation systems. In recent years, Graph Neural Network (GNN)-based CF models, such as NGCF [31], LightGCN [10] and GTN [9] h…
Collaborative FilteringGraph Neural NetworkLink PredictionPrediction+1Revisiting SVD to generate powerful Node Embeddings for Recommendation Systems
Graph Representation Learning (GRL) is an upcoming and promising area in recommendation systems. In this paper, we revisit the Singular Value Decomposition (SVD) of adjacency matrix for embedding generation of users and …
Graph Representation LearningRecommendation SystemsRepresentation LearningRevisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)
Inspired by the success of contrastive learning, we systematically examine recommendation losses, including listwise (softmax), pairwise (BPR), and pointwise (MSE and CCL) losses. In this endeavor, we introduce InfoNCE+,…
Contrastive LearningFair Matrix Factorisation for Large-Scale Recommender Systems
Recommender systems are hedged with various requirements, such as ranking quality, optimisation efficiency, and item fairness. Item fairness is an emerging yet impending issue in practical systems. The notion of item fai…
Collaborative FilteringFairnessRecommendation Systems