ArXiv TLDR

Collaborative Filtering Through Weighted Similarities of User and Item Embeddings

🐦 Tweet
2604.15573

Pedro R. Pires, Rafael T. Sereicikas, Gregorio F. Azevedo, Tiago A. Almeida

cs.IRcs.LG

TLDR

This paper introduces an efficient ensemble method for collaborative filtering, unifying user-item and item-item recommendations with shared embeddings.

Key contributions

  • Introduces a novel ensemble method for top-N recommendations using weighted similarities.
  • Unifies user-item and item-item strategies with shared user and item embeddings.
  • Achieves competitive performance and robustness across diverse datasets.
  • Enhances efficiency by eliminating embedding-specific fine-tuning and reusing hyperparameters.

Why it matters

This paper provides a more efficient and simpler approach to collaborative filtering, combining traditional and modern strengths. Its use of shared embeddings and hyperparameter reuse offers a robust, easy-to-implement solution for top-N recommendations, reducing computational overhead.

Original Abstract

In recent years, neural networks and other complex models have dominated recommender systems, often setting new benchmarks for state-of-the-art performance. Yet, despite these advancements, award-winning research has demonstrated that traditional matrix factorization methods can remain competitive, offering simplicity and reduced computational overhead. Hybrid models, which combine matrix factorization with newer techniques, are increasingly employed to harness the strengths of multiple approaches. This paper proposes a novel ensemble method that unifies user-item and item-item recommendations through a weighted similarity framework to deliver top-N recommendations. Our approach is distinctive in its use of shared user and item embeddings for both recommendation strategies, simplifying the architecture and enhancing computational efficiency. Extensive experiments across multiple datasets show that our method achieves competitive performance and is robust in varying scenarios that favor either user-item or item-item recommendations. Additionally, by eliminating the need for embedding-specific fine-tuning, our model allows for the seamless reuse of hyperparameters from the base algorithm without sacrificing performance. This results in a method that is both efficient and easy to implement. Our open-source implementation is available at https://github.com/UFSCar-LaSID/weighted-sims-recommender.

📬 Weekly AI Paper Digest

Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.