On the Convergence of Prior-Guided Zeroth-Order Optimization AlgorithmsDownload PDF

21 May 2021, 20:49 (edited 07 Nov 2021)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: zeroth-order optimization, gradient-free optimization, evolutionary strategies, convex optimization, randomized methods
  • TL;DR: We conduct convergence analysis on frameworks of ZO algorithms including existing prior-guided random gradient-free methods and a new prior-guided accelerated random search method.
  • Abstract: Zeroth-order (ZO) optimization is widely used to handle challenging tasks, such as query-based black-box adversarial attacks and reinforcement learning. Various attempts have been made to integrate prior information into the gradient estimation procedure based on finite differences, with promising empirical results. However, their convergence properties are not well understood. This paper makes an attempt to fill up this gap by analyzing the convergence of prior-guided ZO algorithms under a greedy descent framework with various gradient estimators. We provide a convergence guarantee for the prior-guided random gradient-free (PRGF) algorithms. Moreover, to further accelerate over greedy descent methods, we present a new accelerated random search (ARS) algorithm that incorporates prior information, together with a convergence analysis. Finally, our theoretical results are confirmed by experiments on several numerical benchmarks as well as adversarial attacks.
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
  • Code: https://github.com/csy530216/pg-zoo
15 Replies

Loading