资源分类
》 资源 》论文》Thresholding Bandit with Optimal Aggregate Regret

Thresholding Bandit with Optimal Aggregate Regret

2020-02-23 | |  50 |   36 |   0

Abstract

We consider the thresholding bandit problem, whose goal is to find arms of mean rewards above a given threshold θ, with a fixed budget of T trials. We introduce LSA, a new, simple and anytime algorithm that aims to minimize the aggregate regret (or the expected number of mis-classified arms). We prove that our algorithm is instance-wise asymptotically optimal. We also provide comprehensive empirical results to demonstrate the algorithm’s superior performance over existing algorithms under a variety of different scenarios.

上一篇：Trivializations for Gradient-Based Optimization on Manifolds

下一篇：Complexity of Highly Parallel Non-Smooth Convex Optimization

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...