Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach

arXiv:2601.21243 · math.OC, cs.LG, cs.NA, math.NA · Submitted 2026-01-29 · Read on arXiv

math.OC, cs.LG, cs.NA, math.NA

Submitted: 2026-01-29

Updated: 2026-09-07

Code: https://github.com/amirali78frz/Minimax_

License: http://creativecommons.org/licenses/by/4.0/

The gist: We consider max-min and min-max problems with objective functions that are possibly non-smooth, submodular with respect to the minimiser and concave with respect to the maximiser.

Terminology

Abstract

We consider max-min and min-max problems with objective functions that are possibly non-smooth, submodular with respect to the minimiser and concave with respect to the maximiser. We investigate the performance of a zeroth-order method applied to this problem. The method is based on the subgradient of the Lovász extension of the objective function with respect to the minimiser and based on Gaussian smoothing to estimate the smoothed function gradient with respect to the maximiser. In expectation sense, we prove the convergence of the algorithm to an ε-saddle point in the offline case. Moreover, we show that, in the expectation sense, in the online setting, the algorithm achieves O(sqrt N(1+ N)) online duality gap, where N is the number of iterations and N is the path length of the sequence of optimal decisions. The complexity analysis and hyperparameter selection are presented for all the cases. The theoretical results are illustrated via numerical examples.

Sources

Related papers