vix.ing · top · new · best · stats · spec

Accelerating Federated Learning via Momentum Gradient Descent

2019/10/08 by Wei Liu, Liu, Wei, Li Chen +5 · 2 citations
Computer Science · #68Q85 (Primary) #68W15 (Secondary) #Age of Information Optimization #FOS: Computer and information sciences #I.2.6 #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Privacy-Preserving Technologies in Data #Stochastic Gradient Optimization Techniques

paper · pdf · doi:10.48550/arxiv.1910.03197

openalex publication_date 2019/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Federated learning (FL) provides a communication-efficient approach to solve machine learning problems concerning distributed data, without sending raw data to a central server. However, existing works on FL only utilize first-order gradient descent (GD) and do not consider the preceding iterations to gradient update which can potentially accelerate convergence. In this paper, we consider momentum term which relates to the last iteration. The proposed momentum federated learning (MFL) uses momentum gradient descent (MGD) in the local update step of FL system. We establish global convergence properties of MFL and derive an upper bound on MFL convergence rate. Comparing the upper bounds on MFL and FL convergence rate, we provide conditions in which MFL accelerates the convergence. For different machine learning models, the convergence performance of MFL is evaluated based on experiments with MNIST dataset. Simulation results comfirm that MFL is globally convergent and further reveal significant convergence improvement over FL.

Citations

Cited by

Related