mlsanityData to 14 Oct 2026

Balancing Energy Efficiency and Distributional Robustness in Over-the-Air Federated Learning

arXiv 2312.14638 ↗First posted 22 Dec 2023cs.LG eess.SPcited by 1

Not on the map. Why?

Abstract (arXiv)

The growing number of wireless edge devices has magnified challenges concerning energy, bandwidth, latency, and data heterogeneity. These challenges have become bottlenecks for distributed learning. To address these issues, this paper presents a novel approach that ensures energy efficiency for distributionally robust federated learning (FL) with over air computation (AirComp). In this context, to effectively balance robustness with energy efficiency, we introduce a novel client selection method that integrates two complementary insights: a deterministic one that is designed for energy efficiency, and a probabilistic one designed for distributional robustness. Simulation results underscore the efficacy of the proposed algorithm, revealing its superior performance compared to baselines from both robustness and energy efficiency perspectives, achieving more than 3-fold energy savings compared to the considered baselines.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 12 references that are in the map. First posted on arXiv 22 Dec 2023.

Builds on

7 of 12 references.

References · 7

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2019Agnostic Federated Learningcited by 456
  3. 2021Distributionally Robust Federated Averagingcited by 104
  4. 2020Harnessing Wireless Channels for Scalable and Privacy-Preserving Federated Learningcited by 24
  5. 2022Gradient and Channel Aware Dynamic Scheduling for Over-the-Air Computation in Federated Edge Learning Systemscited by 20
  6. 2022Communication-Efficient Distributionally Robust Decentralized Learningcited by 10
  7. 2022DR-DSGD: A Distributionally Robust Decentralized Learning Algorithm over Graphscited by 5

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.