Variance-Reduced Gradient Estimator for Nonconvex Zeroth-Order Distributed Optimization
<|reference_start|>Variance-Reduced Gradient Estimator for Nonconvex Zeroth-Order Distributed Optimization: This paper investigates distributed zeroth-order optimization for smooth nonconvex problems. We propose a novel variance-reduced gradient estimator, which randomly renovates one orthogonal direction of the true gradient in each iteration while leveraging historical snapshots for variance correction. By integrating this estimator with gradient tracking mechanism, we address the trade-off between convergence rate and sampling cost per zeroth-order gradient estimation that exists in current zeroth-order distributed optimization algorithms, which rely on either the 2-point or $2d$-point gradient estimators. We derive a convergence rate of $\mathcal{O}(d^{\frac{5}{2}}/m)$ for smooth nonconvex functions in terms of sampling number $m$ and problem dimension $d$. Numerical simulations comparing our algorithm with existing methods confirm the effectiveness and efficiency of the proposed gradient estimator.<|reference_end|>
@article{mu2024variance-reduced,
    title={Variance-Reduced Gradient Estimator for Nonconvex Zeroth-Order
  Distributed Optimization},
    author={Huaiyi Mu, Yujie Tang, Zhongkui Li},
    journal={arXiv preprint arXiv:2409.19567},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.19567},
    primaryClass={math.OC cs.MA cs.SY eess.SY}
}