arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.02742math.OC
收藏

你的数据到底应该有多大?数据驱动的报童:一次学习一个样本

How Big Should Your Data Really Be? Data-Driven Newsvendor: Learning One Sample at a Time

Omar Besbes, Omar Mouchtaki

摘要:

我们研究了经典的报童问题,决策者必须权衡未成年和超龄成本。与典型的设置相反,我们假设决策者不知道驱动不确定性的潜在分布,而只能访问历史数据。反过来,关键问题是如何将现有数据映射到决策,以及作为数据大小的函数期望什么类型的性能。我们分析了经典的设置与访问过去的样本从分布(例如,过去的需求),不仅关注渐近性能,而且关注我们所说的学习的瞬态状态,即,任意数据大小的性能。我们评估任何算法的性能,通过其最坏情况下的相对预期的遗憾,相比与知识的分布的甲骨文。我们提供了第一个有限样本精确分析的经典样本平均近似(SAA)算法,这类问题在所有的数据大小。这使得我们能够发现关于数据价值的新的基本见解:它揭示了数十个样本足以非常有效地执行,但更多的数据可能会导致SAA的样本外性能更差。然后,我们专注于一般类的映射从数据到决策,没有任何限制的政策集,并得出一个最优算法(在极大极小意义上),以及其相关的性能特征。这导致了有限数据大小的显着改进,并允许精确量化历史信息的价值。

英文摘要:

We study the classical newsvendor problem in which the decision-maker must trade-off underage and overage costs. In contrast to the typical setting, we assume that the decision-maker does not know the underlying distribution driving uncertainty but has only access to historical data. In turn, the key questions are how to map existing data to a decision and what type of performance to expect as a function of the data size. We analyze the classical setting with access to past samples drawn from the distribution (e.g., past demand), focusing not only on asymptotic performance but also on what we call the transient regime of learning, i.e., performance for arbitrary data sizes. We evaluate the performance of any algorithm through its worst-case relative expected regret, compared to an oracle with knowledge of the distribution. We provide the first finite sample exact analysis of the classical Sample Average Approximation (SAA) algorithm for this class of problems across all data sizes. This allows to uncover novel fundamental insights on the value of data: it reveals that tens of samples are sufficient to perform very efficiently but also that more data can lead to worse out-of-sample performance for SAA. We then focus on the general class of mappings from data to decisions without any restriction on the set of policies and derive an optimal algorithm (in the minimax sense) as well as characterize its associated performance. This leads to significant improvements for limited data sizes, and allows to exactly quantify the value of historical information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑