Better Methods and Theory for Federated Learning: Compression, Client Selection and Heterogeneity

Samuel Horváth
7/1/2022
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

Federated learning (FL) is an emerging machine learning paradigm involving multiple clients, e.g., mobile phone devices, with an incentive to collaborate in solving a machine learning problem coordinated by a central server. FL was proposed in 2016 by Konečný et al. and McMahan et al. as a viable privacy-preserving alternative to traditional centralized machine learning since, by construction, the training data points are decentralized and never transferred by the clients to a central server. Therefore, to a certain degree, FL mitigates the privacy risks associated with centralized data collection. Unfortunately, optimization for FL faces several specific issues that centralized optimization usually does not need to handle. In this thesis, we identify several of these challenges and propose new methods and algorithms to address them, with the ultimate goal of enabling practical FL solutions supported with mathematically rigorous guarantees.

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{horvth2022better,
  title  = {Better Methods and Theory for Federated Learning: Compression, Client Selection and Heterogeneity},
  author = {Samuel Horváth},
  year   = {2022},
  eprint = {2207.00392},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.00392v1}
}

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/2207.00392.svg)](https://codeofpaper.com/paper/2207.00392)

Discussion