Evaluating Linear Shallow Autoencoders on Large Scale Datasets
Linear shallow autoencoders have gained popularity in collaborative filtering benchmarks for recommender systems due to their simplicity and strong performance. However, models like EASE struggle to scale to datasets with a large number of items. This paper addresses this limitation by evaluating scalable variants of shallow linear autoencoders, namely, the recently proposed ELSA and SANSA, on large-scale datasets representative of real-world applications. We further propose improvements to enhance their scalability on large, sparse datasets. Our evaluation goes beyond standard offline and online performance metrics, incorporating key industrial considerations such as training time and memory usage. By analyzing the effects of data sparsity and catalog size, we provide practical guidance to select the most suitable model for a given dataset. We release the source code, training logs, and detailed instructions to reproduce our experiments at https://github.com/recombee/SparseELSA.
Authors
- Vojtěch Vančura (ORCID: https://orcid.org/0000-0003-2638-9969)
- Petr Kasalický (ORCID: https://orcid.org/0000-0001-6438-366X)
- Pavel Kordík (ORCID: https://orcid.org/0000-0003-1433-0089)
- Rodrigo Alves
Institutions
- Czech Technical University in Prague (CZ)
Publication Details
- Journal
- ACM Transactions on Recommender Systems
- Published
- 2025-07-12
- DOI
- https://doi.org/10.1145/3748335
- Citations
- 1
- Primary Topic
- Recommender Systems and Techniques
- Type
- article
- Field-Weighted Citation Impact
- 3.25