资源分类
》 资源 》论文》Improved Algorithm on Online Clustering of Bandits

Improved Algorithm on Online Clustering of Bandits

2019-10-08 | |  79 |   49 |   0
Abstract We generalize the setting of online clustering of bandits by allowing non-uniform distribution over user frequencies. A more efficient algorithm is proposed with simple set structures to represent clusters. We prove a regret bound for the new algorithm which is free of the minimal frequency over users. The experiments on both synthetic and real datasets consistently show the advantage of the new algorithm over existing methods

上一篇：Harnessing the Vulnerability of Latent Layers in Adversarially Trained Models

下一篇：Knowledge Amalgamation from Heterogeneous Networks by Common Feature Learning

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...