This paper analyzes the convergence of Federated Averaging (FedAvg) with partial participation under a general variance condition. The authors establish a finite-time stationarity bound for smooth nonconvex objectives, which shows a linear speedup with the number of sampled clients. Their results do not require additional data heterogeneity assumptions like bounded gradient dissimilarity (BGD), and they demonstrate its importance with an example that violates BGD but is covered by their analysis. AI
IMPACT Provides theoretical advancements for distributed machine learning optimization techniques.
RANK_REASON Academic paper on optimization algorithms. [lever_c_demoted from research: ic=1 ai=1.0]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →