Private Zeroth-Order Nonsmooth Nonconvex Optimization
arXiv:2406.19579
Abstract
We introduce a new zeroth-order algorithm for private stochastic optimization on nonconvex and nonsmooth objectives. Given a dataset of size , our algorithm ensures -Rényi differential privacy and finds a -stationary point so long as . This matches the optimal complexity of its non-private zeroth-order analog. Notably, although the objective is not smooth, we have privacy ``for free'' whenever .