pith. sign in

arxiv: 2208.09432 · v1 · pith:BTFQRG4Qnew · submitted 2022-08-19 · 💻 cs.LG · cs.DC

Federated Select: A Primitive for Communication- and Memory-Efficient Federated Learning

classification 💻 cs.LG cs.DC
keywords federatedselectclientsmodelacrossdiscusslearningclient
0
0 comments X
read the original abstract

Federated learning (FL) is a framework for machine learning across heterogeneous client devices in a privacy-preserving fashion. To date, most FL algorithms learn a "global" server model across multiple rounds. At each round, the same server model is broadcast to all participating clients, updated locally, and then aggregated across clients. In this work, we propose a more general procedure in which clients "select" what values are sent to them. Notably, this allows clients to operate on smaller, data-dependent slices. In order to make this practical, we outline a primitive, federated select, which enables client-specific selection in realistic FL systems. We discuss how to use federated select for model training and show that it can lead to drastic reductions in communication and client memory usage, potentially enabling the training of models too large to fit on-device. We also discuss the implications of federated select on privacy and trust, which in turn affect possible system constraints and design. Finally, we discuss open questions concerning model architectures, privacy-preserving technologies, and practical FL systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection

    cs.LG 2026-04 unverdicted novelty 5.0

    FedSLoP reduces communication and memory costs in federated learning through stochastic low-rank gradient projections, with a nonconvex convergence rate of O(1/sqrt(NT)) and competitive accuracy on heterogeneous MNIST data.

  2. FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection

    cs.LG 2026-04 unverdicted novelty 4.0

    FedSLoP applies stochastic low-rank gradient projections in federated learning to reduce communication volume and client memory while proving O(1/sqrt(NT)) convergence to stationary points under standard assumptions a...