Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Reddy, Kota Srinivas"'
We study the well-known coded caching problem in an online learning framework, wherein requests arrive sequentially, and an online policy can update the cache contents based on the history of requests seen thus far. We introduce a caching policy base
Externí odkaz:
http://arxiv.org/abs/2409.12387
We study best arm identification in a variant of the multi-armed bandit problem where the learner has limited precision in arm selection. The learner can only sample arms via certain exploration bundles, which we refer to as boxes. In particular, at
Externí odkaz:
http://arxiv.org/abs/2305.06082
We study the problem of best arm identification in a federated learning multi-armed bandit setup with a central server and multiple clients. Each client is associated with a multi-armed bandit in which each arm yields {\em i.i.d.}\ rewards following
Externí odkaz:
http://arxiv.org/abs/2208.09215
We study the problem of identifying the best arm in a multi-armed bandit environment when each arm is a time-homogeneous and ergodic discrete-time Markov process on a common, finite state space. The state evolution on each arm is governed by the arm'
Externí odkaz:
http://arxiv.org/abs/2203.15236
Publikováno v:
IEEE Journal on Selected Areas in Information Theory 2021
Index coding and coded caching are two active research topics in information theory with strong ties to each other. Motivated by the multi-access coded caching problem, we study a new class of structured index coding problems (ICPs) which are formed
Externí odkaz:
http://arxiv.org/abs/2012.04705
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 o
Externí odkaz:
http://arxiv.org/abs/2005.14425
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
Externí odkaz:
http://arxiv.org/abs/1909.01756
In this work, we focus on distributed cache systems with non-uniform storage capacity across caches. We compare the performance of our system with the performance of a system with the same cumulative storage distributed evenly across the caches. We c
Externí odkaz:
http://arxiv.org/abs/1809.09877
Content delivery networks are a key infrastructure component used by Video on Demand (VoD) services to deliver content over the Internet. We study a content delivery system consisting of a central server and multiple co-located caches, each with limi
Externí odkaz:
http://arxiv.org/abs/1802.03287
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.