AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

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

Amir Ali Farzin, Yuen-Man Pun, Philipp Braun, Tyler Summers, Iman Shames

ICML 2026 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use the ZO extragradient min-max algorithm instead of a supervised U-Netonline adversarial segmentation · Online adversarial image segmentation (synthetic 50x50 video)average IoU: 0.905 -> 0.975Improved
use the ZO extragradient algorithm instead of a semi-supervised U-Netonline adversarial segmentation · Online adversarial image segmentation (synthetic 50x50 video)average IoU: 0.847 -> 0.975Improved
use the ZO algorithm instead of supervised U-Netonline adversarial segmentation · Online adversarial image segmentation (synthetic 50x50 video)average recall: 0.994 -> 0.989Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy