arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.05640cs.AIcs.LGstat.ML
收藏

利用在线学习实现库存平衡

Inventory Balancing with Online Learning

National University of Singapore(新加坡国立大学);Columbia University(哥伦比亚大学);Massachusetts Institute of Technology(麻省理工学院)

Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang

摘要:

我们研究了一个一般性的问题,分配有限的资源,随着时间的推移异构客户模型的不确定性。每种类型的客户都可以使用不同的操作来服务,每个操作随机消耗一些资源组合,并为所消耗的资源返回不同的奖励。我们考虑一个通用模型,其中与每个(客户类型,动作)组合相关联的资源消耗分布是未知的,但是一致的,可以随着时间的推移而学习。此外,客户类型随时间到达的顺序是任意的,完全未知。我们克服了模型的不确定性和客户异质性的挑战,明智地合成两个算法框架,从文献:库存平衡,“保留”的一部分,每种资源的高回报的客户类型,以后可能会到达,和在线学习,它显示了如何“探索”的资源消耗分布的每种客户类型下不同的行动。我们定义了一个辅助问题,它允许现有的竞争比和遗憾界限无缝集成。此外,我们表明,我们的框架所产生的性能保证是紧的,也就是说,我们提供了一个信息理论的下限,这表明,从竞争比损失和损失的遗憾是相关的组合问题。最后,我们证明了我们的算法在公开的酒店数据集上的有效性。我们的框架是非常实用的,因为它不需要历史数据(没有拟合的客户选择模型,也没有预测客户的到来模式),并可用于在快速变化的环境中初始化分配策略。

英文摘要:

We study a general problem of allocating limited resources to heterogeneous customers over time under model uncertainty. Each type of customer can be serviced using different actions, each of which stochastically consumes some combination of resources, and returns different rewards for the resources consumed. We consider a general model where the resource consumption distribution associated with each (customer type, action)-combination is not known, but is consistent and can be learned over time. In addition, the sequence of customer types to arrive over time is arbitrary and completely unknown. We overcome both the challenges of model uncertainty and customer heterogeneity by judiciously synthesizing two algorithmic frameworks from the literature: inventory balancing, which "reserves" a portion of each resource for high-reward customer types which could later arrive, and online learning, which shows how to "explore" the resource consumption distributions of each customer type under different actions. We define an auxiliary problem, which allows for existing competitive ratio and regret bounds to be seamlessly integrated. Furthermore, we show that the performance guarantee generated by our framework is tight, that is, we provide an information-theoretic lower bound which shows that both the loss from competitive ratio and the loss for regret are relevant in the combined problem. Finally, we demonstrate the efficacy of our algorithms on a publicly available hotel data set. Our framework is highly practical in that it requires no historical data (no fitted customer choice models, nor forecasting of customer arrival patterns) and can be used to initialize allocation strategies in fast-changing environments.

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

↑