mlsanityData to 7 Oct 2026

Resource-Aware Hierarchical Federated Learning in Wireless Video Caching Networks

arXiv 2402.04216 ↗First posted 6 Feb 2024cs.NI cs.LG cs.SYcited by 4

Not on the map. Why?

Abstract (arXiv)

Backhaul traffic congestion caused by the video traffic of a few popular files can be alleviated by storing the to-be-requested content at various levels in wireless video caching networks. Typically, content service providers (CSPs) own the content, and the users request their preferred content from the CSPs using their (wireless) internet service providers (ISPs). As these parties do not reveal their private information and business secrets, traditional techniques may not be readily used to predict the dynamic changes in users' future demands. Motivated by this, we propose a novel resource-aware hierarchical federated learning (RawHFL) solution for predicting user's future content requests. A practical data acquisition technique is used that allows the user to update its local training dataset based on its requested content. Besides, since networking and other computational resources are limited, considering that only a subset of the users participate in the model training, we derive the convergence bound of the proposed algorithm. Based on this bound, we minimize a weighted utility function for jointly configuring the controllable parameters to train the RawHFL energy efficiently under practical resource constraints. Our extensive simulation results validate the proposed algorithm's superiority, in terms of test accuracy and energy cost, over existing baselines.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 21 of its 55 references that are in the map. First posted on arXiv 6 Feb 2024.

Builds on

21 of 55 references.

References · 21

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2019Advances and Open Problems in Federated Learningcited by 3,021
  3. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  4. 2021Data-Free Knowledge Distillation for Heterogeneous Federated Learningcited by 380
  5. 2019Client-Edge-Cloud Hierarchical Federated Learningcited by 202
  6. 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 192
  7. 2020Optimal Client Sampling for Federated Learningcited by 123
  8. 2018In-Edge AI: Intelligentizing Mobile Edge Computing, Caching and Communication by Federated Learningcited by 80
  9. 2020Demystifying Why Local Aggregation Helps: Convergence Analysis of Hierarchical SGDcited by 26
  10. 2021Federated Learning on the Road: Autonomous Controller Design for Connected and Autonomous Vehiclescited by 26
  11. 2022Gradient and Channel Aware Dynamic Scheduling for Over-the-Air Computation in Federated Edge Learning Systemscited by 20
  12. 2022Parallel Successive Learning for Dynamic Distributed Model Training over Heterogeneous Wireless Networkscited by 18
9 more
  1. 2022Resource Constrained Vehicular Edge Federated Learning with Highly Mobile Connected Vehiclescited by 15
  2. 2017A Reinforcement-Learning Approach to Proactive Caching in Wireless Networkscited by 14
  3. 2023Hierarchical Federated Learning in Wireless Networks: Pruning Tackles Bandwidth Scarcity and System Heterogeneitycited by 10
  4. 2018Optimal 3D-Trajectory Design and Resource Allocation for Solar-Powered UAV Communication Systemscited by 8
  5. 2018Caching at the Wireless Edge: Design Aspects, Challenges and Future Directionscited by 7
  6. 2022Mobility, Communication and Computation Aware Federated Learning for Internet of Vehiclescited by 5
  7. 2022Efficient Content Delivery in User-Centric and Cache-Enabled Vehicular Edge Networks with Deadline-Constrained Heterogeneous Demandscited by 3
  8. 2023Proactive Content Caching Scheme in Urban Vehicular Networkscited by 1
  9. 2023Resource-Aware Hierarchical Federated Learning for Video Caching in Wireless Networkscited by 1

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 2.

4 papers.