Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Farzin, Amir Ali, Pun, Yuen-Man, Braun, Philipp, Summers, Tyler, Shames, Iman
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Machine Learning Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimisation of Submodular Functions Using Gaussian Zeroth-Order Random Oracles
by: Farzin, Amir Ali, et al.
Published: (2025)

Properties of Fixed Points of Generalised Extra Gradient Methods Applied to Min-Max Problems
by: Farzin, Amir Ali, et al.
Published: (2025)

Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2025)

Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm
by: Farzin, Amir Ali, et al.
Published: (2025)

On the Stability Connection Between Discrete-Time Algorithms and Their Resolution ODEs: Applications to Min-Max Optimisation
by: Farzin, Amir Ali, et al.
Published: (2026)

Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2024)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

From Cursed to Competitive: Closing the ZO-FO Gap via Input-to-State Stability
by: Farzin, Amir Ali, et al.
Published: (2026)

Forward-Backward Dynamic Programming for LQG Dynamic Games with Partial and Asymmetric Information
by: Guan, Yuxiang, et al.
Published: (2026)

Online Sketched Newton-Raphson
by: Lupien, Jean-Luc, et al.
Published: (2026)

Best Response Convergence for Zero-sum Stochastic Dynamic Games with Partial and Asymmetric Information
by: Guan, Yuxiang, et al.
Published: (2025)

ZORMS-LfD: Learning from Demonstrations with Zeroth-Order Random Matrix Search
by: Dry, Olivia, et al.
Published: (2025)

Zeroth-Order Non-Log-Concave Sampling with Variance Reduction and Applications to Inverse Problems
by: Sahin, M. Berk, et al.
Published: (2026)

Prying Pedestrian Surveillance-Evasion: Minimum-Time Evasion from an Agile Pursuer
by: Braun, Philipp, et al.
Published: (2024)

Self-Tuning Network Control Architectures with Joint Sensor and Actuator Selection
by: Ganapathy, Karthik, et al.
Published: (2024)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
by: Vasin, Artem, et al.
Published: (2025)

Submodular Max-Min Allocation under Identical Valuations
by: Boehmer, Kimon
Published: (2026)

From open-loop representations to closed-loop feedback implementations in differential games: A numerical case study
by: Braun, Philipp, et al.
Published: (2026)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

A First-Order Algorithm for Decentralised Min-Max Problems
by: Malitsky, Yura, et al.
Published: (2023)

Diffusion Stochastic Optimization for Min-Max Problems
by: Cai, Haoyuan, et al.
Published: (2024)

Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusion
by: He, Ye, et al.
Published: (2024)

Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
by: Kalogiannis, Fivos, et al.
Published: (2024)

Zeroth-Order Non-smooth Non-convex Optimization via Gaussian Smoothing
by: Paul, Anik Kumar, et al.
Published: (2025)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
by: Fahrbach, Matthew, et al.
Published: (2024)

An Adaptive Three-Stage Algorithm For Solving Adjustable Min-Max-Regret Problems
by: Schneider, Kerstin, et al.
Published: (2024)

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems
by: Mafakheri, Behnam, et al.
Published: (2025)

Distributed Online Planning for Min-Max Problems in Networked Markov Games
by: Tzikas, Alexandros E., et al.
Published: (2024)

Global Convergence of a Line-Search Filter Differential Dynamic Programming Method
by: Xu, Ming, et al.
Published: (2026)

Preference graphs: a combinatorial tool for game theory
by: Biggar, Oliver, et al.
Published: (2025)

Joint State and Noise Covariance Estimation
by: Khosoussi, Kasra, et al.
Published: (2025)

The Attractor of the Replicator Dynamic in Zero-Sum Games
by: Biggar, Oliver, et al.
Published: (2023)

A Behavior Tree-inspired programming language for autonomous agents
by: Biggar, Oliver, et al.
Published: (2024)

iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
by: Guo, Yifan, et al.
Published: (2024)

Statistical Mechanics of Min-Max Problems
by: Ichikawa, Yuma, et al.
Published: (2024)

A Max-Min-Max Algorithm for Large-Scale Robust Optimization
by: Tu, Kai, et al.
Published: (2024)

Online Interior-point Methods for Time-varying Equality-constrained Optimization
by: Lupien, Jean-Luc, et al.
Published: (2023)

A Fundamental Convergence Rate Bound for Gradient Based Online Optimization Algorithms with Exact Tracking
by: Wu, Alex Xinting, et al.
Published: (2025)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)