The Nonstationary Newsvendor with (and Without) Predictions

References

• An L, Li AA, Moseley B, Visotsky G (2024) Best of many in both worlds: Online resource allocation with predictions under unknown arrival model. Preprint, submitted February 21, https://arxiv.org/abs/2402.13530.Google Scholar
• Antoniadis A, Gouleakis T, Kleer P, Kolev P (2020) Secretary and online matching problems with machine learned advice. Advances in Neural Information Processing Systems, vol. 33 (Curran Associates, Inc., Red Hook, NY), 7933–7944.Google Scholar
• Arrow KJ, Karlin S, Scarf H (1958) Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA).Google Scholar
• Aviv Y, Pazgal A (2005) A partially observed Markov decision process for dynamic pricing. Management Sci. 51(9):1400–1416.Link, Google Scholar
• Azoury KS (1985) Bayes solution to dynamic inventory models under unknown demand distribution. Management Sci. 31(9):1150–1160.Link, Google Scholar
• Baby D, Wang YX (2019) Online forecasting of total-variation-bounded sequences. Advances in Neural Information Processing Systems, vol. 32 (Curran Associates, Inc., Red Hook, NY).Google Scholar
• Bai Y, Zhang YJ, Zhao P, Sugiyama M, Zhou ZH (2022) Adapting to online label shift with provable guarantees. Advances in Neural Information Processing Systems, vol. 35 (Curran Associates Inc., Red Hook, NY), 29960–29974.Google Scholar
• Balseiro S, Kroer C, Kumar R (2022) Single-leg revenue management with advice. Preprint, submitted February 18, https://arxiv.org/abs/2202.10939.Google Scholar
• Ban GY, Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.Link, Google Scholar
• Besbes O, Muharremoglu A (2013) On implications of demand censoring in the newsvendor problem. Management Sci. 59(6):1407–1424.Link, Google Scholar
• Besbes O, Gur Y, Zeevi A (2014) Stochastic multi-armed-bandit problem with non-stationary rewards. Advances in Neural Information Processing Systems, vol. 27 (Curran Associates Inc., Red Hook, NY).Google Scholar
• Besbes O, Gur Y, Zeevi A (2015) Non-stationary stochastic optimization. Oper. Res. 63(5):1227–1244.Link, Google Scholar
• Burnetas AN, Smith CE (2000) Adaptive ordering and pricing for perishable products. Oper. Res. 48(3):436–443.Link, Google Scholar
• Chen B, Chao X, Ahn HS (2019a) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67(4):1035–1052.Abstract, Google Scholar
• Chen X, Wang Y, Wang YX (2019b) Nonstationary stochastic optimization under l p, q-variation measures. Oper. Res. 67(6):1752–1765.Link, Google Scholar
• Cheung WC, Simchi-Levi D, Zhu R (2022) Hedging the drift: Learning to optimize under nonstationarity. Management Sci. 68(3):1696–1713.Link, Google Scholar
• Dütting P, Lattanzi S, Paes Leme R, Vassilvitskii S (2021) Secretaries with advice. Proc. 22nd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 409–429.Google Scholar
• Edgeworth FY (1888) The mathematical theory of banking. J. Roy. Statis. Soc. 51(1):113–127.Google Scholar
• Godfrey GA, Powell WB (2001) An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47(8):1101–1112.Link, Google Scholar
• Hao B, Jain R, Lattimore T, Van Roy B, Wen Z (2023) Leveraging demonstrations to improve online learning: Quality matters. Proc. 40th Internat. Conf. Machine Learn. (JMLR.org).Google Scholar
• Hu P, Jiang J, Lyu G, Su H (2024) Constrained online two-stage stochastic optimization: Algorithm with (and without) predictions. Preprint, submitted January 2, https://arxiv.org/abs/2401.01077.Google Scholar
• Huang C, Wang K (2023) A stability principle for learning under non-stationarity. Preprint, submitted October 27, https://arxiv.org/abs/2310.18304.Google Scholar
• Huber J, Müller S, Fleischmann M, Stuckenschmidt H (2019) A data-driven newsvendor problem: From data to decision. Eur. J. Oper. Res. 278(3):904–915.Crossref, Google Scholar
• Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1):103–123.Link, Google Scholar
• Iglehart DL (1964) The dynamic inventory problem with unknown demand distribution. Management Sci. 10(3):429–440.Link, Google Scholar
• Jin B, Ma W (2022) Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model. Advances in Neural Information Processing Systems, vol. 35 (Curran Associates Inc., Red Hook, NY), 14555–14567.Google Scholar
• Karlin S (1960) Dynamic inventory policy with varying stochastic demands. Management Sci. 6(3):231–258.Link, Google Scholar
• Karnin ZS, Anava O (2016) Multi-armed bandits: Competing with optimal sequences. Advances in Neural Information Processing Systems, vol. 29 (Curran Associates Inc., Red Hook, NY).Google Scholar
• Ke G, Meng Q, Finley T, Wang T, Chen W, Ma W, Ye Q, Liu T-Y (2017) Lightgbm: A highly efficient gradient boosting decision tree. Advances in Neural Information Processing Systems, vol. 30 (Curran Associates Inc., Red Hook, NY).Google Scholar
• Keskin NB, Zeevi A (2017) Chasing demand: Learning and earning in a changing environment. Math. Oper. Res. 42(2):277–307.Link, Google Scholar
• Keskin NB, Min X, Song JSJ (2023) The nonstationary newsvendor: Data-driven nonparametric learning. Preprint, submitted June 7, https://dx.doi.org/10.2139/ssrn.3866171.Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kunnumkal S, Topaloglu H (2008) Using stochastic approximation methods to compute optimal base-stock levels in inventory control problems. Oper. Res. 56(3):646–664.Link, Google Scholar
• Lattanzi S, Lavastida T, Moseley B, Vassilvitskii S (2020) Online scheduling via learned weights. SODA (SIAM, Philadelphia), 1859–1877.Google Scholar
• Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.Link, Google Scholar
• Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.Link, Google Scholar
• Liyanage LH, Shanthikumar JG (2005) A practical inventory control policy using operational statistics. Oper. Res. Lett. 33(4):341–348.Crossref, Google Scholar
• Lovejoy WS (1990) Myopic policies for some inventory models with uncertain demand distributions. Management Sci. 36(6):724–738.Link, Google Scholar
• Luo H, Wei CY, Agarwal A, Langford J (2018) Efficient contextual bandits in non-stationary worlds. Conf. Learn. Theory (PMLR), 1739–1776.Google Scholar
• Lykouris T, Vassilvitskii S (2021) Competitive caching with machine learned advice. J. ACM 68(4):1–25.Crossref, Google Scholar
• Mahdian M, Nazerzadeh H, Saberi A (2012) Online optimization with uncertain information. ACM Trans. Algorithms 8(1):1–29.Crossref, Google Scholar
• Makridakis S, Hibon M (2000) The m3-competition: Results, conclusions and implications. Internat. J. Forecast. 16(4):451–476.Crossref, Google Scholar
• Makridakis S, Spiliotis E, Assimakopoulos V (2022) M5 accuracy competition: Results, findings, and conclusions. Internat. J. Forecast. 38(4):1346–1364.Crossref, Google Scholar
• Munoz A, Vassilvitskii S (2017) Revenue optimization with approximate bid predictions. Advances in Neural Information Processing Systems, vol. 30 (Curran Associates Inc., Red Hook, NY).Google Scholar
• Oroojlooyjadid A, Snyder LV, Takáč M (2020) Applying deep learning to the newsvendor problem. IISE Trans. 52(4):444–463.Crossref, Google Scholar
• Powell W, Ruszczyński A, Topaloglu H (2004) Learning algorithms for separable approximations of discrete stochastic optimization problems. Math. Oper. Res. 29(4):814–836.Link, Google Scholar
• Rohatgi D (2020) Near-optimal bounds for online caching with machine learned advice. Proc. Fourteenth Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1834–1845.Google Scholar
• Scarf H (1959) Bayes solutions of the statistical inventory problem. Ann. Math. Statist. 30(2):490–508.Crossref, Google Scholar
• Scarf H, Arrow K, Karlin S, Suppes P (1960) The optimality of (s, s) policies in the dynamic inventory problem. Optimal Pricing, Inflation, and the Cost of Price Adjustment, 49–56.Google Scholar
• Shapiro A (2003) Monte Carlo sampling methods. Handbooks Oper. Res. Management Sci. 10:353–425. Google Scholar
• Taylor SJ, Letham B (2018) Forecasting at scale. Amer. Statist. 72(1):37–45.Crossref, Google Scholar
• Treharne JT, Sox CR (2002) Adaptive inventory control for nonstationary demand and partial information. Management Sci. 48(5):607–624.Link, Google Scholar
• Winters PR (1960) Forecasting sales by exponentially weighted moving averages. Management Sci. 6(3):324–342.Link, Google Scholar
• Yang T, Zhang L, Jin R, Yi J (2016) Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient. Internat. Conf. Machine Learn. (PMLR), 449–457.Google Scholar
• Zhang L, Lu S, Zhou ZH (2018) Adaptive online learning in dynamic environments. NIPS 31.Google Scholar
• Zhang L, Yang J, Gao R (2024) Optimal robust policy for feature-based newsvendor. Management Sci. 70(4):2315–2329.Link, Google Scholar