Learning the Structure of Auto-Encoding Recommenders

08/18/2020
by   Farhan Khawar, et al.
0

Autoencoder recommenders have recently shown state-of-the-art performance in the recommendation task due to their ability to model non-linear item relationships effectively. However, existing autoencoder recommenders use fully-connected neural network layers and do not employ structure learning. This can lead to inefficient training, especially when the data is sparse as commonly found in collaborative filtering. The aforementioned results in lower generalization ability and reduced performance. In this paper, we introduce structure learning for autoencoder recommenders by taking advantage of the inherent item groups present in the collaborative filtering domain. Due to the nature of items in general, we know that certain items are more related to each other than to other items. Based on this, we propose a method that first learns groups of related items and then uses this information to determine the connectivity structure of an auto-encoding neural network. This results in a network that is sparsely connected. This sparse structure can be viewed as a prior that guides the network training. Empirically we demonstrate that the proposed structure learning enables the autoencoder to converge to a local optimum with a much smaller spectral norm and generalization error bound than the fully-connected network. The resultant sparse network considerably outperforms the state-of-the-art methods like Mult-vae/Mult-dae on multiple benchmarked datasets even when the same number of parameters and flops are used. It also has a better cold-start performance.

READ FULL TEXT
research
08/30/2018

Spectral Collaborative Filtering

Despite the popularity of Collaborative Filtering (CF), CF-based methods...
research
03/14/2022

Simultaneous Learning of the Inputs and Parameters in Neural Collaborative Filtering

Neural network-based collaborative filtering systems focus on designing ...
research
10/13/2022

Sapling Similarity outperforms other local similarity metrics in collaborative filtering

Many bipartite networks describe systems where a link represents a relat...
research
07/12/2021

Inductive Representation Based Graph Convolution Network for Collaborative Filtering

In recent years, graph neural networks (GNNs) have shown powerful abilit...
research
09/13/2021

Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering

Variational AutoEncoder (VAE) has been extended as a representative nonl...
research
02/10/2021

Deep Variational Autoencoder with Shallow Parallel Path for Top-N Recommendation (VASP)

Recently introduced EASE algorithm presents a simple and elegant way, ho...

Please sign up or login with your details

Forgot password? Click here to reset