Distributed Zero-Order Algorithms for Nonconvex Multi-Agent Optimization
arXiv:1908.11444
Abstract
Distributed multi-agent optimization finds many applications in distributed learning, control, estimation, etc. Most existing algorithms assume knowledge of first-order information of the objective and have been analyzed for convex problems. However, there are situations where the objective is nonconvex, and one can only evaluate the function values at finitely many points. In this paper we consider derivative-free distributed algorithms for nonconvex multi-agent optimization, based on recent progress in zero-order optimization. We develop two algorithms for different settings, provide detailed analysis of their convergence behavior, and compare them with existing centralized zero-order algorithms and gradient-based distributed algorithms.
References in corpus (5)
- Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator
- A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Zeroth Order Nonconvex Multi-Agent Optimization over Networks
- A Sharp Estimate on the Transient Time of Distributed Stochastic Gradient Descent