Federated learning-based content popularity prediction in fog radio access networks
Jiang, Yanxiang; Wu, Yuting; Zheng, Fu-Chun; Bennis, Mehdi; You, Xiaohu (2021-11-09)
Y. Jiang, Y. Wu, F. -C. Zheng, M. Bennis and X. You, "Federated Learning-Based Content Popularity Prediction in Fog Radio Access Networks," in IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp. 3836-3849, June 2022, doi: 10.1109/TWC.2021.3124586
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
https://urn.fi/URN:NBN:fi-fe2022082656445
Tiivistelmä
Abstract
In this paper, the content popularity prediction problem in fog radio access networks (F-RANs) is investigated. In order to obtain accurate prediction with low complexity, we propose a novel context-aware popularity prediction policy based on federated learning (FL). Firstly, user preference learning is applied by considering that users prefer to request the contents they are interested in. Then, users’ context information is utilized to cluster users efficiently by adaptive context space partitioning. After that, we formulate a popularity prediction optimization problem to learn the local model parameters by using the stochastic variance reduced gradient (SVRG) algorithm. Finally, FL based model integration is proposed to learn the global popularity prediction model based on local models using the distributed approximate Newton (DANE) algorithm with SVRG. Our proposed popularity prediction policy not only can predict content popularity accurately, but also can significantly reduce computational complexity. Moreover, we theoretically analyze the convergence bound of our proposed FL based model integration algorithm. Simulation results show that our proposed policy increases the cache hit rate by up to 21.5 % compared to existing policies.
Kokoelmat
- Avoin saatavuus [37306]