arXiv Machine Learning September 18, 2026 By Minhao Zhang, Zi Xu

Near-Optimal Pure Single-Loop Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization

Read the original on arXiv Machine Learning →

arXiv:2609. 20327v1 Announce Type: cross Abstract: We study smooth strongly convex--strongly concave minimax optimization with general nonlinear coupling in the deterministic unconstrained setting.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Sep 17

Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization

arXiv:2609. 17973v1 Announce Type: cross Abstract: We introduce a new single-loop algorithmic framework for smooth nonconvex--concave minimax optimization.

By Minghao Zhang, Zi Xu

arXiv Machine Learning

Jul 21

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

arXiv:2601. 21243v3 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.

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

Hugging Face Trending Papers

Aug 24

SGHA: A Single-Loop Fully First-Order Algorithm for Nonconvex-Strongly-Convex Bilevel Optimization

In this work, we study the oracle complexity of finding an $ε$-stationary point for nonconvex-strongly-convex (NC-SC) bilevel optimization using only first-order oracles. Existing methods achieving th...

arXiv Machine Learning

Jun 16

A Fully First-Order Layer for Differentiable Optimization

arXiv:2512. 02494v2 Announce Type: replace Abstract: Differentiable optimization layers enable learning systems to make decisions by solving embedded optimization problems.

By Zihao Zhao, Kai-Chia Mo, Shing-Hei Ho, Brandon Amos, Kai Wang

arXiv Machine Learning

Sep 1

Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization

arXiv:2504.09409v3 Announce Type: replace-cross Abstract: In this paper, we study nonconvex constrained stochastic zeroth-order optimization problems with exact constraints and stochastic objective e...

By Qiankun Shi, Han Yuan, Xiao Wang, Hao Wang

safety

arXiv Machine Learning

2d ago

Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization

arXiv:2609. 30877v1 Announce Type: cross Abstract: We study whether the linear condition-number dependence in the stochastic complexity of SAPD+ is necessary for nonconvex-strongly-concave minimax optimization.

By Qihao Zhou

One email a morning, machine-written

Related stories

Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization

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

SGHA: A Single-Loop Fully First-Order Algorithm for Nonconvex-Strongly-Convex Bilevel Optimization

A Fully First-Order Layer for Differentiable Optimization

Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization

Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization