Content Popularity Prediction in Fog Radio Access Networks: A Federated Learning Based Approach

Yuting Wu, Yanxiang Jiang, M. Bennis, F. Zheng, Xiqi Gao, X. You
{"title":"Content Popularity Prediction in Fog Radio Access Networks: A Federated Learning Based Approach","authors":"Yuting Wu, Yanxiang Jiang, M. Bennis, F. Zheng, Xiqi Gao, X. You","doi":"10.1109/ICC40277.2020.9148697","DOIUrl":null,"url":null,"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. 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 using the stochastic variance reduced gradient (SVRG) algorithm. Finally, federated learning based model integration is proposed to construct the global popularity prediction model based on local models by combining the distributed approximate Newton (DANE) algorithm with SVRG. Our proposed popularity prediction policy not only predicts content popularity accurately, but also significantly reduces computational complexity. Simulation results show that our proposed policy increases the cache hit rate by up to 21.5 % compared to the traditional policies.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9148697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

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. 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 using the stochastic variance reduced gradient (SVRG) algorithm. Finally, federated learning based model integration is proposed to construct the global popularity prediction model based on local models by combining the distributed approximate Newton (DANE) algorithm with SVRG. Our proposed popularity prediction policy not only predicts content popularity accurately, but also significantly reduces computational complexity. Simulation results show that our proposed policy increases the cache hit rate by up to 21.5 % compared to the traditional policies.
雾无线接入网络中的内容流行度预测:一种基于联邦学习的方法
本文研究了雾状无线接入网(f - ran)中的内容流行度预测问题。为了在低复杂度下获得准确的预测结果,我们提出了一种基于联邦学习的上下文感知的流行度预测策略。首先,考虑到用户更喜欢请求他们感兴趣的内容,应用用户偏好学习。然后,通过自适应上下文空间划分,利用用户上下文信息对用户进行高效聚类;在此基础上,利用随机方差降低梯度(SVRG)算法提出了一个流行度预测优化问题来学习局部模型参数。最后,提出了基于联邦学习的模型集成,将分布式近似牛顿(DANE)算法与SVRG算法相结合,在局部模型的基础上构建全局流行度预测模型。本文提出的流行度预测策略不仅能够准确预测内容的流行度,而且显著降低了计算复杂度。仿真结果表明,与传统策略相比,该策略的缓存命中率提高了21.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信