Online Personalized Assortment Optimization with High-Dimensional Customer Contextual Data

Sentao Miao () and Xiuli Chao ()
Additional contact information
Sentao Miao: Desautels Faculty of Management, McGill University, Montreal, Quebec H3A 1G5 Canada
Xiuli Chao: Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109

Manufacturing & Service Operations Management, 2022, vol. 24, issue 5, 2741-2760

Abstract: Problem definition : Consider an online personalized assortment optimization problem in which customers arrive sequentially and make their decisions (e.g., click an ad, purchase a product) following the multinomial logit choice model with unknown parameters. Utilizing a customer’s personal information that is high-dimensional, the firm selects an assortment tailored for each individual customer’s preference. Academic/practical relevance : High dimensionality of a customer’s contextual information is prevalent in real applications, and it creates tremendous computational challenge in online personalized optimization. Methodology : In this paper, an efficient learning algorithm is developed to tackle the computational complexity issue while maintaining satisfactory performance. The algorithm first applies a random projection for dimension reduction and incorporates an online convex optimization procedure for parameter estimation, thus overcoming the issue of linearly increasing computational requirement as data accumulates. Then, it integrates the upper confidence bound method to balance the exploration and revenue exploitation. Results : The theoretical performance of the algorithm in terms of regret is derived under some plausible sparsity assumption on personal information that is observed in real data, and numerical experiments using both synthetic data and a real data set from Yahoo! show that the algorithm performs very well, having scalability and significant advantage in computational time compared with benchmark methods. Managerial implications : Our findings suggest that practitioners should process high-dimensional sparse customer data with an appropriate feature engineering technique, such as random projection (instead of abandoning the sparse portion) to maximize the effectiveness of online optimization algorithms.

Keywords: assortment optimization; personalized data; online learning; high dimension; online convex optimization; random projection; regret (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/msom.2022.1128 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormsom:v:24:y:2022:i:5:p:2741-2760

Access Statistics for this article

More articles in Manufacturing & Service Operations Management from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().