Optimistic No-regret Algorithms for Discrete Caching. (arXiv:2208.06414v2 [cs.LG] UPDATED)

We take a systematic look at the problem of storing whole files in a cache
with limited capacity in the context of optimistic learning, where the caching
policy has access to a prediction oracle (provided by, e.g., a Neural Network).
The successive file requests are assumed to be generated by an adversary, and
no assumption is made on the accuracy of the oracle. In this setting, we
provide a universal lower bound for prediction-assisted online caching and
proceed to design …

algorithms arxiv caching