Demand Forecasting of Individual Probability Density Functions with Machine Learning
F. Wick, U. Kerzel, M. Hahn, M. Wolf, T. Singhal, D., Stemmer, J. Ernst, M. Feindt

TL;DR
This paper introduces a machine learning approach using Cyclic Boosting to predict complete demand probability density functions, enhancing explainability and reducing temporal confounding in retail demand forecasting.
Contribution
It presents a novel method for forecasting full demand distributions with explainability, addressing limitations of existing point estimate models and evaluation techniques.
Findings
Predicts individual demand distributions accurately
Provides fully explainable demand forecasts
Reduces impact of temporal confounding
Abstract
Demand forecasting is a central component of the replenishment process for retailers, as it provides crucial input for subsequent decision making like ordering processes. In contrast to point estimates, such as the conditional mean of the underlying probability distribution, or confidence intervals, forecasting complete probability density functions allows to investigate the impact on operational metrics, which are important to define the business strategy, over the full range of the expected demand. Whereas metrics evaluating point estimates are widely used, methods for assessing the accuracy of predicted distributions are rare, and this work proposes new techniques for both qualitative and quantitative evaluation methods. Using the supervised machine learning method "Cyclic Boosting", complete individual probability density functions can be predicted such that each prediction is fully…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
