TY - JOUR
T1 - Knowledge Caching for Federated Learning in Wireless Cellular Networks
AU - Zheng, Xin Ying
AU - Lee, Ming Chun
AU - Hsu, Kai Chieh
AU - Hong, Y. W.Peter
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - This work examines a novel wireless knowledge caching framework where machine learning models (i.e., knowledge) are cached at local small cell base-stations (SBSs) to facilitate both federated training and access of the models by users. We first consider a single-SBS scenario, where the caching decision, user selection, and wireless resource allocation are jointly determined by minimizing a training error bound subject to constraints on the cache capacity, the communication and computation latency, and the energy consumption. The solution is obtained by first computing the minimum achievable training loss for each model, followed by the optimization of the binary caching variables, which reduces to a 0-1 knapsack problem. The proposed framework is then extended to the multiple-SBS scenario where the user association among SBSs is further examined. We adopt a dual-ascent method where Lagrange multipliers are introduced and updated in each iteration to regularize the dependence among user selection and association. Given the Lagrange multipliers, the caching decision, user selection, resource allocation and user association variables are optimized in turn using a block coordinate descent algorithm. Simulation results show that the proposed scheme can achieve a training error bound that is lower than preference-only and random caching policies in both scenarios.
AB - This work examines a novel wireless knowledge caching framework where machine learning models (i.e., knowledge) are cached at local small cell base-stations (SBSs) to facilitate both federated training and access of the models by users. We first consider a single-SBS scenario, where the caching decision, user selection, and wireless resource allocation are jointly determined by minimizing a training error bound subject to constraints on the cache capacity, the communication and computation latency, and the energy consumption. The solution is obtained by first computing the minimum achievable training loss for each model, followed by the optimization of the binary caching variables, which reduces to a 0-1 knapsack problem. The proposed framework is then extended to the multiple-SBS scenario where the user association among SBSs is further examined. We adopt a dual-ascent method where Lagrange multipliers are introduced and updated in each iteration to regularize the dependence among user selection and association. Given the Lagrange multipliers, the caching decision, user selection, resource allocation and user association variables are optimized in turn using a block coordinate descent algorithm. Simulation results show that the proposed scheme can achieve a training error bound that is lower than preference-only and random caching policies in both scenarios.
KW - Wireless caching networks
KW - federated learning
KW - multi-cell multi-user networks
KW - resource optimization
UR - http://www.scopus.com/inward/record.url?scp=85187254513&partnerID=8YFLogxK
U2 - 10.1109/TWC.2024.3360642
DO - 10.1109/TWC.2024.3360642
M3 - Article
AN - SCOPUS:85187254513
SN - 1536-1276
VL - 23
SP - 9235
EP - 9250
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 8
ER -