Deep Neural Newsvendor

We consider a data-driven newsvendor problem, where one has access to past demand data and the associated feature information. We solve the problem by estimating the target conditional quantile function using a deep neural network (DNN). The remarkable representational power of DNNs allows our framework to incorporate or approximate various extant data-driven models. We provide theoretical guarantees in terms of excess risk bounds for the DNN solution characterized by the network structure and sample size in a nonasymptotic manner, which justify the applicability of DNNs in relevant contexts. Specifically, the convergence rate of the excess risk bound with respect to the sample size increases in the smoothness of the target quantile function but decreases in the dimension of feature variables. This rate can be further accelerated when the target function possesses a composite structure. In particular, our theoretical framework can be extended to accommodate data-dependent scenarios, where the data-generating process could be time-dependent but not necessarily identical over time. Building on our theoretical results, we provide further managerial insights and practical guidance through simulation studies. Finally, we apply the DNN method to a real-world data set obtained from a food supermarket. Our numerical experiments demonstrate that (1) the DNN method consistently outperforms alternatives across a wide range of cost parameters, and (2) it exhibits good performance when the sample size is either very large or relatively limited. This paper was accepted by Jeannette Song, operations management. Funding: This work was supported by the Natural Sciences and Engineering Research Council of Canada [Grant RGPIN-2021-04295]; the National Natural Science Foundation of China [Project: Data-Driven Operations Analytics Methods]; the Fundamental Research Funds for the Central Universities, Peking University; the General Research Fund of the Hong Kong Research Grants Council [Grant 15305523]; and the Research Fund of the Hong Kong Polytechnic University [Grant P0048718]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.03157 .

Authors

Institutions

Publication Details

Journal
Management Science
Published
2025-11-03
DOI
https://doi.org/10.1287/mnsc.2023.03157
Citations
2
Primary Topic
Supply Chain and Inventory Management
Type
article
Field-Weighted Citation Impact
4.57
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deep Neural Newsvendor

Jinhui Han, Guohao Shen, Ming Hu
2 citations
Management Science
Supply Chain and Inventory Management
4.57
article

Deep Neural Newsvendor

Jinhui Han, Guohao Shen, Ming Hu
article en
2 citations

Abstract

We consider a data-driven newsvendor problem, where one has access to past demand data and the associated feature information. We solve the problem by estimating the target conditional quantile function using a deep neural network (DNN). The remarkable representational power of DNNs allows our framework to incorporate or approximate various extant data-driven models. We provide theoretical guarantees in terms of excess risk bounds for the DNN solution characterized by the network structure and sample size in a nonasymptotic manner, which justify the applicability of DNNs in relevant contexts. Specifically, the convergence rate of the excess risk bound with respect to the sample size increases in the smoothness of the target quantile function but decreases in the dimension of feature variables. This rate can be further accelerated when the target function possesses a composite structure. In particular, our theoretical framework can be extended to accommodate data-dependent scenarios, where the data-generating process could be time-dependent but not necessarily identical over time. Building on our theoretical results, we provide further managerial insights and practical guidance through simulation studies. Finally, we apply the DNN method to a real-world data set obtained from a food supermarket. Our numerical experiments demonstrate that (1) the DNN method consistently outperforms alternatives across a wide range of cost parameters, and (2) it exhibits good performance when the sample size is either very large or relatively limited. This paper was accepted by Jeannette Song, operations management. Funding: This work was supported by the Natural Sciences and Engineering Research Council of Canada [Grant RGPIN-2021-04295]; the National Natural Science Foundation of China [Project: Data-Driven Operations Analytics Methods]; the Fundamental Research Funds for the Central Universities, Peking University; the General Research Fund of the Hong Kong Research Grants Council [Grant 15305523]; and the Research Fund of the Hong Kong Polytechnic University [Grant P0048718]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.03157 .

Management Science
Hong Kong Polytechnic University (HK), University of Toronto (CA), Peking University (CN)
Openalex Percentile: Top 5%
Supply Chain and Inventory Management
4.57
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.