arxiv
PublishedSeptember 10, 2026 at 4:00 AM
Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
Publisher summary· verbatim
arXiv:2601.21243v4 Announce Type: replace-cross 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 applie
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivPlanning and Scheduling Business Processes under Control-Flow Uncertainty13harxivSIM: Subspace Interaction-based Method for Token-Level Text Anomaly Detection13harxivWAPP: Safe Learning of Positive Security WAF Policies from Live Traffic13harxivPAN: A World Model for General, Actionable, and Long-Horizon World Simulation13hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗