Fetching the paper…
Reading the bibliography…
We study the problem of dynamic assortment personalization with large, heterogeneous populations and wide arrays of products, and demonstrate the importance of structural priors for effective, efficient large-scale personalization.
Spearman C (1904) “general intelligence,” objectively determined and measured. The American Journal of Psychology 15(2):201–292
1904
Earlier work this paper cites.
Oh S, Thekumparampil KK, Xu J (2015) Collaboratively learning preferences from ordinal data. Advances in Neural Information Processing Systems , 1909–1917
1917
Earlier work this paper cites.
Gunasekar S, Ravikumar P, Ghosh J (2014) Exponential family matrix completion under structural constraints. Proceedings of the 31st International Conference on Machine Learning (ICML-14) , 1917–1925
1925
Earlier work this paper cites.
Hotelling H (1933) Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology 24(6):417
1933
Earlier work this paper cites.
Luce DR (1959) Individual Choice Behavior: a theoretical analysis (Wiley)
1959
Earlier work this paper cites.
McFadden D (1973) Conditional logit analysis of qualitative choice behavior. Zarembka P, ed., Frontiers in Economics (Academic Press)
1973
Earlier work this paper cites.
Williams HC (1977) On the formation of travel demand models and economic evaluation measures of user benefit. Environment and planning A 9(3):285–344
1977
Earlier work this paper cites.
Kahneman D, Tversky A (1979) Prospect theory: An analysis of decision under risk. Econometrica: Journal of the Econometric Society 263–291
1979
Earlier work this paper cites.
Megiddo N (1979) Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4(4):414–424
1979
Earlier work this paper cites.
McFadden D (1980) Econometric models for probabilistic choice among products. Journal of Business S13–S29
1980
Earlier work this paper cites.
Cai JF, Candès EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization 20(4):1956–1982
1982
Earlier work this paper cites.
Lai TL, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Advances in applied mathematics 6(1):4–22
1985
Earlier work this paper cites.
McFadden D, Train K (2000) Mixed mnl models for discrete response. Journal of applied Econometrics 15(5):447–470
2000
Earlier work this paper cites.
DeShazo J, Fermo G (2002) Designing choice sets for stated preference methods: the effects of complexity on choice consistency. Journal of Environmental Economics and management 44(1):123–143
2002
Earlier work this paper cites.
Bartlett PL, Mendelson S (2003) Rademacher and gaussian complexities: Risk bounds and structural results. The Journal of Machine Learning Research 3:463–482
2003
Earlier work this paper cites.
Funk S (2006) Netflix update: Try this at home. URL http://sifter.org/~simon/journal/20061211.html
2006
Earlier work this paper cites.
Talluri KT, Van Ryzin GJ (2006) The theory and practice of revenue management , volume 68 (Springer Science & Business Media)
2006
Earlier work this paper cites.
Caro F, Gallien J (2007) Dynamic assortment with demand learning for seasonal consumer goods. Management Science 53(2):276–292
2007
Earlier work this paper cites.
Hazan E (2008) Sparse approximate solutions to semidefinite programs. LATIN 2008: Theoretical Informatics , 306–316 (Springer)
2008
Earlier work this paper cites.
Candès E, Plan Y (2009) Matrix completion with noise. CoRR abs/0903.3131
2009
Earlier work this paper cites.
Candès E, Recht B (2009) Exact matrix completion via convex optimization. Foundations of Computational Mathematics 9(6):717–772
2009
Earlier work this paper cites.
Witten D, Tibshirani R, Hastie T (2009) A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics kxp008
2009
Cited alongside, same era.
Keshavan RH, Montanari A, Oh S (2010) Matrix completion from a few entries. IEEE Transactions on Information Theory 56(6):2980–2998
2010
Cited alongside, same era.
Raskutti G, Wainwright MJ, Yu B (2010) Restricted eigenvalue properties for correlated gaussian designs. Journal of Machine Learning Research 11(Aug):2241–2259
2010
Cited alongside, same era.
Recht B, Fazel M, Parrilo P (2010) Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review 52(3):471–501, ISSN 0036-1445, URL http://dx.doi.org/10.1137/070697835
2010
Cited alongside, same era.
Rigollet P, Zeevi A (2010) Nonparametric bandits with covariates. arXiv preprint arXiv:1003.1630
Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Operations Research 62(2):250–273
2014
Later among the works it cites.
Désir A, Goyal V (2014) Near-optimal algorithms for capacity constrained assortment optimization. Available at SSRN 2543309
2014
Later among the works it cites.
Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Science 60(6):1532–1551
2014
Later among the works it cites.
2014
Later among the works it cites.
Maillard OA, Mannor S (2014) Latent bandits. International Conference on Machine Learning , 136–144
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
Rusmevichientong P, Shen ZJM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Operations Research 58(6):1666–1680
2010
Cited alongside, same era.
Bernstein F, Kök AG, Xie L (2011) Dynamic assortment customization with limited inventories. Technical report, Citeseer
2011
Cited alongside, same era.
Negahban S, Wainwright MJ (2011) Estimation of (near) low-rank matrices with noise and high-dimensional scaling. The Annals of Statistics 1069–1097
2011
Cited alongside, same era.
Recht B, Re C, Wright S, Niu F (2011) Hogwild: A lock-free approach to parallelizing stochastic gradient descent. Advances in Neural Information Processing Systems , 693–701
2011
Cited alongside, same era.
Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Machine Learning 5(1):1–122
2012
Cited alongside, same era.
Negahban SN, Ravikumar P, Wainwright MJ, Yu B (2012) A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers. Statistical Science 538–557
2012
Cited alongside, same era.
2012
Cited alongside, same era.
Parikh N, Boyd S (2014) Proximal algorithms. Foundations and Trends in Optimization 1(3):127–239
2014
Later among the works it cites.
Slivkins A (2014) Contextual bandits with similarity information. The Journal of Machine Learning Research 15(1):2533–2568
2014
Later among the works it cites.
van Ryzin G, Vulcano G (2014) A market discovery algorithm to estimate a general class of nonparametric choice models. Management Science 61(2):281–300
2014
Later among the works it cites.
Bastani H, Bayati M (2015) Online decision-making with high-dimensional covariates. Available at SSRN 2661896
2015
Later among the works it cites.
2015
Later among the works it cites.
Li G, Rusmevichientong P, Topaloglu H (2015) The d-level nested logit model: Assortment and price optimization problems. Operations Research 63(2):325–342
2015
Later among the works it cites.
Kallus N, Udell M (2016) Revealed preference at scale: Learning personalized preferences from assortment choices. Proceedings of the 2016 ACM Conference on Economics and Computation , 821–837 (ACM)
2016
Closest in time.
Schuler A, Liu V, Wan J, Callahan A, Udell M, Stark D, Shah N (2016) Discovering patient phenotypes using generalized low rank models. Pacific Symposium on Biocomputing (PSB) URL http://psb.stanford.edu/psb-online/proceedings/psb16/schuler.pdf
2016
Closest in time.
Udell M, Horn C, Zadeh R, Boyd S (2016) Generalized low rank models. Foundations and Trends in Machine Learning URL http://dx.doi.org/10.1561/2200000055
2016
Closest in time.
2017
Closest in time.
Bernstein F, Modaresi S, Sauré D (2017) A dynamic clustering approach to data-driven assortment personalization
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production and Operations Management 23(11):2023–2039
2039
Closest in time.
Candès E, Tao T (2010) The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory 56(5):2053–2080
2080
Closest in time.