Machine Learning Algorithms for Caching Systems
Online Learning for Caching with Heterogeneous miss-costs
R. Vadastreanu (TU Delft - Electrical Engineering, Mathematics and Computer Science)
George Iosifidis – Mentor (TU Delft - Networked Systems)
N. Mhaisen – Mentor (TU Delft - Networked Systems)
F.A. Aslan – Mentor (TU Delft - Networked Systems)
Neil Yorke-Smith – Graduation committee member (TU Delft - Algorithmics)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
This paper presents an adaptive per-file caching policy designed to dynamically adjust caching decisions based on the importance of the requested files. It relies on the Online Gradient Ascent (OGA) algorithm, which treats the caching problem as an online optimization problem. This methodology ensures minimal regret by continuously optimizing caching configurations in response to real-time request sequences. The caching configurations are optimized after every request using a constant learning rate. Because the trends of requested files can change, we will introduce two new algorithms that change the learning rate at every request to increase the adaptability. We will present two new algorithms, the Universally Adaptive Caching (UAC) algorithm and the Adaptive Per File Caching Algorithm (APFC), and will present scenarios to highlight their performances.