序优化与离线多噪声秘书问题
Ordinal Optimisation and the Offline Multiple Noisy Secretary Problem
摘要:
我们研究了秘书问题的一个变种的成功概率,噪声观测和多个离线选择。我们的配方模拟,并受到激励,涉及随机模拟和基于模拟的优化学科中产生的噪声选择的问题。此外,我们采用了序数优化的哲学-涉及一个序数选择规则,和一个百分位数的概念,目标软化的成功概率。结果表明,成功概率只取决于问题的底层copula。还给出了成功概率的其他一般性质。专门高斯copula的情况下,我们还推导出一个分析下界的成功概率,然后可以被倒置,以找到足够大的样本量,保证一个高的成功概率任意接近1。
英文摘要:
We study the success probability for a variant of the secretary problem, with noisy observations and multiple offline selection. Our formulation emulates, and is motivated by, problems involving noisy selection arising in the disciplines of stochastic simulation and simulation-based optimisation. In addition, we employ the philosophy of ordinal optimisation - involving an ordinal selection rule, and a percentile notion of goal softening for the success probability. As a result, it is shown that the success probability only depends on the underlying copula of the problem. Other general properties for the success probability are also presented. Specialising to the case of Gaussian copulas, we also derive an analytic lower bound for the success probability, which may then be inverted to find sufficiently large sample sizes that guarantee a high success probability arbitrarily close to one.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。