On the Regret of Coded Caching with Adversarial Requests
<|reference_start|>On the Regret of Coded Caching with Adversarial Requests: 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 history of requests seen thus far. We introduce a caching policy based on the Follow-The-Perturbed-Leader principle and show that for any time horizon T and any request sequence, it achieves a sub-linear regret of \mathcal{O}(\sqrt(T) ) with respect to an oracle that knows the request sequence beforehand. Our study marks the first examination of adversarial regret in the coded caching setup. Furthermore, we also address the issue of switching cost by establishing an upper bound on the expected number of cache updates made by our algorithm under unrestricted switching and also provide an upper bound on the regret under restricted switching when cache updates can only happen in a pre-specified subset of timeslots. Finally, we validate our theoretical insights with numerical results using a real-world dataset<|reference_end|>
@article{nayak2024on,
    title={On the Regret of Coded Caching with Adversarial Requests},
    author={Anupam Nayak and Kota Srinivas Reddy and Nikhil Karamchandani},
    journal={arXiv preprint arXiv:2409.12387},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.12387},
    primaryClass={cs.IT cs.LG math.IT}
}