activity
20222024
most citedConstrained Pure Exploration Multi-Armed Bandits with a Fixed Budget

1 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing 2022Show all

2 papers · 1 filter

cs.NI2022

Regret-Optimal Online Caching for Adversarial and Stochastic Arrivals

Fathima Zarin Faizal, Priya Singh, Nikhil Karamchandani +1

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 c…

cs.LG2022★ 1 cited

Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget

Fathima Zarin Faizal, Jayakrishnan Nair

We consider a constrained, pure exploration, stochastic multi-armed bandit formulation under a fixed budget. Each arm is associated with an unknown, possibly multi-dimensional dist…