We study an online caching problem in which requests can be served by a local cache to avoid retrieval costs from a remote server. The cache can update its state after a batch of requests and store an arbitrarily small fraction of each content. We study no-regret algorithms based on Online Mirror Descent (OMD) strategies. We show that the optimal OMD strategy depends on the request diversity present in a batch. We also prove that, when the cache must store the entire content, rather than a fraction, OMD strategies can be coupled with a randomized rounding scheme that preserves regret guarantees.

中文翻译：

---

通过在线镜像下降进行无悔缓存

我们研究了一个在线缓存问题，在该问题中，本地缓存可以为请求提供服务，从而避免了从远程服务器获取费用。高速缓存可以在一批请求之后更新其状态，并存储每个内容的任意一小部分。我们研究基于在线镜像下降（OMD）策略的无悔算法。我们表明，最佳OMD策略取决于批次中存在的请求多样性。我们还证明，当缓存必须存储全部内容而不是一部分内容时，OMD策略可以与保留舍弃保证的随机舍入方案结合使用。