Academia.eduAcademia.edu

Outline

Bayesian Low-Rank Determinantal Point Processes

https://doi.org/10.1145/2959100.2959178

Abstract

Determinantal point processes (DPPs) are an emerging model for encoding probabilities over subsets, such as shopping baskets, selected from a ground set, such as an item catalog. They have recently proved to be appealing models for a number of machine learning tasks, including product recommendation. DPPs are parametrized by a positive semi-definite kernel matrix. Prior work has shown that using a low-rank factorization of this kernel provides scalability improvements that open the door to training on large-scale datasets and computing online recommendations, both of which are infeasible with standard DPP models that use a full-rank kernel. A low-rank DPP model can be trained using an optimization-based method, such as stochastic gradient ascent, to find a point estimate of the kernel parameters, which can be performed efficiently on large-scale datasets. However, this approach requires careful tuning of regularization parameters to prevent overfitting and provide good predictive performance, which can be computationally expensive. In this paper we present a Bayesian method for learning a low-rank factorization of this kernel, which provides automatic control of regularization. We show that our Bayesian low-rank DPP model can be trained efficiently using stochastic gradient Hamiltonian Monte Carlo (SGHMC). Our Bayesian model generally provides better predictive performance on several real-world product recommendation datasets than optimization-based low-rank DPP models trained using stochastic gradient ascent, and better performance than several state-of-the art recommendation methods in many cases.

References (29)

  1. REFERENCES
  2. R. H. Affandi, E. Fox, R. Adams, and B. Taskar. Learning the parameters of determinantal point process kernels. In ICML, pages 1224-1232, 2014.
  3. R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of SIGMOD 1993, pages 207-216, 1993.
  4. T. Brijs. Retail market basket data set. In Workshop on Frequent Itemset Mining Implementations (FIMI'03), 2003.
  5. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In KDD, pages 254-260, 1999.
  6. A. J. Chaney. Social Poisson factorization (SPF). https://github.com/ajbc/spf, 2015.
  7. A. J. Chaney, D. M. Blei, and T. Eliassi-Rad. A probabilistic model for using social networks in personalized item recommendation. In RecSys, pages 43-50, 2015.
  8. T. Chen, E. Fox, and C. Guestrin. Stochastic gradient hamiltonian monte carlo. In ICML, pages 1683-1691, 2014.
  9. F. Coenen. TLUCS KDD implementation of CBA (classification based on associations). http://www.csc. liv.ac.uk/˜frans/KDD/Software/CMAR/cba.html, 2004. Department of Computer Science, The University of Liverpool, UK.
  10. S. Duane, A. D. Kennedy, B. J. Pendleton, and D. Roweth. Hybrid monte carlo. Physics letters B, 195(2):216-222, 1987.
  11. M. Gartrell, U. Paquet, and N. Koenigstein. Low-rank factorization of determinantal point processes for recommendation. arXiv preprint arXiv:1602.05436, 2016.
  12. J. Gillenwater. Approximate inference for determinantal point processes. PhD thesis, University of Pennsylvania, 2014.
  13. J. A. Gillenwater, A. Kulesza, E. Fox, and B. Taskar. Expectation-maximization for learning determinantal point processes. In NIPS, pages 3149-3157, 2014.
  14. P. Gopalan, J. M. Hofman, and D. M. Blei. Scalable recommendation with hierarchical Poisson factorization. In UAI, 2015.
  15. Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In ICDM, pages 263-272, 2008.
  16. S. Kotsiantis and D. Kanellopoulos. Association rules mining: A recent overview. GESTS International Transactions on Computer Science and Engineering, 32(1):71-82, 2006.
  17. A. Kulesza and B. Taskar. Structured determinantal point processes. In NIPS, pages 1171-1179, 2010.
  18. A. Kulesza and B. Taskar. Learning determinantal point processes. In UAI, 2011.
  19. A. Kulesza and B. Taskar. Determinantal point processes for machine learning. Foundations and Trends in Machine Learning, 5(2-3):123-286, 2012.
  20. J. T. Kwok and R. P. Adams. Priors for diversity in generative latent variable models. In NIPS, pages 2996-3004, 2012.
  21. J.-S. Lee, C.-H. Jun, J. Lee, and S. Kim. Classification-based collaborative filtering using market basket data. Expert Systems with Applications, 29(3):700-704, 2005.
  22. Y. Li, J. Hu, C. Zhai, and Y. Chen. Improving one-class collaborative filtering by incorporating rich user information. In CIKM, pages 959-968, 2010.
  23. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In KDD, 1998.
  24. O. Macchi. The coincidence approach to stochastic point processes. Advances in Applied Probability, pages 83-122, 1975.
  25. Z. Mariet and S. Sra. Fixed-point algorithms for learning determinantal point processes. In ICML, pages 2389-2397, 2015.
  26. A. Mild and T. Reutterer. An improved collaborative filtering approach for predicting cross-category purchases based on binary market basket data. Journal of Retailing and Consumer Services, 10(3):123-133, 2003.
  27. R. M. Neal. Mcmc using hamiltonian dynamics. Handbook of Markov Chain Monte Carlo, 2:113-162, 2011.
  28. U. Paquet and N. Koenigstein. One-class collaborative filtering with random graphs. In WWW, pages 999-1008, 2013.
  29. H. Steck. Item popularity and recommendation accuracy. In RecSys, pages 125-132, 2011.