arXiv (OAI Expanded)
open access
Lower Bounds for Nonconvex-Concave Minimax Optimization
We study lower bounds on the first-order oracle complexity of smooth nonconvex-concave minimax optimization. We consider objectives $f$ that are jointly $L$-smooth in the primal and dual variables $(x,y)$, concave in $y$, and whose primal value function $Φ(x) := \max_{y\in\mathcal Y} f(x,y)$ satisfi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp Fresh-Gradient Complexity of Nonconvex-Strongly-Concave Minimax Optimization#1154852
- A New Primal-Dual Algorithm with Two Convex Combinations and Linesearch for General Convex-Concave Saddle-Point Problems#793218
- A New Primal-Dual Algorithm with Two Convex Combinations and Linesearch for General Convex-Concave Saddle-Point Problems#789214
- Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization#1144705
- A proximal subgradient algorithm for constrained multiobjective DC-type optimization#925885
Record · ID 1083690
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive