Fast Non-Bayesian Poisson Factorization for Implicit-Feedback Recommendations

2018/11/05 by Cortes, David
#FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)

paper · doi:10.48550/arxiv.1811.01908

Abstract

This work explores non-negative low-rank matrix factorization based on regularized Poisson models (PF or "Poisson factorization" for short) for recommender systems with implicit-feedback data. The properties of Poisson likelihood allow a shortcut for very fast computations over zero-valued inputs, and oftentimes results in very sparse factors for both users and items. Compared to HPF (a popular Bayesian formulation of the problem with hierarchical priors), the frequentist optimization-based approach presented here tends to produce better top-N recommendations with significantly shorter fitting times, on top of having sparse solutions.

Related

• Scalable Recommendation with Poisson Factorization
• Hierarchical Compound Poisson Factorization
• Does Weighting Improve Matrix Factorization for Recommender Systems?
• Fast Matrix Factorization for Online Recommendation with Implicit Feedback
• Recommendation from Raw Data with Adaptive Compound Poisson\n Factorization