Efficient Neural Matrix Factorization without Sampling for Recommendation
TL;DR: This work derives three new optimization methods through rigorous mathematical reasoning, which can efficiently learn model parameters from the whole data with a rather low time complexity, and presents a general framework named ENMF, short for Efficient Neural Matrix Factorization.
read more
Abstract: Recommendation systems play a vital role to keep users engaged with personalized contents in modern online platforms. Recently, deep learning has revolutionized many research fields and there is a surge of interest in applying it for recommendation. However, existing studies have largely focused on exploring complex deep-learning architectures for recommendation task, while typically applying the negative sampling strategy for model learning. Despite effectiveness, we argue that these methods suffer from two important limitations: (1) the methods with complex network structures have a substantial number of parameters, and require expensive computations even with a sampling-based learning strategy; (2) the negative sampling strategy is not robust, making sampling-based methods difficult to achieve the optimal performance in practical applications.In this work, we propose to learn neural recommendation models from the whole training data without sampling. However, such a non-sampling strategy poses strong challenges to learning efficiency. To address this, we derive three new optimization methods through rigorous mathematical reasoning, which can efficiently learn model parameters from the whole data (including all missing data) with a rather low time complexity. Moreover, based on a simple Neural Matrix Factorization architecture, we present a general framework named ENMF, short for Efficient Neural Matrix Factorization. Extensive experiments on three real-world public datasets indicate that the proposed ENMF framework consistently and significantly outperforms the state-of-the-art methods on the Top-K recommendation task. Remarkably, ENMF also shows significant advantages in training efficiency, which makes it more applicable to real-world large-scale systems.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation
Kelong Mao,Jieming Zhu,Xi Xiao,Biao Lu,Zhaowei Wang,Xiuqiang He +5 more
- 26 Oct 2021
TL;DR: UltraGCN as discussed by the authors proposes an ultra-simplified formulation of GCNs, which skips infinite layers of message passing for efficient recommendation, instead of explicit message passing, resorting to directly approximate the limit of infinite-layer graph convolutions via a constraint loss.
293
•Posted Content
RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms
Wayne Xin Zhao,Shanlei Mu,Yupeng Hou,Zihan Lin,Kaiyuan Li,Yushuo Chen,Yujie Lu,Hui Wang,Changxin Tian,Xingyu Pan,Yingqian Min,Zhichao Feng,Xinyan Fan,Xu Chen,Pengfei Wang,Wendi Ji,Yaliang Li,Xiaoling Wang,Ji-Rong Wen +18 more
TL;DR: A unified, comprehensive and efficient recommender system library called RecBole (pronounced as [rEk'boUl@r]), which provides a unified framework to develop and reproduce recommendation algorithms for research purpose and provides a series of auxiliary functions, tools, and scripts to facilitate the use of this library.
290
RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms
Wayne Xin Zhao,Shanlei Mu,Yupeng Hou,Zihan Lin,Yushuo Chen,Xingyu Pan,Kaiyuan Li,Yujie Lu,Hui Wang,Changxin Tian,Yingqian Min,Zhichao Feng,Xinyan Fan,Xu Chen,Pengfei Wang,Wendi Ji,Yaliang Li,Xiaoling Wang,Ji-Rong Wen +18 more
- 26 Oct 2021
TL;DR: RecBole as discussed by the authors is a framework to standardize the implementation and evaluation of recommender systems for research purpose, including general and extensible data structures, comprehensive benchmark models, efficient GPU-accelerated execution, and extensive and standard evaluation protocols.
249
Towards Representation Alignment and Uniformity in Collaborative Filtering
Chenyang Wang,Yuanqing Yu,Weizhi Ma,Jinghui Zhang,Cheng Chen,Yiqun Liu,Shaoping Ma +6 more
- 26 Jun 2022
TL;DR: This paper measures the representation quality in CF from the perspective of alignment and uniformity on the hypersphere, and empirically analyzes the learning dynamics of typical CF methods in terms of quantified alignment and uniforms, which shows that better alignment or uniformity both contribute to higher recommendation performance.
149
SimpleX: A Simple and Strong Baseline for Collaborative Filtering
Kelong Mao,Jieming Zhu,Jinpeng Wang,Quanyu Dai,Zhenhua Dong,Xi Xiao,Xiuqiang He +6 more
- 26 Oct 2021
TL;DR: In this paper, the authors propose the cosine contrastive loss (CCL) and further incorporate it to a simple unified collaborative filtering model, dubbed SimpleX, which can surpass most sophisticated state-of-the-art models by a large margin.
144
References
•Journal Article
Dropout: a simple way to prevent neural networks from overfitting
TL;DR: It is shown that dropout improves the performance of neural networks on supervised learning tasks in vision, speech recognition, document classification and computational biology, obtaining state-of-the-art results on many benchmark data sets.
•Proceedings Article
Distributed Representations of Words and Phrases and their Compositionality
Tomas Mikolov,Ilya Sutskever,Kai Chen,Greg S. Corrado,Jeffrey Dean +4 more
- 05 Dec 2013
TL;DR: This paper presents a simple method for finding phrases in text, and shows that learning good vector representations for millions of phrases is possible and describes a simple alternative to the hierarchical softmax called negative sampling.
Matrix Factorization Techniques for Recommender Systems
TL;DR: As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels.
Item-based collaborative filtering recommendation algorithms
Badrul Sarwar,George Karypis,Joseph A. Konstan,John Riedl +3 more
- 01 Apr 2001
TL;DR: This paper analyzes item-based collaborative ltering techniques and suggests that item- based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.
•Proceedings Article
Advances in Neural Information Processing Systems 31
Samy Bengio,H.M. Wallach,Hugo Larochelle,K. Grauman,Nicolò Cesa-Bianchi,R. Garnett +5 more
- 01 Jan 2018
9.4K
Related Papers (5)
Xiangnan He,Lizi Liao,Hanwang Zhang,Liqiang Nie,Xia Hu,Tat-Seng Chua +5 more
- 03 Apr 2017
Yifan Hu,Yehuda Koren,Chris Volinsky +2 more
- 15 Dec 2008