OpenAlex ·

Sharp Fresh-Gradient Complexity of Nonconvex-Strongly-Concave Minimax Optimization

Wendao Wu, Haihan Zhang, Chenheng Zhang, Yanyi Li, Chunyuan Zheng, Cong Fang, Haoxuan Li and Zhouchen Lin

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.00229
Original
Read it at the publisher
Topics
Artificial IntelligenceComputational ComplexityNumerical Analysis

Abstract

We characterize the fresh-gradient oracle complexity of smooth nonconvex-strongly-concave minimax optimization, with matching upper and lower bounds up to logarithmic factors. Let $Φ(x)=\max_y f(x,y)$, where $f$ is jointly $L$-smooth and $μ$-strongly concave in $y$ on unconstrained Euclidean domains, and set $κ=L/μ$. Each query returns a fresh unbiased joint gradient with conditional variance at most $σ^2$. Given initial primal gap at most $Δ$ and dual residual $\|\nabla_y f(x_0,y_0)\|\le G$, the fixed-budget complexity of finding $\|\nablaΦ(\widehat x)\|\leε$ with probability at least $2/3$ is $\widetildeΘ(\sqrtκLΔ/ε^2+κLΔσ^2/ε^4+κ^2σ^2/ε^2+\sqrtκ\log_+(G/(ε\sqrtκ)))$, where $\log_+u=\log\max\{1,u\}$. This characterization holds when $κ$ and $LΔ/ε^2$ exceed universal constants, uniformly over finite dimensions, and the suppressed logarithms are independent of $G$. It establishes the necessity of linear condition-number dependence in the global stochastic cost and identifies a separate statistical refinement cost. A proximal method separates coarse primal progress from one final refinement, while the lower bounds apply to arbitrary adaptive randomized algorithms. Dual initialization contributes only an additive logarithmic cost, yet removing its control eliminates every finite dimension-free complexity bound, even with exact gradients.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Artificial Intelligence

Get the few papers worth your time in Artificial Intelligence every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics