Collaborative Research: Adaptive Allocation Rules in High-Dimensional Settings, with Applications

协作研究：高维设置中的自适应分配规则及其应用

• 批准号: 0855928
• 负责人: Paat Rusmevichientong
• 金额: $ 15万
• 依托单位: Cornell University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2009
• 资助国家: 美国
• 起止时间: 2009-07-01 至 2011-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0855928&HistoricalAwards=false
• 关键词: Collaborative; Research; Adaptive; Allocation; Rules

The research objective of this project is the study of problems in adaptive resource allocation, where the number of available actions is very large or infinite. In these problems, the decision maker chooses an action at each time step and observes some rewards, but the distribution of these rewards is initially unknown. Information is acquired during the decision making process. This introduces a tradeoff between choosing actions that appear most profitable given the available information, and choosing actions that result in additional information on unexplored possibilities. The research will formulate and study a new model, where the rewards of different actions are not independent of each other, but are determined by a small number of underlying random variables. By exploiting the correlation among the rewards, this research will develop policies that quickly identify the optimal action. The models and polices developed in this project will be applied to problems such as web advertising, price optimization, and supply chain management. If successful, the project will result in novel methodologies with immediate usefulness in many applications. The research will also establish the best possible regret and risk that can be attained in such models (as a function of time and of the number of underlying variables), by developing lower bounds on regret and policies that achieve (or nearly achieve) the lower bounds. In addition, the project will result in novel frameworks involving non-stationary environments, and establish a connection with classical problems in adaptive stochastic control. This work will provide a new perspective on some important classes of adaptive decision making problems, including some novel formulations and directions in this field.

该项目的研究目标是研究自适应资源分配问题，其中可用操作的数量非常大或无限。在这些问题中，决策者在每个时间步选择一个动作并观察一些奖励，但这些奖励的分布最初是未知的。信息是在决策过程中获取的。这就引入了一种权衡，选择在给定可用信息的情况下看起来最有利可图的行动，以及选择会产生有关未探索的可能性的附加信息的行动。该研究将制定和研究一种新的模型，其中不同行为的奖励不是相互独立的，而是由少量的底层随机变量决定的。通过利用奖励之间的相关性，这项研究将制定快速识别最佳行动的政策。该项目开发的模型和策略将应用于网络广告、价格优化和供应链管理等问题。如果成功，该项目将产生在许多应用中立即有用的新颖方法。该研究还将通过制定后悔的下限和实现（或接近实现）较低目标的政策，确定在此类模型中可以实现的最佳遗憾和风险（作为时间和基础变量数量的函数）。界限。此外，该项目将产生涉及非平稳环境的新颖框架，并与自适应随机控制中的经典问题建立联系。这项工作将为一些重要类别的自适应决策问题提供新的视角，包括该领域的一些新颖的表述和方向。