Embarrassingly Shallow Autoencoders for Sparse Data

05/08/2019
by   Harald Steck, et al.
0

Combining simple elements from the literature, we define a linear model that is geared toward sparse data, in particular implicit feedback data for recommender systems. We show that its training objective has a closed-form solution, and discuss the resulting conceptual insights. Surprisingly, this simple model achieves better ranking accuracy than various state-of-the-art collaborative-filtering approaches, including deep non-linear models, on most of the publicly available data-sets used in our experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2019

Collaborative Filtering via High-Dimensional Regression

While the SLIM approach obtained high ranking-accuracy in many experimen...
research
01/21/2020

Hybrid Semantic Recommender System for Chemical Compounds

Recommending Chemical Compounds of interest to a particular researcher i...
research
02/16/2018

Variational Autoencoders for Collaborative Filtering

We extend variational autoencoders (VAEs) to collaborative filtering for...
research
10/21/2019

Markov Random Fields for Collaborative Filtering

In this paper, we model the dependencies among the items that are recomm...
research
08/05/2017

Training Deep AutoEncoders for Collaborative Filtering

This paper proposes a novel model for the rating prediction task in reco...
research
09/15/2018

Wasserstein Autoencoders for Collaborative Filtering

The recommender systems have long been investigated in the literature. R...
research
07/31/2014

Learning From Ordered Sets and Applications in Collaborative Ranking

Ranking over sets arise when users choose between groups of items. For e...

Please sign up or login with your details

Forgot password? Click here to reset