Min-Max Optimization without Gradients: Convergence and Applications to Adversarial ML

arXiv1909.13806MaRDI QIDQ6326266

Author name not available (Why is that?)

Publication date: 30 September 2019

Abstract: In this paper, we study the problem of constrained robust (min-max) optimization ina black-box setting, where the desired optimizer cannot access the gradients of the objective function but may query its values. We present a principled optimization framework, integrating a zeroth-order (ZO) gradient estimator with an alternating projected stochastic gradient descent-ascent method, where the former only requires a small number of function queries and the later needs just one-step descent/ascent update. We show that the proposed framework, referred to as ZO-Min-Max, has a sub-linear convergence rate under mild conditions and scales gracefully with problem size. From an application side, we explore a promising connection between black-box min-max optimization and black-box evasion and poisoning attacks in adversarial machine learning (ML). Our empirical evaluations on these use cases demonstrate the effectiveness of our approach and its scalability to dimensions that prohibit using recent black-box solvers.

Has companion code repository: https://github.com/KaidiXu/ZO-minmax

This page was built for publication: Min-Max Optimization without Gradients: Convergence and Applications to Adversarial ML

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326266)