In this paper, we investigate the content popularity prediction problem in cache-enabled fog radio access networks (F-RANs). In order to predict the content popularity with high accuracy and low complexity, we propose a Gaussian process based regressor to model the content request pattern. Firstly, the relationship between content features and popularity is captured by our proposed model. Then, we utilize Bayesian learning to train the model parameters, which is robust to overfitting. However, Bayesian methods are usually unable to find a closed-form expression of the posterior distribution. To tackle this issue, we apply a stochastic variance reduced gradient Hamiltonian Monte Carlo (SVRG-HMC) method to approximate the posterior distribution. To utilize the computing resource of fog access points (F-APs) and also reduce the communication overhead, we propose a quantized federated learning (FL) framework combining with Bayesian learning. The proposed quantized federated Bayesian learning framework allows each F-AP to send gradients to the cloud server after quantizing and encoding. It can achieve a tradeoff between prediction accuracy and communication overhead effectively. Simulation results show that the performance of our proposed policy outperforms the considered baseline policies.

In this paper, the content popularity prediction problem in cache-enabled fog radio access networks (F-RANs) is investigated. In order to predict the content popularity with high accuracy and low complexity, we propose a Gaussian process based Poisson regressor to model the content request pattern. Firstly, the relationship between content features and popularity is captured by our developed model. Then, we utilize Bayesian learning to learn the model parameters, which are robust to over-fitting. However, Bayesian methods are usually unable to find a closed-form expression of the posterior distribution. To tackle this issue, we apply a Stochastic Variance Reduced Gradient Hamiltonian Monte Carlo (SVRG-HMC) to approximate the posterior distribution. Two types of predictive content popularity are formulated for the requests of existing contents and newly-added contents. Simulation results show that the performance of our proposed policy outperforms the policy based on other Monte Carlo based method.