no code implementations • 14 Jun 2016 • Sabrina Müller, Onur Atan, Mihaela van der Schaar, Anja Klein
We derive a sublinear regret bound, which characterizes the learning speed and proves that our algorithm converges to the optimal cache content placement strategy in terms of maximizing the number of cache hits.
