pith. sign in

arxiv: 2107.03770 · v1 · pith:QWHMX6LXnew · submitted 2021-07-08 · 📊 stat.ML · cs.LG· math.DS· math.OC· math.PR

Federated Learning as a Mean-Field Game

classification 📊 stat.ML cs.LGmath.DSmath.OCmath.PR
keywords learningfederatedgamemean-fieldconcepttheoryaggregationalgorithms
0
0 comments X
read the original abstract

We establish a connection between federated learning, a concept from machine learning, and mean-field games, a concept from game theory and control theory. In this analogy, the local federated learners are considered as the players and the aggregation of the gradients in a central server is the mean-field effect. We present federated learning as a differential game and discuss the properties of the equilibrium of this game. We hope this novel view to federated learning brings together researchers from these two distinct areas to work on fundamental problems of large-scale distributed and privacy-preserving learning algorithms.

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 1 Pith paper

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

  1. MEMOA: Massive Mixtures of Online Agents via Mean-Field Decentralized Nash Equilibria

    cs.LG 2026-05 unverdicted novelty 5.0

    Derives unique closed-form decentralized policy minimizing worst-agent online regret that asymptotically converges to centralized Nash-optimal policy in mean-field limit, with added online mixture weighting.