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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evaluating Linear Shallow Autoencoders on Large Scale Datasets

Vojtěch Vančura, Petr Kasalický, Pavel Kordík, Rodrigo Alves
1 citations
ACM Transactions on Recommender Systems
Recommender Systems and Techniques
3.25
article

Evaluating Linear Shallow Autoencoders on Large Scale Datasets

Vojtěch Vančura, Petr Kasalický, Pavel Kordík, Rodrigo Alves
article en
1 citations

Abstract

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.

ACM Transactions on Recommender Systems
Czech Technical University in Prague (CZ)
Industry, innovation and infrastructure
Openalex Percentile: Top 8%
Recommender Systems and Techniques
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.