FedERL: Federated Efficient and Robust Learning for Common Corruptions

Omar Bekdache, Naresh Shanbhag
8/24/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Federated learning (FL) accelerates the deployment of deep learning models on edge devices while preserving data privacy. However, FL systems face challenges due to client-side constraints on computational resources, and from a lack of robustness to common corruptions such as noise, blur, and weather effects. Existing robust training methods are computationally expensive and unsuitable for resource-constrained clients. We propose FedERL, federated efficient and robust learning, as the first work to explicitly address corruption robustness under time and energy constraints on the client side. At its core, FedERL employs a novel data-agnostic robust training (DART) method on the server to enhance robustness without access to the training data. In doing so, FedERL ensures zero robustness overhead for clients. Extensive experiments demonstrate FedERL's ability to handle common corruptions at a fraction of the time and energy cost of traditional robust training methods. In scenarios with limited time and energy budgets, FedERL surpasses the performance of traditional robust training, establishing it as a practical and scalable solution for real-world FL applications.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bekdache2025federl,
  title  = {FedERL: Federated Efficient and Robust Learning for Common Corruptions},
  author = {Omar Bekdache and Naresh Shanbhag},
  year   = {2025},
  eprint = {2508.17381},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.17381v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.17381.svg)](https://codeofpaper.com/paper/2508.17381)

Discussion