ABSTRACT
Pairwise algorithms are popular for learning recommender systems from implicit feedback. For each user, or more generally context, they try to discriminate between a small set of selected items and the large set of remaining (irrelevant) items. Learning is typically based on stochastic gradient descent (SGD) with uniformly drawn pairs. In this work, we show that convergence of such SGD learning algorithms slows down considerably if the item popularity has a tailed distribution. We propose a non-uniform item sampler to overcome this problem. The proposed sampler is context-dependent and oversamples informative pairs to speed up convergence. An efficient implementation with constant amortized runtime costs is developed. Furthermore, it is shown how the proposed learning algorithm can be applied to a large class of recommender models. The properties of the new learning algorithm are studied empirically on two real-world recommender system problems. The experiments indicate that the proposed adaptive sampler improves the state-of-the art learning algorithm largely in convergence without negative effects on prediction quality or iteration runtime.
- A. Ahmed, B. Kanagal, S. Pandey, V. Josifovski, L. G. Pueyo, and J. Yuan. Latent factor models with additive and hierarchically-smoothed user preferences. In Proceedings of the sixth ACM international conference on Web search and data mining, WSDM '13, pages 385--394, New York, NY, USA, 2013. ACM. Google ScholarDigital Library
- J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 43--52, San Francisco, 1998. Morgan Kaufmann. Google ScholarDigital Library
- Z. Gantner, L. Drumond, C. Freudenthaler, and L. Schmidt-Thieme. Personalized ranking for non-uniformly sampled items. Journal of Machine Learning Research Workshop and Conference Proceedings, 2012.Google Scholar
- L. Hong, R. Bekkerman, J. Adler, and B. D. Davison. Learning to rank social update streams. In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, SIGIR '12, pages 651--660, New York, NY, USA, 2012. ACM. Google ScholarDigital Library
- L. Hong, A. S. Doumith, and B. D. Davison. Co-factorization machines: modeling user interests and predicting individual decisions in twitter. In Proceedings of the sixth ACM international conference on Web search and data mining, WSDM '13, pages 557--566, New York, NY, USA, 2013. ACM. Google ScholarDigital Library
- Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In IEEE International Conference on Data Mining (ICDM 2008), pages 263--272, 2008. Google ScholarDigital Library
- B. Kanagal, A. Ahmed, S. Pandey, V. Josifovski, L. Garcia-Pueyo, and J. Yuan. Focused matrix factorization for audience selection in display advertising. In Data Engineering (ICDE), 2013 IEEE 29th International Conference on, pages 386--397, 2013. Google ScholarDigital Library
- B. Kanagal, A. Ahmed, S. Pandey, V. Josifovski, J. Yuan, and L. G. Pueyo. Supercharging recommender systems using taxonomies for learning user purchase behavior. PVLDB, 5(10):956--967, 2012. Google ScholarDigital Library
- A. Karatzoglou, X. Amatriain, L. Baltrunas, and N. Oliver. Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. In RecSys '10: Proceedings of the fourth ACM conference on Recommender systems, pages 79--86, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In KDD '08: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 426--434, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- Y. Koren. Collaborative filtering with temporal dynamics. In KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 447--456, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- R. Pan, Y. Zhou, B. Cao, N. N. Liu, R. M. Lukose, M. Scholz, and Q. Yang. One-class collaborative filtering. In IEEE International Conference on Data Mining (ICDM 2008), pages 502--511, 2008. Google ScholarDigital Library
- S. Rendle. Factorization machines with libFM. ACM Trans. Intell. Syst. Technol., 3(3):57:1--57:22, May 2012. Google ScholarDigital Library
- S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI 2009), 2009. Google ScholarDigital Library
- S. Rendle and L. Schmidt-Thieme. Pairwise interaction tensor factorization for personalized tag recommendation. In WSDM '10: Proceedings of the third ACM international conference on Web search and data mining, pages 81--90, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- J. D. M. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In ICML '05: Proceedings of the 22nd international conference on Machine learning, pages 713--719. ACM, 2005. Google ScholarDigital Library
- S. Riedel, L. Yao, B. M. Marlin, and A. McCallum. Relation extraction with matrix factorization and universal schemas. In Joint Human Language Technology Conference/Annual Meeting of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL '13), June 2013.Google Scholar
- R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In Advances in Neural Information Processing Systems, volume 20, 2008.Google ScholarDigital Library
- Y. Shi, A. Karatzoglou, L. Baltrunas, M. Larson, N. Oliver, and A. Hanjalic. Climf: learning to maximize reciprocal rank with collaborative less-is-more filtering. In Proceedings of the sixth ACM conference on Recommender systems, RecSys '12, pages 139--146, New York, NY, USA, 2012. ACM. Google ScholarDigital Library
- D. H. Stern, R. Herbrich, and T. Graepel. Matchbox: large scale online bayesian recommendations. In Proceedings of the 18th international conference on World wide web, WWW '09, pages 111--120, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- M. Weimer, A. Karatzoglou, Q. V. Le, and A. J. Smola. Cofi rank - maximum margin matrix factorization for collaborative ranking. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 1593--1600, Cambridge, MA, 2008. MIT Press.Google Scholar
- J. Weston, S. Bengio, and N. Usunier. Wsabie: scaling up to large vocabulary image annotation. In Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three, IJCAI'11, pages 2764--2770. AAAI Press, 2011. Google ScholarDigital Library
Index Terms
- Improving pairwise learning for item recommendation from implicit feedback
Recommendations
Item recommendation in collaborative tagging systems via heuristic data fusion
Collaborative tagging systems have been popular on the Web. However, information overload results in the increasing need for recommender services from users, and thus item recommendation has been one of the key issues in such systems. In this paper, we ...
A latent pairwise preference learning approach for recommendation from implicit feedback
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge managementMost of the current recommender systems heavily rely on explicit user feedback such as ratings on items to model users' interests. However, in many applications, it is very hard to collect the explicit feedback, while implicit feedback such as user ...
Multiple Pairwise Ranking with Implicit Feedback
CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge ManagementAs users implicitly express their preferences to items on many real-world applications, the implicit feedback based collaborative filtering has attracted much attention in recent years. Pairwise methods have shown state-of-the-art solutions for dealing ...
Comments