用于选择足够好子集的高效采样策略
Efficient Sampling Policy for Selecting a Good Enough Subset
AI总结:
针对固定仿真预算下从有限备选方案中选足够好子集的问题,提出基于值函数近似的贝叶斯序贯采样策略,分析其渐近性质,实验验证了效率。
摘要:
本文研究在固定仿真预算下,从有限个备选方案中选出一个足够好子集的问题。我们的工作旨在最大化正确选出好子集的后验概率。我们将动态采样决策建模为贝叶斯框架下的随机控制问题。在近似动态规划范式下,我们提出了一种基于值函数近似的序贯采样策略,并分析了该采样策略的渐近性质。数值实验验证了所提方法的效率。
英文摘要:
The note studies the problem of selecting a good enough subset out of a finite number of alternatives under a fixed simulation budget. Our work aims to maximize the posterior probability of correctly selecting a good subset. We formulate the dynamic sampling decision as a stochastic control problem in a Bayesian setting. In an approximate dynamic programming paradigm, we propose a sequential sampling policy based on value function approximation. We analyze the asymptotic property of the proposed sampling policy. Numerical experiments demonstrate the efficiency of the proposed procedure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。