删失需求下基于最优特征的报童策略
Optimal Feature-Based Newsvendor Policies under Censored Demand
AI总结:
针对删失需求下的报童问题,提出模型无关的损失函数方法,可高效估计最优订购量,在合成与真实零售数据上均表现良好。
摘要:
我们研究一类报童问题:决策者观测到一个z维协变量向量,希望利用大小为n的删失需求数据样本学习应订购的库存量,以最小化成本。当库存不足以满足需求时,需求会被删失,且过往的订购量是已知的。我们提出一种新的与模型无关的损失函数方法,用于利用观测数据估计最优订购量,并将最优报童策略刻画为最小化我们所提损失函数的策略。该方法仅需单步估计,可扩展至包含数十万数据点的数据集,且不会出现逆删失概率加权方法的同类不稳定性问题。我们描述了该损失函数如何在线性经验风险最小化、核权重优化及深度神经网络算法中实现,并为它们的样本外性能提供了超额风险泛化界。此外,我们通过数值实验表明,该方法在合成数据上可快速收敛至最优策略,且在真实零售数据上能提升性能。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。