Online Personalized Assortment Optimization with High-Dimensional Customer Contextual Data

References

• Abbasi-Yadkori Y, Pál D, Szepesvári C (2011) Improved algorithms for linear stochastic bandits. Adv. Neural Inform. Processing Systems 24:2312–2320.Google Scholar
• Abbasi-Yadkori Y, Pál D, Szepesvári C (2012) Online-to-confidence-set conversions and application to sparse stochastic bandits. Proc. 15th Internat. Conf. Artificial Intelligence Statist., 1–9.Google Scholar
• Achlioptas D (2003) Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. System Sci. 66(4):671–687.Crossref, Google Scholar
• Adomavicius G, Tuzhilin A (2011) Context-aware recommender systems. Recommender Systems Handbook (Springer), 217–253.Crossref, Google Scholar
• Agrawal S, Goyal N (2013) Thompson sampling for contextual bandits with linear payoffs. Internat. Conf. Machine Learn., 127–135.Google Scholar
• Agrawal S, Avadhanula V, Goyal V, Zeevi A (2017) Thompson sampling for the MNL-bandit. Conf. Learn. Theory (PMLR), 76–78.Google Scholar
• Agrawal S, Avadhanula V, Goyal V, Zeevi A (2019) MNL-bandit: A dynamic learning approach to assortment selection. Oper. Res. 67(5):1453–1485.Link, Google Scholar
• Auer P (2002) Using confidence bounds for exploitation-exploration trade-offs. J. Machine Learn. Res. 3:397–422.Google Scholar
• Ban GY, Keskin NB (2021) Personalized dynamic pricing with machine learning: High-dimensional features and heterogeneous elasticity. Management Sci. 67(9):5549–5568.Link, Google Scholar
• Bastani H, Bayati M (2020) Online decision making with high-dimensional covariates. Oper. Res. 68(1):276–294.Link, Google Scholar
• Bernstein F, Kök AG, Xie L (2015) Dynamic assortment customization with limited inventories. Manufacturing Service Oper. Management 17(4):538–553.Link, Google Scholar
• Bernstein F, Modaresi S, Sauré D (2018) A dynamic clustering approach to data-driven assortment personalization. Management Sci. 65(5):2095–2115.Google Scholar
• Bobadilla J, Ortega F, Hernando A, Gutiérrez A (2013) Recommender systems survey. Knowledge-Based Systems 46:109–132.Crossref, Google Scholar
• Bubeck S, Cesa-Bianchi N (2012) Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems, Foundations and Trends® in Machine Learning, vol. 5, no. 1.Crossref, Google Scholar
• Burke R (2000) Knowledge-based recommender systems. Encyclopedia of Library and Information Systems, vol. 69, suppl. 32, 175–186.Google Scholar
• Cachon GP, Kök AG (2007) Category management and coordination in retail assortment planning in the presence of basket shopping consumers. Management Sci. 53(6):934–951.Link, Google Scholar
• Caro F, Gallien J (2007) Dynamic assortment with demand learning for seasonal consumer goods. Management Sci. 53(2):276–292.Link, Google Scholar
• Carpentier A, Munos R (2012) Bandit theory meets compressed sensing for high dimensional stochastic linear bandit. Proc. 15th Internat. Conf. Artificial Intelligence Statist., 190–198.Google Scholar
• Chapelle O, Li L (2011) An empirical evaluation of Thompson sampling. Adv. Neural Inform. Processing Systems 24:2249–2257.Google Scholar
• Chen X, Wang Y, Zhou Y (2020) Dynamic assortment optimization with changing contextual information. J. Machine Learn. Res. 21:1–44.Google Scholar
• Chen X, Owen Z, Pixton C, Simchi-Levi D (2022) A statistical learning approach to personalization in revenue management. Management Sci. 68(3):1923–1937.Link, Google Scholar
• Chen X, Shi C, Wang Y, Zhou Y (2021) Dynamic assortment planning under nested logit models. Production Oper. Management 30(1):85–102.Crossref, Google Scholar
• Cheung WC, Simchi-Levi D (2017) Thompson sampling for online personalized assortment optimization problems with multinomial logit choice models. Preprint, submitted November 27, https://dx.doi.org/10.2139/ssrn.3075658.Google Scholar
• Covington P, Adams J, Sargin E (2016) Deep neural networks for YouTube recommendations. Pro. 10th ACM Conf. Recommender Systems (ACM), 191–198.Google Scholar
• Dani V, Hayes TP, Kakade SM (2008) Stochastic linear optimization under bandit feedback. 21st Annual Conf. Learn. Theory, 355–366.Google Scholar
• Feldman J, Zhang DJ, Liu X, Zhang N (2022) Customer choice models vs. machine learning: Finding optimal product displays on Alibaba. Oper. Res. 70(1):309–328.Link, Google Scholar
• Filippi S, Cappe O, Garivier A, Szepesvári C (2010) Parametric bandits: The generalized linear case. Adv. Neural Inform. Processing Systems 23:586–594.Google Scholar
• Frazier PI, Wang J (2016) Bayesian optimization for materials design. Lookman T, Alexander FJ, Rajan K, eds. Information Science for Materials Discovery and Design (Springer, Cham, Switzerland), 45–75.Crossref, Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Gallego G, Li A, Truong VA, Wang X (2016) Online personalized resource allocation with customer choice. Preprint, submitted November 5, 2015, https://arxiv.org/abs/1511.01837v1.Google Scholar
• Gaur V, Honhon D (2006) Assortment planning and inventory decisions under a locational choice model. Management Sci. 52(10):1528–1543.Link, Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Gomez-Uribe CA, Hunt N (2016) The netflix recommender system: Algorithms, business value, and innovation. ACM Trans. Management Inform. Systems 6(4):1–19.Crossref, Google Scholar
• Hazan E (2016) Introduction to Online Convex Optimization, Foundations and Trends® in Optimization, vol. 2, no. 3–4, 157–325.Crossref, Google Scholar
• He J, Chu WW (2010) A social network-based recommender system (SNRS). Data Mining for Social Network Data (Springer), 47–74.Crossref, Google Scholar
• Herlocker JL, Konstan JA, Riedl J (2000) Explaining collaborative filtering recommendations. Proc. 2000 ACM Conf. Comput. Supported Cooperative Work (ACM), 241–250.Google Scholar
• Jolliffe I (2011) Principal Component Analysis (Springer, Berlin, Heidelberg).Google Scholar
• Jun KS, Bhargava A, Nowak R, Willett R (2017) Scalable generalized linear bandits: Online computation and hashing. Thirty-first Conf. Neural Inform. Processing Systems, 99–109.Google Scholar
• Kaban A (2015) Improved bounds on the dot product under random projection and random sign projection. Proc. 21th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining, 487–496.Google Scholar
• Kallus N, Udell M (2020) Dynamic assortment personalization in high dimensions. Oper. Res. 68(4):1020–1037.Link, Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2015) Assortment planning: Review of literature and industry practice. Agrawal N, Smith SA, eds. Retail Supply Chain Management (Springer, Boston), 175–236.Crossref, Google Scholar
• Li G, Rusmevichientong P, Topaloglu H (2015) The d-level nested logit model: Assortment and price optimization problems. Oper. Res. 63(2):325–342.Link, Google Scholar
• Li L, Lu Y, Zhou D (2017) Provably optimal algorithms for generalized linear contextual bandits. Internat. Conf. Machine Learn. (PMLR), 2071–2080.Google Scholar
• Li L, Chu W, Langford J, Schapire RE (2010) A contextual-bandit approach to personalized news article recommendation. Proc. 19th Internat. Conf. World Wide Web, 661–670.Google Scholar
• Li L, Chu W, Langford J, Wang X (2011) Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. Proc. Fourth ACM Internat. Conf. Web Search Data Mining, 297–306.Google Scholar
• Lu J, Shambour Q, Xu Y, Lin Q, Zhang G (2013) A web-based personalized business partner recommendation system using fuzzy semantic techniques. Comput. Intelligence 29(1):37–69.Crossref, Google Scholar
• Lu J, Wu D, Mao M, Wang W, Zhang G (2015) Recommender system application developments: A survey. Decision Support Systems 74:12–32.Crossref, Google Scholar
• Masthoff J (2011) Group recommender systems: Combining individual models. Recommender Systems Handbook (Springer, Boston), 677–702.Crossref, Google Scholar
• Oh Mh, Iyengar G (2019) Thompson sampling for multinomial logit contextual bandits. Adv. Neural Inform. Processing Systems 32:3145–3155.Google Scholar
• Oh Mh, Iyengar G (2021) Multinomial logit contextual bandits: Provable optimality and practicality. Proc. AAAI Conf. Artificial Intelligence, 35(10):9205–9213.Google Scholar
• Oh Mh, Iyengar G, Zeevi A (2021) Sparsity-agnostic LASSO bandit. Internat. Conf. Machine Learn. (PMLR), 8271–8280.Google Scholar
• Pazzani MJ, Billsus D (2007) Content-based recommendation systems. The Adaptive Web (Springer, Berlin, Heidelberg), 325–341.Crossref, Google Scholar
• Rusmevichientong P, Tsitsiklis JN (2010) Linearly parameterized bandits. Math. Oper. Res. 35(2):395–411.Link, Google Scholar
• Rusmevichientong P, Shen ZJM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Ryzin Gv, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496–1509.Link, Google Scholar
• Sarwar B, Karypis G, Konstan J, Riedl J (2001) Item-based collaborative filtering recommendation algorithms. Proc. 10th Internat. Conf. World Wide Web, 285–295.Google Scholar
• Sauré D, Zeevi A (2013) Optimal dynamic assortment planning with demand learning. Manufacturing Service Oper. Management 15(3):387–404.Link, Google Scholar
• Schafer JB, Frankowski D, Herlocker J, Sen S (2007) Collaborative filtering recommender systems. The Adaptive Web (Springer, Berlin, Heidelberg), 291–324.Crossref, Google Scholar
• Sharma A, Hofman JM, Watts DJ (2015) Estimating the causal impact of recommendation systems from observational data. Proc. 16th ACM Conf. Econom. Comput. (ACM), 453–470.Google Scholar
• Shi Y, Larson M, Hanjalic A (2014) Collaborative filtering beyond the user-item matrix: A survey of the state of the art and future challenges. ACM Comput. Surveys 47(1):1–45.Crossref, Google Scholar
• Snoek J, Larochelle H, Adams RP (2012) Practical Bayesian optimization of machine learning algorithms. Adv. Neural Inform. Processing Systems 25:2951–2959.Google Scholar
• Strehl A, Langford J, Li L, Kakade SM (2010) Learning from logged implicit exploration data. Proc. 23rd Internat. Conf. Neural Inform. Processing Systems, vol. 2, 2217–2225.Google Scholar
• Tang L, Jiang Y, Li L, Li T (2014) Ensemble contextual bandits for personalized recommendation. Proc. Eighth ACM Conf. Recommender Systems, 73–80.Google Scholar
• Tibshirani R (1996) Regression shrinkage and selection via the LASSO. J. Roy. Statist. Soc. B 58(1):267–288.Crossref, Google Scholar
• Wang Y, Chen X, Zhou Y (2018) Near-optimal policies for dynamic multinomial logit assortment selection models. Adv. Neural Inform. Processing Systems 31.Google Scholar
• Wang X, Wei MM, Yao T (2019) Online assortment optimization with high-dimensional data. Preprint, submitted February 8, 2020, https://dx.doi.org/10.2139/ssrn.3521843.Google Scholar
• Zhang Z, Lin H, Liu K, Wu D, Zhang G, Lu J (2013) A hybrid fuzzy-based personalized recommender system for telecom products/services. Inform. Sci. 235:117–129.Crossref, Google Scholar
• Zhou L (2015) A survey on contextual multi-armed bandits. Preprint, submitted August 13, https://arxiv.org/abs/1508.03326.Google Scholar