mlsanityData to 7 Oct 2026

When Foresight Pruning Meets Zeroth-Order Optimization: Efficient Federated Learning for Low-Memory Devices

arXiv 2405.04765 ↗First posted 8 May 2024cs.LG cs.AI cs.DCcited by 2

Not on the map. Why?

Abstract (arXiv)

Although Federated Learning (FL) enables collaborative learning in Artificial Intelligence of Things (AIoT) design, it fails to work on low-memory AIoT devices due to its heavy memory usage. To address this problem, various federated pruning methods are proposed to reduce memory usage during inference. However, few of them can substantially mitigate the memory burdens during pruning and training. As an alternative, zeroth-order or backpropagation-free (BP-Free) methods can partially alleviate the memory consumption, but they suffer from scaling up and large computation overheads, since the gradient estimation error and floating point operations (FLOPs) increase as the dimensionality of the model parameters grows. In this paper, we propose a federated foresight pruning method based on Neural Tangent Kernel (NTK), which can seamlessly integrate with federated BP-Free training frameworks. We present an approximation to the computation of federated NTK by using the local NTK matrices. Moreover, we demonstrate that the data-free property of our method can substantially reduce the approximation error in extreme data heterogeneity scenarios. Since our approach improves the performance of the vanilla BP-Free method with fewer FLOPs and truly alleviates memory pressure during training and inference, it makes FL more friendly to low-memory devices. Comprehensive experimental results obtained from simulation- and real test-bed-based platforms show that our federated foresight-pruning method not only preserves the ability of the dense model with a memory reduction up to 9x but also boosts the performance of the vanilla BP-Free method with dramatically fewer FLOPs.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 42 references that are in the map. First posted on arXiv 8 May 2024.

Builds on

20 of 42 references.

References · 20

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  4. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  5. 2021Federated Learning on Non-IID Data Silos: An Experimental Studycited by 566
  6. 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 259
  7. 2019Model Pruning Enables Efficient Federated Learning on Edge Devicescited by 219
  8. 2020Federated Learning for Internet of Things: Recent Advances, Taxonomy, and Open Challengescited by 138
  9. 2021Local Learning Matters: Rethinking Data Heterogeneity in Federated Learningcited by 114
  10. 2020Empowering Things with Intelligence: A Survey of the Progress, Challenges, and Opportunities in Artificial Intelligence of Thingscited by 110
  11. 2019Fast Sparse ConvNetscited by 86
  12. 2019On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learningcited by 57
8 more
  1. 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 54
  2. 2022ZeroFL: Efficient On-Device Training for Federated Learning with Local Sparsitycited by 45
  3. 2023Edge-MoE: Memory-Efficient Multi-Task Vision Transformer Architecture with Task-level Sparsity via Mixture-of-Expertscited by 23
  4. 2023Convergence Analysis of Sequential Federated Learning on Heterogeneous Datacited by 23
  5. 2021Zeroth-Order Algorithms for Stochastic Distributed Nonconvex Optimizationcited by 13
  6. 2023BAFFLE: A Baseline of Backpropagation-Free Federated Learningcited by 12
  7. 2023Enhance Local Consistency in Federated Learning: A Multi-Step Inertial Momentum Approachcited by 11
  8. 2021HADFL: Heterogeneity-aware Decentralized Federated Learning Frameworkcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.