Table of Contents
Fetching ...

Controlling Participation in Federated Learning with Feedback

Michael Cummins, Guner Dilsad Er, Michael Muehlebach

TL;DR

This work addresses the high communication cost in federated learning by introducing FedBack, an ADMM-based framework that deterministically controls per-client participation through an integral feedback mechanism. By modeling participation as a discrete-time dynamical system and applying an integral controller to adjust participation thresholds, FedBack achieves target participation rates while maintaining global convergence to stationary points. Theoretical results establish stability of the participation dynamics and global convergence under standard assumptions, and empirical results on MNIST and CIFAR-10 demonstrate substantial reductions in participation events and communication overhead with robust performance. Overall, FedBack provides a practical, scalable approach to bandwidth-constrained FL with potential extensions to other proximal and event-triggered optimization frameworks.

Abstract

We address the problem of client participation in federated learning, where traditional methods typically rely on a random selection of a small subset of clients for each training round. In contrast, we propose FedBack, a deterministic approach that leverages control-theoretic principles to manage client participation in ADMM-based federated learning. FedBack models client participation as a discrete-time dynamical system and employs an integral feedback controller to adjust each client's participation rate individually, based on the client's optimization dynamics. We provide global convergence guarantees for our approach by building on the recent federated learning research. Numerical experiments on federated image classification demonstrate that FedBack achieves up to 50\% improvement in communication and computational efficiency over algorithms that rely on a random selection of clients.

Controlling Participation in Federated Learning with Feedback

TL;DR

This work addresses the high communication cost in federated learning by introducing FedBack, an ADMM-based framework that deterministically controls per-client participation through an integral feedback mechanism. By modeling participation as a discrete-time dynamical system and applying an integral controller to adjust participation thresholds, FedBack achieves target participation rates while maintaining global convergence to stationary points. Theoretical results establish stability of the participation dynamics and global convergence under standard assumptions, and empirical results on MNIST and CIFAR-10 demonstrate substantial reductions in participation events and communication overhead with robust performance. Overall, FedBack provides a practical, scalable approach to bandwidth-constrained FL with potential extensions to other proximal and event-triggered optimization frameworks.

Abstract

We address the problem of client participation in federated learning, where traditional methods typically rely on a random selection of a small subset of clients for each training round. In contrast, we propose FedBack, a deterministic approach that leverages control-theoretic principles to manage client participation in ADMM-based federated learning. FedBack models client participation as a discrete-time dynamical system and employs an integral feedback controller to adjust each client's participation rate individually, based on the client's optimization dynamics. We provide global convergence guarantees for our approach by building on the recent federated learning research. Numerical experiments on federated image classification demonstrate that FedBack achieves up to 50\% improvement in communication and computational efficiency over algorithms that rely on a random selection of clients.

Paper Structure

This paper contains 11 sections, 6 theorems, 30 equations, 1 figure, 2 tables, 2 algorithms.

Key Result

lemma 1

Let the gradients in local training rounds eq:GCADMM_primal be bounded. Then, there exists a threshold value $\delta_+$, such that the identifier function $S_i^k$ in eq:identifier satisfies As a consequence, the following bound for the threshold at any time $k\geq 0$ holds,

Figures (1)

  • Figure 1: Validation accuracy of server parameters $\omega^k$ per round $k$ for MNIST (top row) and CIFAR-10 (bottom row) classifiers for each FL algorithm with communication load references $\bar{L}\!=\!\{0.05,0.1,0.2\}$. For FedADMM, FedAvg and FedProx, we randomly sample an $\bar{L}$ proportion of clients, uniformly at random, for participation at each round.

Theorems & Definitions (13)

  • lemma 1: Bounded Threshold
  • proof
  • theorem 1: Global Stability
  • proof
  • remark 1
  • lemma 2: Communication Guarantee
  • proof
  • theorem 2: Global Convergence
  • proof
  • Lemma
  • ...and 3 more