No-Regret Mixing of LRU and LFU with Optimal Switching Cost
This work shows that LeCar suffers linear regret against an oblivious adversary, even with unbounded history, and proposes H-MC, a Hedge-based mixture of virtual LRU and LFU caches that preserves Hedge's selection probabilities, and hence its regret guarantees, while minimizing the switching cost among all joint select...