2 papers
cs.IT2024
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…
cs.IT2023
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…