资源分类
》 资源 》论文》Multiple Identifications in Multi-Armed Bandits

Multiple Identifications in Multi-Armed Bandits

2020-03-02 | |  59 |   53 |   0

Abstract

We study the problem of identifying the top m arms in a multi-armed bandit game. Our proposed solution relies on a new algorithm based on successive rejects of the seemingly bad arms, and successive accepts of the good ones. This algorithmic contribution allows to tackle other multiple identifications settings that were previously out of reach. In particular we show that this idea of successive accepts and rejects applies to the multi-bandit best arm identification problem.

上一篇：Online Kernel Learning with a Near Optimal Sparsity Bound

下一篇：Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers

用户评价
全部评价

热门资源

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Rating-Boosted La...

    The performance of a recommendation system reli...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...