Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 43 min ago
PreprintarXiv licencearXiv

Optimal Feature-Based Newsvendor Policies under Censored Demand

Abstract

We investigate a newsvendor problem where a decision-maker observes a z-dimensional vector of covariates, and wants to learn how much stock to order given a sample of size n of censored demand data to minimize costs. Demand is censored when insufficient stock is available to meet it, and past stocking quantities are known. We propose a new model-agnostic loss function approach to estimate optimal order quantities using observational data, and characterize the optimal newsvendor policy as the policy that minimizes our proposed loss function. Our method requires only a single estimation step, can be scaled to datasets with hundreds of thousands of data points, and does not suffer from the same instabilities as inverse censoring probability weighting methods. We describe how this loss function can be implemented in linear empirical risk minimization, kernel weights optimization and deep neural network algorithms, and provide excess risk generalization bounds for their out-of-sample performance. Moreover, we show through numerical experiments that our method quickly converges to the optimal policy on synthetic data, and leads to improved performance on real world retail data.

Related

  1. Towards Optimal Inventory Control under Censored Demand: A Biased Sample-Average Approximation Approach
    Yuxuan Han, Xiaoyu Fan, Jiawei Zhang +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Inventory Policies with Returns and Demand Uncertainty: Optimal, Fixed-Quantity, and Order Cancellation Models
    Yonit Barron, Guy Pery
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  3. Regret in the Newsvendor Model with Demand and Yield Randomness
    Zhi Chen, Weijun Xie
    Production and Operations ManagementPeer-reviewedLicence not stated50 citedOptimisation & controlHAL
  4. Overcoming Demand Censoring through Randomization for Risk-Sensitive Newsvendor Learning
    Zhengchao Wang, Nam Ho-Nguyen
    arXivPreprintCC BY-NC-SA 4.0Full textOptimisation & controlarXiv
  5. Variable Selection for Feature-Based Newsvendor
    Zhaoliang Yuan, Jie Wang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{haar2026optimal,
  title = {{Optimal Feature-Based Newsvendor Policies under Censored Demand}},
  author = {Joost van der Haar and Ilias Willems and Joachim Arts and Ingrid Van Keilegom},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.17465},
  eprint = {2610.17465},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.17465},
}
RIS
TY  - UNPB
TI  - Optimal Feature-Based Newsvendor Policies under Censored Demand
AU  - Joost van der Haar
AU  - Ilias Willems
AU  - Joachim Arts
AU  - Ingrid Van Keilegom
PY  - 2026
DA  - 2026/10/19
PB  - arXiv
DO  - 10.48550/arxiv.2610.17465
UR  - https://arxiv.org/abs/2610.17465
AB  - We investigate a newsvendor problem where a decision-maker observes a z-dimensional vector of covariates, and wants to learn how much stock to order given a sample of size n of censored demand data to minimize costs. Demand is censored when insufficient stock is available to meet it, and past stocking quantities are known. We propose a new model-agnostic loss function approach to estimate optimal order quantities using observational data, and characterize the optimal newsvendor policy as the policy that minimizes our proposed loss function. Our method requires only a single estimation step, can be scaled to datasets with hundreds of thousands of data points, and does not suffer from the same instabilities as inverse censoring probability weighting methods. We describe how this loss function can be implemented in linear empirical risk minimization, kernel weights optimization and deep neural network algorithms, and provide excess risk generalization bounds for their out-of-sample performance. Moreover, we show through numerical experiments that our method quickly converges to the optimal policy on synthetic data, and leads to improved performance on real world retail data.
ER  -