Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing

Data-driven sequential decision has found a wide range of applications in modern operations management, such as dynamic pricing, inventory control, and assortment optimization. Most existing research on data-driven sequential decision focuses on designing an online policy to maximize the revenue. However, the research on uncertainty quantification on the underlying true model function (e.g., demand function), a critical problem for practitioners, has not been well explored. In this paper, using the problem of demand function prediction in dynamic pricing as the motivating example, we study the problem of constructing accurate confidence intervals for the demand function. The main challenge is that sequentially collected data leads to significant distributional bias in the maximum likelihood estimator or the empirical risk minimization estimate, making classical statistics approaches such as the Wald's test no longer valid. We address this challenge by developing a debiased approach and provide the asymptotic normality guarantee of the debiased estimator. Based this the debiased estimator, we provide both point-wise and uniform confidence intervals of the demand function.

[1]  B. M. Brown,et al.  Martingale Central Limit Theorems , 1971 .

[2]  T. Lai,et al.  Least Squares Estimates in Stochastic Regression Models with Applications to Identification and Control of Dynamic Systems , 1982 .

[3]  C. Watkins Learning from delayed rewards , 1989 .

[4]  Ben J. A. Kröse,et al.  Learning from delayed rewards , 1995, Robotics Auton. Syst..

[5]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[6]  Stephen M. Stigler,et al.  Statistics on the Table: The History of Statistical Concepts and , 1999 .

[7]  S. R. Jammalamadaka,et al.  Empirical Processes in M-Estimation , 2001 .

[8]  Li Chen,et al.  Dynamic Inventory Management with Learning About the Demand Distribution and Substitution Probability , 2008, Manuf. Serv. Oper. Manag..

[9]  Omar Besbes,et al.  Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms , 2009, Oper. Res..

[10]  John N. Tsitsiklis,et al.  Linearly Parameterized Bandits , 2008, Math. Oper. Res..

[11]  Aurélien Garivier,et al.  Parametric Bandits: The Generalized Linear Case , 2010, NIPS.

[12]  James B. Orlin,et al.  Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator , 2011, Oper. Res..

[13]  Cun-Hui Zhang,et al.  Confidence intervals for low dimensional parameters in high dimensional linear models , 2011, 1110.2563.

[14]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[15]  Huseyin Topaloglu,et al.  Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model , 2012, Oper. Res..

[16]  Josef Broder,et al.  Dynamic Pricing Under a General Parametric Choice Model , 2012, Oper. Res..

[17]  Csaba Szepesvári,et al.  Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits , 2012, AISTATS.

[18]  J. Norris Appendix: probability and measure , 1997 .

[19]  Assaf J. Zeevi,et al.  Optimal Dynamic Assortment Planning with Demand Learning , 2013, Manuf. Serv. Oper. Manag..

[20]  S. Geer,et al.  On asymptotically optimal confidence regions and tests for high-dimensional models , 2013, 1303.0518.

[21]  Adel Javanmard,et al.  Confidence intervals and hypothesis testing for high-dimensional regression , 2013, J. Mach. Learn. Res..

[22]  Zizhuo Wang,et al.  Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems , 2014, Oper. Res..

[23]  Near-Optimal Bisection Search for Nonparametric Dynamic Pricing with Inventory Constraint , 2014 .

[24]  D. Simchi-Levi,et al.  A Statistical Learning Approach to Personalization in Revenue Management , 2015, Manag. Sci..

[25]  Omar Besbes,et al.  On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning , 2014, Manag. Sci..

[26]  X. Chao,et al.  Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost-Sales and Censored Demand , 2015 .

[27]  X. Chao,et al.  Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning , 2015, Oper. Res..

[28]  Mohsen Bayati,et al.  Dynamic Pricing with Demand Covariates , 2016, 1604.07463.

[29]  Bin Hu,et al.  MANUFACTURING & SERVICE OPERATIONS MANAGEMENT , 2017 .

[30]  Xi Chen,et al.  Dynamic Assortment Selection under the Nested Logit Models , 2018, ArXiv.

[31]  Xi Chen,et al.  Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models , 2018, NeurIPS.

[32]  Vasilis Syrgkanis,et al.  Accurate Inference for Adaptive Linear Models , 2017, ICML.

[33]  Xi Chen,et al.  Context‐based dynamic pricing with online clustering , 2019, Production and Operations Management.

[34]  Vashist Avadhanula,et al.  MNL-Bandit: A Dynamic Learning Approach to Assortment Selection , 2017, Oper. Res..

[35]  Sivaraman Balakrishnan,et al.  Rate Optimal Estimation and Confidence Intervals for High-dimensional Regression with Missing Covariates , 2017, J. Multivar. Anal..

[36]  Gah-Yi Ban,et al.  Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring , 2020, Oper. Res..

[37]  Adel Javanmard,et al.  Online Debiasing for Adaptively Collected High-Dimensional Data With Applications to Time Series Analysis , 2019, Journal of the American Statistical Association.