Active Content Popularity Learning via Query-by-Committee for Edge Caching

Abstract

Edge caching has received much attention as an effective solution to face the stringent latency requirements in 5G networks due to the proliferation of handset devices as well as data-hungry applications. One of the challenges in edge caching systems is to optimally cache strategic contents to maximize the percentage of total requests served by the edge caches. To enable the optimal caching strategy, we propose an Active Learning approach (AL) to learn and design an accurate content request prediction algorithm. Specifically, we use an AL based Query-by-committee (QBC) matrix completion algorithm with a strategy of querying the most informative missing entries of the content popularity matrix. The proposed AL framework leverage's the trade-off between exploration and exploitation of the network, and learn the user's preferences by posing queries or recommendations. Later, it exploits the known information to maximize the system performance. The effectiveness of proposed AL based QBC content learning algorithm is demonstrated via numerical results