arXiv Analytics

Sign in

arXiv:1906.12091 [cs.LG]AbstractReferencesReviewsResources

Searching for Interaction Functions in Collaborative Filtering

Quanming Yao, Xiangning Chen, James Kwok, Yong Li

Published 2019-06-28Version 1

Interaction function (IFC), which captures interactions among items and users, is of great importance in collaborative filtering (CF). The inner product is the most popular IFC due to its success in low-rank matrix factorization. However, interactions in real-world applications can be highly complex. Many other operations (such as plus and concatenation) have also been proposed, and can possibly offer better performance than the inner product. In this paper, motivated by the success of automated machine learning, we propose to search for proper interaction functions (SIF) for CF tasks. We first design an expressive search space for SIF by reviewing and generalizing existing CF approaches. We then propose to represent the search space as a structured multi-layer perceptron, and design a stochastic gradient descent algorithm which can simultaneously update both architectures and learning parameters. Experimental results demonstrate that the proposed method can be much more efficient than popular AutoML approaches, and also obtain much better prediction performance than state-of-the-art CF approaches.

Related articles: Most relevant | Search more
arXiv:2402.08856 [cs.LG] (Published 2024-02-13, updated 2024-06-15)
Approximation of relation functions and attention mechanisms
arXiv:1811.02198 [cs.LG] (Published 2018-11-06)
Collaborative Filtering with Stability
arXiv:1207.4146 [cs.LG] (Published 2012-07-11)
A Bayesian Approach toward Active Learning for Collaborative Filtering