arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.07030stat.MLcs.LG
收藏

一类序贯检验问题的扩散逼近

Diffusion Approximations for a Class of Sequential Testing Problems

American University of Beirut(贝鲁特美国大学);The University of Chicago(芝加哥大学)

Victor F. Araman, Rene Caldentey

摘要:

我们考虑一个决策者,他必须选择一个行动,以最大化也取决于未知参数Θ的奖励函数。决策者可以延迟采取行动,以便进行实验并收集有关Θ的其他信息。我们使用贝叶斯序贯实验框架来建模决策者的问题,并使用动态规划和扩散渐近分析来解决它。为此,我们以每单位时间进行的实验的平均数量很大且每个单独实验的信息量很低的方式来扩展我们的问题。在这种制度下,我们推导出一个扩散近似的顺序实验问题,这提供了一些重要的见解的性质的问题和它的解决方案。我们的解决方案的方法也表明,问题的复杂性增长只有二次方的基数的行动,决策者可以选择。我们说明了我们的方法和结果,使用一个具体的应用范围内的品种选择和新产品介绍。具体来说,我们研究的问题,卖方谁想要选择一个最佳的产品组合推出到市场上,是不确定的消费者的喜好。受电子商务中新兴实践的启发,我们假设卖家能够使用群体投票系统来学习这些偏好,然后再做出最终的分类决策。在这种情况下,我们进行了广泛的数值分析,以评估学习的价值,并证明了扩散近似的有效性和鲁棒性。

英文摘要:

We consider a decision maker who must choose an action in order to maximize a reward function that depends also on an unknown parameter Θ. The decision maker can delay taking the action in order to experiment and gather additional information on Θ. We model the decision maker's problem using a Bayesian sequential experimentation framework and use dynamic programming and diffusion-asymptotic analysis to solve it. For that, we scale our problem in a way that both the average number of experiments that is conducted per unit of time is large and the informativeness of each individual experiment is low. Under such regime, we derive a diffusion approximation for the sequential experimentation problem, which provides a number of important insights about the nature of the problem and its solution. Our solution method also shows that the complexity of the problem grows only quadratically with the cardinality of the set of actions from which the decision maker can choose. We illustrate our methodology and results using a concrete application in the context of assortment selection and new product introduction. Specifically, we study the problem of a seller who wants to select an optimal assortment of products to launch into the marketplace and is uncertain about consumers' preferences. Motivated by emerging practices in e-commerce, we assume that the seller is able to use a crowdvoting system to learn these preferences before a final assortment decision is made. In this context, we undertake an extensive numerical analysis to assess the value of learning and demonstrate the effectiveness and robustness of the heuristics derived from the diffusion approximation.

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

↑