Collaboratively Learning Preferences from Ordinal Data

In applications such as recommendation systems and revenue management, it is important to predict preferences on items that have not been seen by a user or predict outcomes of comparisons among those that have never been compared. A popular discrete choice model of multinomial logit model captures the structure of the hidden preferences with a low-rank matrix. In order to predict the preferences, we want to learn the underlying model from noisy observations of the low-rank matrix, collected as revealed preferences in various forms of ordinal data. A natural approach to learn such a model is to solve a convex relaxation of nuclear norm minimization. We present the convex relaxation approach in two contexts of interest: collaborative ranking and bundled choice modeling. In both cases, we show that the convex relaxation is minimax optimal. We prove an upper bound on the resulting error with finite samples, and provide a matching information-theoretic lower bound.

[1]  D. McFadden.  Conditional logit analysis of qualitative choice behavior , 1972 .

[2]  A. Culyer.  Thurstone’s Law of Comparative Judgment , 2014 .

[3]  J. Marschak.  Binary Choice Constraints on Random Utility Indicators , 1959 .

[4]  R. Duncan Luce,et al.  Individual Choice Behavior , 1959 .

[5]  D. Hunter.  MM algorithms for generalized Bradley-Terry models , 2003 .

[6]  Devavrat Shah,et al.  Iterative ranking from pair-wise comparisons , 2012, NIPS.

[7]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[8]  David C. Parkes,et al.  Random Utility Theory for Social Choice , 2012, NIPS.

[9]  Laurent Massoulié,et al.  Clustering and Inference From Pairwise Comparisons , 2015, SIGMETRICS.

[10]  L. Thurstone.  A law of comparative judgment. , 1994 .

[11]  Bruce E. Hajek,et al.  Minimax-optimal Inference from Partial Rankings , 2014, NIPS.

[12]  David C. Parkes,et al.  Generalized Random Utility Models with Multiple Types , 2013, NIPS.

[13]  Arnaud Doucet,et al.  Efficient Bayesian Inference for Generalized Bradley–Terry Models , 2010, 1011.1761.

[14]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[15]  Jin Zhang,et al.  Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons , 2015, ICML.

[16]  Martin J. Wainwright,et al.  Fast global convergence rates of gradient methods for high-dimensional statistical recovery , 2010, NIPS.

[17]  M. Ledoux.  The concentration of measure phenomenon , 2001 .

[18]  Yu Lu,et al.  Individualized rank aggregation using nuclear norm regularization , 2014, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[19]  I. C. Gormley,et al.  A grade of membership model for rank data , 2009 .

[20]  John Guiver,et al.  Bayesian inference for Plackett-Luce ranking models , 2009, ICML '09.

[21]  Devavrat Shah,et al.  Learning Mixed Multinomial Logit Model from Ordinal Data , 2014, NIPS.

[22]  Jinfeng Yi,et al.  Inferring Users' Preferences from Crowdsourced Pairwise Comparisons: A Matrix Completion Approach , 2013, HCOMP.

[23]  Lars Schmidt-Thieme,et al.  BPR: Bayesian Personalized Ranking from Implicit Feedback , 2009, UAI.

[24]  Venkatesh Saligrama,et al.  A Topic Modeling Approach to Rank Aggregation , 2014 .

[25]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[26]  Gábor Lugosi,et al.  Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.

[27]  Tie-Yan Liu,et al.  Learning to rank for information retrieval , 2009, SIGIR.

[28]  Devavrat Shah,et al.  What's your choice?: learning the mixed multi-nomial , 2014, SIGMETRICS '14.

[29]  Devavrat Shah,et al.  What's your choice? Learning the mixed multi-nomial logit model , 2014, SIGMETRICS 2014.

[30]  Martin J. Wainwright,et al.  Restricted strong convexity and weighted matrix completion: Optimal bounds with noise , 2010, J. Mach. Learn. Res..