betaFeedback

WorksComputer Science

An Efficient Synchronization Scheme for Distributed Bandits

Abstract

We study the problem of synchronizing two players in a distributed multi-armed bandit setting. The probability of synchronization error is analyzed by recasting synchronization as a communication problem. Using a well-designed random coding ensemble, we derive error exponents for the maximum-likelihood decoder. We then introduce a universal decoder that achieves the same error exponents as the optimal decoder. Finally, applying these results to distributed multi-armed bandits, we show an upper bound on the regret of our synchronization scheme.

Paper details

vlnc:W_6jddmzjt
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…