Stochastic Zeroth-order Riemannian Derivative Estimation and Optimization
This addresses optimization problems where only noisy objective evaluations are available, such as in robotics and neural network attacks, but is incremental as it extends Gaussian smoothing to Riemannian settings.
The paper tackles stochastic zeroth-order optimization over Riemannian manifolds by proposing estimators for the Riemannian gradient and Hessian from noisy function evaluations, achieving oracle complexities independent of ambient dimension and dependent only on intrinsic manifold dimension.
We consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in Euclidean space, where the task is to solve Riemannian optimization problem with only noisy objective function evaluations. Towards this, our main contribution is to propose estimators of the Riemannian gradient and Hessian from noisy objective function evaluations, based on a Riemannian version of the Gaussian smoothing technique. The proposed estimators overcome the difficulty of the non-linearity of the manifold constraint and the issues that arise in using Euclidean Gaussian smoothing techniques when the function is defined only over the manifold. We use the proposed estimators to solve Riemannian optimization problems in the following settings for the objective function: (i) stochastic and gradient-Lipschitz (in both nonconvex and geodesic convex settings), (ii) sum of gradient-Lipschitz and non-smooth functions, and (iii) Hessian-Lipschitz. For these settings, we analyze the oracle complexity of our algorithms to obtain appropriately defined notions of $ε$-stationary point or $ε$-approximate local minimizer. Notably, our complexities are independent of the dimension of the ambient Euclidean space and depend only on the intrinsic dimension of the manifold under consideration. We demonstrate the applicability of our algorithms by simulation results and real-world applications on black-box stiffness control for robotics and black-box attacks to neural networks.