Revealed Preference at Scale: Learning Personalized Preferences from Assortment Choices
暂无分享,去创建一个
[1] Sewoong Oh,et al. Collaboratively Learning Preferences from Ordinal Data , 2015, NIPS.
[2] Assaf J. Zeevi,et al. Optimal Dynamic Assortment Planning with Demand Learning , 2013, Manuf. Serv. Oper. Manag..
[3] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[4] Andrea Montanari,et al. Matrix completion from a few entries , 2009, ISIT.
[5] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..
[6] P. Samuelson. Consumption Theory in Terms of Revealed Preference , 1948 .
[7] A. Tversky,et al. Prospect theory: an analysis of decision under risk — Source link , 2007 .
[8] P. Rusmevichientong,et al. Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters , 2014 .
[9] Yu Lu,et al. Individualized rank aggregation using nuclear norm regularization , 2014, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[10] D. McFadden,et al. MIXED MNL MODELS FOR DISCRETE RESPONSE , 2000 .
[11] Elad Hazan,et al. Sparse Approximate Solutions to Semidefinite Programs , 2008, LATIN.
[12] R. Luce,et al. Individual Choice Behavior: A Theoretical Analysis. , 1960 .
[13] Martin J. Wainwright,et al. Restricted strong convexity and weighted matrix completion: Optimal bounds with noise , 2010, J. Mach. Learn. Res..
[14] Huseyin Topaloglu,et al. Assortment Optimization Under Variants of the Nested Logit Model , 2014, Oper. Res..
[15] Pradeep Ravikumar,et al. Exponential Family Matrix Completion under Structural Constraints , 2014, ICML.
[16] D. McFadden. Conditional logit analysis of qualitative choice behavior , 1972 .
[17] Shiqian Ma,et al. Fixed point and Bregman iterative methods for matrix rank minimization , 2009, Math. Program..
[18] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[19] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[20] Francesco Orabona,et al. PRISMA: PRoximal Iterative SMoothing Algorithm , 2012, ArXiv.
[21] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[22] Anastasios Kyrillidis,et al. Dropping Convexity for Faster Semi-definite Optimization , 2015, COLT.
[23] Andrea Montanari,et al. Matrix Completion from Noisy Entries , 2009, J. Mach. Learn. Res..
[24] Lei Xie,et al. Dynamic Assortment Customization with Limited Inventories , 2015, Manuf. Serv. Oper. Manag..
[25] H. Williams. On the Formation of Travel Demand Models and Economic Evaluation Measures of User Benefit , 1977 .
[26] D. McFadden. Econometric Models for Probabilistic Choice Among Products , 1980 .
[27] Ewout van den Berg,et al. 1-Bit Matrix Completion , 2012, ArXiv.
[28] Ohad Shamir,et al. Learning with the weighted trace-norm under arbitrary sampling distributions , 2011, NIPS.
[29] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[30] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[31] R. Duncan Luce,et al. Individual Choice Behavior: A Theoretical Analysis , 1979 .
[32] Stephen P. Boyd,et al. Proximal Algorithms , 2013, Found. Trends Optim..
[33] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[34] W. Lieberman. The Theory and Practice of Revenue Management , 2005 .
[35] David B. Shmoys,et al. Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint , 2010, Oper. Res..
[36] A. Tversky,et al. Prospect theory: analysis of decision under risk , 1979 .
[37] J. R. DeShazo,et al. Designing Choice Sets for Stated Preference Methods: The Effects of Complexity on Choice Consistency , 2002 .