Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization

06/16/2021
by   Chinmay Maheshwari, et al.
5

Min-max optimization is emerging as a key framework for analyzing problems of robustness to strategically and adversarially generated data. We propose a random reshuffling-based gradient free Optimistic Gradient Descent-Ascent algorithm for solving convex-concave min-max problems with finite sum structure. We prove that the algorithm enjoys the same convergence rate as that of zeroth-order algorithms for convex minimization problems. We further specialize the algorithm to solve distributionally robust, decision-dependent learning problems, where gradient information is not readily available. Through illustrative simulations, we observe that our proposed approach learns models that are simultaneously robust against adversarial distribution shifts and strategic decisions from the data sources, and outperforms existing methods from the strategic classification literature.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

02/13/2020

Sharp Analysis of Epoch Stochastic Gradient Descent Ascent Methods for Min-Max Optimization

Epoch gradient descent method (a.k.a. Epoch-GD) proposed by (Hazan and K...
10/05/2021

Convex-Concave Min-Max Stackelberg Games

Min-max optimization problems (i.e., min-max games) have been attracting...
05/25/2021

Saddle Point Optimization with Approximate Minimization Oracle and its Application to Robust Berthing Control

We propose an approach to saddle point optimization relying only on an o...
04/27/2021

Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization

Distributionally robust supervised learning (DRSL) is emerging as a key ...
04/26/2019

General risk measures for robust machine learning

A wide array of machine learning problems are formulated as the minimiza...
06/22/2022

Robust Bayesian Recourse

Algorithmic recourse aims to recommend an informative feedback to overtu...
05/28/2021

Efficient Online-Bandit Strategies for Minimax Learning Problems

Several learning problems involve solving min-max problems, e.g., empiri...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.