Zobrazeno 1 - 10
of 140
pro vyhledávání: '"Karamchandani, Nikhil"'
We study the representative arm identification (RAI) problem in the multi-armed bandits (MAB) framework, wherein we have a collection of arms, each associated with an unknown reward distribution. An underlying instance is defined by a partitioning of
Externí odkaz:
http://arxiv.org/abs/2408.14195
In this paper, we introduce a variation of the group testing problem where each test is specified by an ordered subset of items, and returns the first defective item in the specified order. We refer to this as \textit{cascaded group testing} and the
Externí odkaz:
http://arxiv.org/abs/2405.17917
We consider a distributed multi-user secret sharing (DMUSS) setting in which there is a dealer, $n$ storage nodes, and $m$ secrets. Each user demands a $t$-subset of $m$ secrets. Earlier work in this setting dealt with the case of $t=1$; in this work
Externí odkaz:
http://arxiv.org/abs/2312.15763
We consider the widely studied problem of coded caching under non-uniform requests where users independently request files according to some underlying popularity distribution in each slot. This work is a first step towards analyzing this framework t
Externí odkaz:
http://arxiv.org/abs/2312.05003
Our aim is to estimate the largest community (a.k.a., mode) in a population composed of multiple disjoint communities. This estimation is performed in a fixed confidence setting via sequential sampling of individuals with replacement. We consider two
Externí odkaz:
http://arxiv.org/abs/2309.12687
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 consider the multi-access coded caching problem, which contains a central server with $N$ files, $K$ caches with $M$ units of memory each and $K$ users where each one is connected to $L (\geq 1)$ consecutive caches, with a cyclic wrap-around. Cach
Externí odkaz:
http://arxiv.org/abs/2305.05514
We study the problem of best-arm identification in a distributed variant of the multi-armed bandit setting, with a central learner and multiple agents. Each agent is associated with an arm of the bandit, generating stochastic rewards following an unk
Externí odkaz:
http://arxiv.org/abs/2305.00528
We consider the problem of service hosting where a service provider can dynamically rent edge resources via short term contracts to ensure better quality of service to its customers. The service can also be partially hosted at the edge, in which case
Externí odkaz:
http://arxiv.org/abs/2303.06851
We consider the online caching problem for a cache of limited size. In a time-slotted system, a user requests one file from a large catalog in each slot. If the requested file is cached, the policy receives a unit reward and zero rewards otherwise. W
Externí odkaz:
http://arxiv.org/abs/2211.16051