68 citations · 113 across the 10 of their papers we have counts for
11 papers
Fixed-Confidence Best Arm Identification with Decreasing Variance
Tamojeet Roychowdhury, Kota Srinivas Reddy, Krishna P Jagannathan +1
We focus on the problem of best-arm identification in a stochastic multi-arm bandit with temporally decreasing variances for the arms' rewards. We model arm rewards as Gaussian ran…
On the Regret of Coded Caching with Adversarial Requests
Anupam Nayak, Kota Srinivas Reddy, Nikhil Karamchandani
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…
Best Arm Identification in Bandits with Limited Precision Sampling
Kota Srinivas Reddy, P. N. Karthik, Nikhil Karamchandani +1
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 certa…
Multi-access Coded Caching with Linear Subpacketization
Srinivas Reddy Kota, Nikhil Karamchandani
We consider the multi-access coded caching problem, which contains a central server with files, caches with units of memory each and users where each one is connect…
Almost Cost-Free Communication in Federated Best Arm Identification
Kota Srinivas Reddy, P. N. Karthik, Vincent Y. F. Tan
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-…
Best Arm Identification in Restless Markov Multi-Armed Bandits
P. N. Karthik, Kota Srinivas Reddy, Vincent Y. F. Tan
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, finit…
Structured Index Coding Problem and Multi-access Coded Caching
Kota Srinivas Reddy, Nikhil Karamchandani
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…
Query complexity of heavy hitter estimation
Sahasrajit Sarmasarkar, Kota Srinivas Reddy, Nikhil Karamchandani
We consider the problem of identifying the subset of elements in the support of an underlying distribution whose probability value is la…
Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement
Kota Srinivas Reddy, Nikhil Karamchandani
We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of files, caches with limited memory , and …
Effects of Storage Heterogeneity in Distributed Cache Systems
Kota Srinivas Reddy, Sharayu Moharir, Nikhil Karamchandani
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…
Resource Pooling in Large-Scale Content Delivery Systems
Kota Srinivas Reddy, Sharayu Moharir, Nikhil Karamchandani
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 consist…