arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.01026cs.LG
收藏

自适应多臂辨识

Adaptive Multiple-Arm Identification

Indiana University at Bloomington(印第安纳大学伯明顿分校);New York University(纽约大学)

Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou

摘要:

研究了随机$n$ -武装强盗博弈中具有最高期望回报的$K$武器的选择问题.该问题具有广泛的应用,例如,A/B测试、众包、仿真优化。我们的目标是开发一个PAC算法,它的概率至少为$1-δ$,确定一组$K$武器的总遗憾最多$ε$。\cite{Zhou:14}中首次引入了多臂识别的总后悔的概念,它被定义为所选择的一组臂与最佳$K$臂之间的平均期望回报之差。相比之下,\cite{Zhou:14},只提供独立于实例的样本的复杂性,我们引入了一个新的硬度参数来表征任何给定的实例的难度。我们进一步开发了两种算法,并建立了相应的样本复杂度的硬度参数。导出的样本复杂度可以显着小于国家的最先进的结果为一大类的实例和匹配的实例独立的下限高达$\log(ε^{-1})$因素在最坏的情况下。我们还证明了一个下界的结果表明,额外的$\log(ε^{-1})$是必要的实例依赖的算法使用引入的硬度参数。

英文摘要:

We study the problem of selecting $K$ arms with the highest expected rewards in a stochastic $n$-armed bandit game. This problem has a wide range of applications, e.g., A/B testing, crowdsourcing, simulation optimization. Our goal is to develop a PAC algorithm, which, with probability at least $1-δ$, identifies a set of $K$ arms with the aggregate regret at most $ε$. The notion of aggregate regret for multiple-arm identification was first introduced in \cite{Zhou:14} , which is defined as the difference of the averaged expected rewards between the selected set of arms and the best $K$ arms. In contrast to \cite{Zhou:14} that only provides instance-independent sample complexity, we introduce a new hardness parameter for characterizing the difficulty of any given instance. We further develop two algorithms and establish the corresponding sample complexity in terms of this hardness parameter. The derived sample complexity can be significantly smaller than state-of-the-art results for a large class of instances and matches the instance-independent lower bound upto a $\log(ε^{-1})$ factor in the worst case. We also prove a lower bound result showing that the extra $\log(ε^{-1})$ is necessary for instance-dependent algorithms using the introduced hardness parameter.

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

↑