We present ImplicitSLIM, a novel unsupervised learning approach for sparse high-dimensional data, with applications to collaborative filtering. Sparse linear methods (SLIM) and their variations show outstanding performance, but they are memory-intensive and hard to scale. ImplicitSLIM improves embedding-based models by extracting embeddings from SLIM-like models in a computationally cheap and memory-efficient way, without explicit learning of heavy SLIM-like models. We show that ImplicitSLIM improves performance and speeds up convergence for both state of the art and classical collaborative filtering methods. The source code for ImplicitSLIM, related models, and applications is available at https://github.com/ilya-shenbin/ImplicitSLIM.
@article{arxiv.2406.00198,
title = {ImplicitSLIM and How it Improves Embedding-based Collaborative Filtering},
author = {Ilya Shenbin and Sergey Nikolenko},
journal= {arXiv preprint arXiv:2406.00198},
year = {2024}
}
Comments
Published as a conference paper at ICLR 2024; authors' version