Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling
arXiv:2003.13001 · doi:10.1137/21M1392966
Abstract
We consider the problem of minimizing a high-dimensional objective function, which may include a regularization term, using (possibly noisy) evaluations of the function. Such optimization is also called derivative-free, zeroth-order, or black-box optimization. We propose a new eroth-rder egularized ptimization method, dubbed ZORO. When the underlying gradient is approximately sparse at an iterate, ZORO needs very few objective function evaluations to obtain a new iterate that decreases the objective function. We achieve this with an adaptive, randomized gradient estimator, followed by an inexact proximal-gradient scheme. Under a novel approximately sparse gradient assumption and various different convex settings, we show the (theoretical and empirical) convergence rate of ZORO is only logarithmically dependent on the problem dimension. Numerical experiments show that ZORO outperforms the existing methods with similar assumptions, on both synthetic and real datasets.
References in corpus (7)
- Practical Bayesian Optimization of Machine Learning Algorithms
- Evolution Strategies as a Scalable Alternative to Reinforcement Learning
- Hybrid Deterministic-Stochastic Methods for Data Fitting
- Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
- Simple random search provides a competitive approach to reinforcement learning
- Stochastic Zeroth-order Optimization in High Dimensions
- ZO-AdaMM: Zeroth-Order Adaptive Momentum Method for Black-Box Optimization
Cited by in corpus (8)
- A Hamilton-Jacobi-based Proximal Operator
- A One-bit, Comparison-Based Gradient Estimator
- Stochastic Zeroth Order Gradient and Hessian Estimators: Variance Reduction and Refined Bias Bounds
- A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization
- Curvature-Aware Derivative-Free Optimization
- Explainable Adversarial Attacks on Coarse-to-Fine Classifiers
- Statistical Inference for Polyak-Ruppert Averaged Zeroth-order Stochastic Gradient Algorithm
- A Dimension-Insensitive Algorithm for Stochastic Zeroth-Order Optimization