Calibrating Sales Forecasts in a Pandemic Using Competitive Online Nonparametric Regression

Author:

Simchi-Levi David123ORCID,Sun Rui4ORCID,Wu Michelle Xiao1ORCID,Zhu Ruihao5ORCID

Affiliation:

1. Institute for Data, Systems, and Society, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;

2. Department of Civil and Environmental Engineering, Cambridge, Massachusetts 02139;

3. Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;

4. Amazon, Seattle, Washington 98109;

5. SC Johnson College of Business, Cornell University, Ithaca, New York 14853

Abstract

Motivated by our collaboration with Anheuser-Busch InBev (AB InBev), a consumer packaged goods (CPG) company, we consider the problem of forecasting sales under the coronavirus disease 2019 (COVID-19) pandemic. Our approach combines nonparametric regression, game theory, and pandemic modeling to develop a data-driven competitive online nonparametric regression method. Specifically, the method takes the future COVID-19 case estimates, which can be simulated via the susceptible-infectious-removed (SIR) epidemic model as an input, and outputs the level of calibration for the baseline sales forecast generated by AB InBev. In generating the calibration level, we focus on an online learning setting where our algorithm sequentially predicts the label (i.e., the level of calibration) of a random covariate (i.e., the current number of active cases) given past observations and the generative process (i.e., the SIR epidemic model) of future covariates. To provide robust performance guarantee, we derive our algorithm by minimizing regret, which is the difference between the squared [Formula: see text]-norm associated with labels generated by the algorithm and labels generated by an adversary and the squared [Formula: see text]-norm associated with labels generated by the best isotonic (nondecreasing) function in hindsight and the adversarial labels. We develop a computationally efficient algorithm that attains the minimax-optimal regret over all possible choices of the labels (possibly non-i.i.d. and even adversarial). We demonstrate the performances of our algorithm on both synthetic and AB InBev’s data sets of three different markets (each corresponds to a country) from March 2020 to March 2021. The AB InBev’s numerical experiments show that our method is capable of reducing the forecast error in terms of weighted mean absolute percentage error (WMAPE) and mean squared error (MSE) by more than 37% for the company. This paper was accepted by J. George Shanthikumar, data science. Funding: This work was partially supported by the Massachusetts Institute of Technology Data Science Lab and AB-InBev Corporation. Supplemental Material: The e-companion and data are available at https://doi.org/10.1287/mnsc.2023.4969 .

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Strategy and Management

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. MERIT: A Merchant Incentive Ranking Model for Hotel Search & Ranking;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3