mlsanityData to 14 Oct 2026

CAFE: Carbon-Aware Federated Learning in Geographically Distributed Data Centers

arXiv 2311.03615 ↗First posted 6 Nov 2023cs.LG cs.DCcited by 6

Not on the map. Why?

Abstract (arXiv)

Training large-scale artificial intelligence (AI) models demands significant computational power and energy, leading to increased carbon footprint with potential environmental repercussions. This paper delves into the challenges of training AI models across geographically distributed (geo-distributed) data centers, emphasizing the balance between learning performance and carbon footprint. We consider Federated Learning (FL) as a solution, which prioritizes model parameter exchange over raw data, ensuring data privacy and compliance with local regulations. Given the variability in carbon intensity across regions, we propose a new framework called CAFE (short for Carbon-Aware Federated Learning) to optimize training within a fixed carbon footprint budget. Our approach incorporates coreset selection to assess learning performance, employs the Lyapunov drift-plus-penalty framework to address the unpredictability of future carbon intensity, and devises an efficient algorithm to address the combinatorial complexity of the data center selection. Through extensive simulations using real-world carbon intensity data, we demonstrate the efficacy of our algorithm, highlighting its superiority over existing methods in optimizing learning performance while minimizing environmental impact.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 25 of its 64 references that are in the map. First posted on arXiv 6 Nov 2023.

Builds on

25 of 64 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  5. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
  6. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  7. 2022LaMDA: Language Models for Dialog Applicationscited by 1,220
  8. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 853
  9. 2020The Future of Digital Health with Federated Learningcited by 633
  10. 2019Green AIcited by 627
  11. 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 404
  12. 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 278
13 more
  1. 2019Tackling Climate Change with Machine Learningcited by 265
  2. 2022Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Modelcited by 265
  3. 2020Towards the Systematic Reporting of the Energy and Carbon Footprints of Machine Learningcited by 249
  4. 2021Sustainable AI: Environmental Implications, Challenges and Opportunitiescited by 242
  5. 2020Client Selection in Federated Learning: Convergence Analysis and Power-of-Choice Selection Strategiescited by 198
  6. 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 193
  7. 2019Reliable Federated Learning for Mobile Networkscited by 92
  8. 2022Carbon Explorer: A Holistic Approach for Designing Carbon Aware Datacenterscited by 32
  9. 2020Accelerator-aware Neural Network Design using AutoMLcited by 30
  10. 2022FedSpace: An Efficient Federated Learning Framework at Satellites and Ground Stationscited by 28
  11. 2020AutoDNNchip: An Automated DNN Chip Predictor and Builder for Both FPGAs and ASICscited by 26
  12. 2021Enabling Sustainable Clouds: The Case for Virtualizing the Energy Systemcited by 12
  13. 2021Junkyard Computing: Repurposing Discarded Smartphones to Minimize Carboncited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 3; 2026: 2.

6 papers.