Search Results for author:
Found 5 papers, 0 papers with code
Best Arm Identification in Bandits with Limited Precision Sampling
The pulled arm and its instantaneous reward are revealed to the learner, whose goal is to find the best arm by minimising the expected stopping time, subject to an upper bound on the error probability.
Almost Cost-Free Communication in Federated Best Arm Identification
The local best arm at a client is the arm with the largest mean among the arms local to the client, whereas the global best arm is the arm with the largest average mean across all the clients.
Best Arm Identification in Restless Markov Multi-Armed Bandits
For this problem, we derive the first-known problem instance-dependent asymptotic lower bound on the growth rate of the expected time required to find the index of the best arm, where the asymptotics is as the error probability vanishes.
Query complexity of heavy hitter estimation
We consider the problem of identifying the subset $\mathcal{S}^{\gamma}_{\mathcal{P}}$ of elements in the support of an underlying distribution $\mathcal{P}$ whose probability value is larger than a given threshold $\gamma$, by actively querying an oracle to gain information about a sequence $X_1, X_2, \ldots$ of $i. i. d.$ samples drawn from $\mathcal{P}$.
Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement
We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of $N$ files, $K$ caches with limited memory $M$, and $K$ users such that each user has access to $L$ consecutive caches with a cyclic wrap-around and requests one file from the central server's catalog.
