#machine learning
Jan 2026
Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
In expectation sense, it is proved the convergence of the algorithm to an $\epsilon$-saddle point in the offline case and, in the expectation sense, in the online setting, the algorithm achieves O(\sqrt{N(1+\bar{P}_N)})$ online duality gap.
Amir Ali Farzin, Yuen-Man Pun, Philipp Braun et al.
· arXiv.org · 2 citations