mlsanityData to 7 Oct 2026

Data-Aware Device Scheduling for Federated Edge Learning

arXiv 2102.09491 ↗First posted 18 Feb 2021cs.DC cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Federated Edge Learning (FEEL) involves the collaborative training of machine learning models among edge devices, with the orchestration of a server in a wireless edge network. Due to frequent model updates, FEEL needs to be adapted to the limited communication bandwidth, scarce energy of edge devices, and the statistical heterogeneity of edge devices' data distributions. Therefore, a careful scheduling of a subset of devices for training and uploading models is necessary. In contrast to previous work in FEEL where the data aspects are under-explored, we consider data properties at the heart of the proposed scheduling algorithm. To this end, we propose a new scheduling scheme for non-independent and-identically-distributed (non-IID) and unbalanced datasets in FEEL. As the data is the key component of the learning, we propose a new set of considerations for data characteristics in wireless scheduling algorithms in FEEL. In fact, the data collected by the devices depends on the local environment and usage pattern. Thus, the datasets vary in size and distributions among the devices. In the proposed algorithm, we consider both data and resource perspectives. In addition to minimizing the completion time of FEEL as well as the transmission energy of the participating devices, the algorithm prioritizes devices with rich and diverse datasets. We first define a general framework for the data-aware scheduling and the main axes and requirements for diversity evaluation. Then, we discuss diversity aspects and some exploitable techniques and metrics. Next, we formulate the problem and present our FEEL scheduling algorithm. Evaluations in different scenarios show that our proposed FEEL scheduling algorithm can help achieve high accuracy in few rounds with a reduced cost.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 15 of its 39 references that are in the map. First posted on arXiv 18 Feb 2021.

Builds on

15 of 39 references.

References · 15

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  3. 2018LEAF: A Benchmark for Federated Settingscited by 780
  4. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
  5. 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 408
  6. 2018Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edgecited by 347
  7. 2019Asynchronous Federated Optimizationcited by 264
  8. 2018Federated Learning via Over-the-Air Computationcited by 215
  9. 2018Broadband Analog Aggregation for Low-Latency Federated Edge Learning (Extended Version)cited by 186
  10. 2019Scheduling Policies for Federated Learning in Wireless Networkscited by 131
  11. 2019Energy-Efficient Radio Resource Allocation for Federated Edge Learningcited by 39
  12. 2019Age-Based Scheduling Policy for Federated Learning in Mobile Edge Networkscited by 39
3 more
  1. 2020Federated Edge Learning : Design Issues and Challengescited by 26
  2. 2019Data-Importance Aware User Scheduling for Communication-Efficient Edge Machine Learningcited by 20
  3. 2017Determinantal Point Processes for Mini-Batch Diversificationcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 2; 2025: 0; 2026: 1.

6 papers.