Scalable Personalised Item Ranking through Parametric Density Estimation

Abstract

Learning from implicit feedback is challenging because of the difficult nature of the one-class problem: we can observe only positive examples. Most conventional methods use a pairwise ranking approach and negative samplers to cope with the one-class problem. However, such methods have two main drawbacks particularly in large-scale applications; (1) the pairwise approach is severely inefficient due to the quadratic computational cost; and (2) even recent model-based samplers (e.g. IRGAN) cannot achieve practical efficiency due to the training of an extra model. In this paper, we propose a learning-to-rank approach, which achieves convergence speed comparable to the pointwise counterpart while performing similarly to the pairwise counterpart in terms of ranking effectiveness. Our approach estimates the probability densities of positive items for each user within a rich class of distributions, viz. \emph{exponential family}. In our formulation, we derive a loss function and the appropriate negative sampling distribution based on maximum likelihood estimation. We also develop a practical technique for risk approximation and a regularisation scheme. We then discuss that our single-model approach is equivalent to an IRGAN variant under a certain condition. Through experiments on real-world datasets, our approach outperforms the pointwise and pairwise counterparts in terms of effectiveness and efficiency.

arXiv commentAccepted by SIGIR'21

References in corpus (19)

• BPR: Bayesian Personalized Ranking from Implicit Feedback
• Neural Graph Collaborative Filtering
• Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering
• Wasserstein GAN
• IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models
• LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
• Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval
• Wasserstein Auto-Encoders
• RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback
• Density Estimation in Infinite Dimensional Exponential Families
• Simplify and Robustify Negative Sampling for Implicit Collaborative Filtering
• Latent Collaborative Retrieval
• A Convex Duality Framework for GANs
• Kernel Exponential Family Estimation via Doubly Dual Embedding
• Scaling-up Empirical Risk Minimization: Optimization of Incomplete U-statistics
• Adversarial Example Games
• Relaxed Softmax for learning from Positive and Unlabeled data
• Deep Adversarial Social Recommendation
• Density-Ratio Based Personalised Ranking from Implicit Feedback