149 citations · 573 across the 30 of their papers we have counts for
46 papers
Cascading Bandits With Feedback
R Sri Prakash, Nikhil Karamchandani, Sharayu Moharir
Motivated by the challenges of edge inference, we study a variant of the cascade bandit model in which each arm corresponds to an inference model with an associated accuracy and er…
Observation-Free Attacks on Online Learning to Rank
Sameep Chattopadhyay, Nikhil Karamchandani, Sharayu Moharir
Online learning to rank (OLTR) plays a critical role in information retrieval and machine learning systems, with a wide range of applications in search engines and content recommen…
Byzantine-Resilient Distributed Computation via Task Replication and Local Computations
Aayush Rajesh, Nikhil Karamchandani, Vinod M. Prabhakaran
We study a distributed computation problem in the presence of Byzantine workers where a central node wishes to solve a task that is divided into independent sub-tasks, each of whic…
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…
Cascaded Group Testing
Waqar Mirza, Nikhil Karamchandani, Niranjan Balachandran
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 specifie…
On the Regret of Online Coded Caching
Anupam Nayak, Sheel Shah, Nikhil Karamchandani
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 e…