Knowledge-aided Federated Learning for Energy-limited Wireless Networks
Not on the map. Why?
Abstract (arXiv)
The conventional model aggregation-based federated learning (FL) approach requires all local models to have the same architecture, which fails to support practical scenarios with heterogeneous local models. Moreover, frequent model exchange is costly for resource-limited wireless networks since modern deep neural networks usually have over a million parameters. To tackle these challenges, we propose a novel knowledge-aided FL (KFL) framework, which aggregates light high-level data features, namely knowledge, in the per-round learning process. This framework allows devices to design their machine-learning models independently and reduces the communication overhead in the training process. We then theoretically analyze the convergence bound of the proposed framework, revealing that scheduling more data volume in each round helps to improve the learning performance. In addition, large data volume should be scheduled in early rounds if the total scheduled data volume during the entire learning course is fixed. Inspired by this, we define a new objective function, i.e., the weighted scheduled data sample volume, to transform the inexplicit global loss minimization problem into a tractable one for device scheduling, bandwidth allocation, and power control. To deal with unknown time-varying wireless channels, we transform the considered problem into a deterministic problem for each round with the assistance of the Lyapunov optimization framework. Then, we derive the optimal bandwidth allocation and power control solution and develop an efficient online device scheduling algorithm to achieve an energy-learning trade-off in the learning process. Experimental results on MNIST and CIFAR-10 show that the proposed KFL is capable of reducing over 99% communication overhead while achieving better learning performance than the conventional model aggregation-based algorithms.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Sep 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 4; 2025: 2.
8 papers.
- 2024Rethinking Resource Management in Edge Learning: A Joint Pre-training and Fine-tuning Design Paradigmcited by 13
- 2023Adaptive Federated Pruning in Hierarchical Wireless Networkscited by 10
- 2023Channel and Gradient-Importance Aware Device Scheduling for Over-the-Air Federated Learningcited by 9
- 2024NCAirFL: CSI-Free Over-the-Air Federated Learning Based on Non-Coherent Detectioncited by 4
- 2024Pre-Training and Personalized Fine-Tuning via Over-the-Air Federated Meta-Learning: Convergence-Generalization Trade-Offscited by 3
- 2024Federated Contrastive Learning for Personalized Semantic Communicationcited by 2
- 2025A Two-Timescale Approach for Wireless Federated Learning with Parameter Freezing and Power Controlcited by 0
- 2025Computation-aware Energy-harvesting Federated Learning with Pipelined Cyclic Schedulingcited by 0
- 2025Computation-aware Energy-harvesting Federated Learning with Pipelined Cyclic Scheduling14 Nov 2025
- 2025A Two-Timescale Approach for Wireless Federated Learning with Parameter Freezing and Power Control2 Apr 2025
- 2024NCAirFL: CSI-Free Over-the-Air Federated Learning Based on Non-Coherent Detection20 Nov 2024
- 2024Pre-Training and Personalized Fine-Tuning via Over-the-Air Federated Meta-Learning: Convergence-Generalization Trade-Offs17 Jun 2024
- 2024Federated Contrastive Learning for Personalized Semantic Communication13 Jun 2024
- 2024Rethinking Resource Management in Edge Learning: A Joint Pre-training and Fine-tuning Design Paradigm1 Apr 2024
- 2023Channel and Gradient-Importance Aware Device Scheduling for Over-the-Air Federated Learning26 May 2023
- 2023Adaptive Federated Pruning in Hierarchical Wireless Networks15 May 2023