Learning mixed multinomial logit model from ordinal data

Advances in Neural Information Processing Systems

Volumn 1, Issue January, 2014, Pages 595-603

  Oh, Sewoong ^a   Shah, Devavrat ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONCRETE MIXTURES; INFORMATION SCIENCE; MIXTURES; OPERATIONS RESEARCH; TENSORS;

CLASS OF DISTRIBUTIONS; MULTINOMIAL LOGIT MODEL; PAIR-WISE COMPARISON; PARTIAL INFORMATION; PARTIAL PREFERENCES; PERSONALIZED RECOMMENDATION; REVENUE MANAGEMENT; TENSOR DECOMPOSITION;

LEARNING ALGORITHMS;

EID: 84937904644     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. A. Ammar, S. Oh, D. Shah, and L. Voloch. What's your choice? learning the mixed multi-nomial logit model. In Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems, 2014.
2. A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky. Tensor decompositions for learning latent variable models. CoRR, abs/1210.7559, 2012.
3. H. Azari Soufiani, W. Chen, D. C Parkes, and L. Xia. Generalized method-of-moments for rank aggregation. In Advances in Neural Information Processing Systems 26, pages 2706-2714. 2013.
4. H. Azari Soufiani, D. Parkes, and L. Xia. Computing parametric ranking models via rank-breaking. In Proceedings of The 31st International Conference on Machine Learning, pages 360-368, 2014.
5. J. Blanchet, G. Gallego, and V. Goyal. A markov chain approximation to choice modeling. In EC, pages 103-104, 2013.
6. B. Bollobás. Random Graphs. Cambridge University Press, January 2001.
7. R. A. Bradley and M. E. Terry. Rank analysis of incomplete block designs: I. the method of paired comparisons. Biometrika, 39(3/4):324-345, 1955.
8. E. J. Candès and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6):717-772, 2009.
9. C. Davis and W. M. Kahan. The rotation of eigenvectors by a perturbation. iii. SIAM Journal on Numerical Analysis, 7(1):1-46, 1970.
10. J. C. Duchi, L. Mackey, and M. I. Jordan. On the consistency of ranking algorithms. In Proceedings of the ICML Conference, Haifa, Israel, June 2010.
11. V. F. Farias, S. Jagabathula, and D. Shah. A data-driven approach to modeling choice. In NIPS, pages 504-512, 2009.
12. P. Jain and S. Oh. Learning mixtures of discrete product distributions using spectral decompositions. arXiv preprint arXiv:1311.2972, 2014.
13. L. R. Ford Jr. Solution of a ranking problem from binary comparisons. The American Mathematical Monthly, 64(8):28-33, 1957.
14. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. Information Theory, IEEE Transactions on, 56(6):2980-2998, 2010.
15. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from noisy entries. The Journal of Machine Learning Research, 99:2057-2078, 2010.
16. D. R. Luce. Individual Choice Behavior. Wiley, New York, 1959.
17. D. McFadden. Conditional logit analysis of qualitative choice behavior. Frontiers in Econometrics, pages 105-142, 1973.
18. I. Mitliagkas, A. Gopalan, C. Caramanis, and S. Vishwanath. User rankings from comparisons: Learning permutations in high dimensions. In Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on, pages 1143-1150. IEEE, 2011.
19. S. Negahban, S. Oh, and D. Shah. Iterative ranking from pair-wise comparisons. In NIPS, pages 2483-2491, 2012.
20. S. Negahban and M. J. Wainwright. Restricted strong convexity and (weighted) matrix completion: Optimal bounds with noise. Journal of Machine Learning Research, 2012.
21. P. Samuelson. A note on the pure theory of consumers' behaviour. Economica, 5(17):61-71, 1938.
22. H. A. Soufiani, D. C. Parkes, and L. Xia. Random utility theory for social choice. In NIPS, pages 126-134, 2012.
23. Louis L Thurstone. A law of comparative judgment. Psychological review, 34(4):273, 1927.
24. J. Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 2011.
25. E. Zermelo. Die berechnung der turnier-ergebnisse als ein maximumproblem der wahrscheinlichkeitsrechnung. Mathematische Zeitschrift, 29(1):436-460, 1929.