Scholay

学术搜索 · AI 审稿 · LaTeX 协作

Adaptive Federated Optimization

作者:Sashank J. Reddi, Zachary Charles, Manzil Zaheer, Zachary Garrett, Keith Rush, Jakub Konečný, Sanjiv Kumar, H. Brendan McMahan · 发表于:arXiv (Cornell University) · 年份:2020 · DOI:10.48550/arxiv.2003.00295 · 被引用次数:127 · 研究领域:Privacy-Preserving Technologies in Data、Stochastic Gradient Optimization Techniques、Machine Learning and ELM

Federated learning is a distributed machine learning paradigm in which a large number of clients coordinate with a central server to learn a model without sharing their own training data. Standard federated optimization methods such as Federated Averaging (FedAvg) are often difficult to tune and exhibit unfavorable convergence behavior. In non-federated settings, adaptive optimization methods have had notable success in combating such issues. In this work, we propose federated versions of adaptive optimizers, including Adagrad, Adam, and Yogi, and analyze their convergence in the presence of heterogeneous data for general non-convex settings. Our results highlight the interplay between client heterogeneity and communication efficiency. We also perform extensive experiments on these methods and show that the use of adaptive optimizers can significantly improve the performance of federated learning.