Saved in:
Bibliographic Details
Main Authors: Liu, Xin, li, Wei, Zhan, Dazhi, Pan, Yu, Ma, Xin, Ding, Yu, Pan, Zhisong
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2310.05495
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913566548819968
author Liu, Xin
li, Wei
Zhan, Dazhi
Pan, Yu
Ma, Xin
Ding, Yu
Pan, Zhisong
author_facet Liu, Xin
li, Wei
Zhan, Dazhi
Pan, Yu
Ma, Xin
Ding, Yu
Pan, Zhisong
contents Federated learning (FL) is a widely employed distributed paradigm for collaboratively training machine learning models from multiple clients without sharing local data. In practice, FL encounters challenges in dealing with partial client participation due to the limited bandwidth, intermittent connection and strict synchronized delay. Simultaneously, there exist few theoretical convergence guarantees in this practical setting, especially when associated with the non-convex optimization of neural networks. To bridge this gap, we focus on the training problem of federated averaging (FedAvg) method for two canonical models: a deep linear network and a two-layer ReLU network. Under the over-parameterized assumption, we provably show that FedAvg converges to a global minimum at a linear rate $\mathcal{O}\left((1-\frac{min_{i \in [t]}|S_i|}{N^2})^t\right)$ after $t$ iterations, where $N$ is the number of clients and $|S_i|$ is the number of the participated clients in the $i$-th iteration. Experimental evaluations confirm our theoretical results.
format Preprint
id arxiv_https___arxiv_org_abs_2310_05495
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle On the Convergence of Federated Averaging under Partial Participation for Over-parameterized Neural Networks
Liu, Xin
li, Wei
Zhan, Dazhi
Pan, Yu
Ma, Xin
Ding, Yu
Pan, Zhisong
Machine Learning
Federated learning (FL) is a widely employed distributed paradigm for collaboratively training machine learning models from multiple clients without sharing local data. In practice, FL encounters challenges in dealing with partial client participation due to the limited bandwidth, intermittent connection and strict synchronized delay. Simultaneously, there exist few theoretical convergence guarantees in this practical setting, especially when associated with the non-convex optimization of neural networks. To bridge this gap, we focus on the training problem of federated averaging (FedAvg) method for two canonical models: a deep linear network and a two-layer ReLU network. Under the over-parameterized assumption, we provably show that FedAvg converges to a global minimum at a linear rate $\mathcal{O}\left((1-\frac{min_{i \in [t]}|S_i|}{N^2})^t\right)$ after $t$ iterations, where $N$ is the number of clients and $|S_i|$ is the number of the participated clients in the $i$-th iteration. Experimental evaluations confirm our theoretical results.
title On the Convergence of Federated Averaging under Partial Participation for Over-parameterized Neural Networks
topic Machine Learning
url https://arxiv.org/abs/2310.05495