arxiv
PublishedSeptember 29, 2026 at 4:00 AM
Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization
Publisher summary· verbatim
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. For jointly $L$-smooth objectives with dual strong-concavity parameter $\mu$, we prove a l
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
arxivReasoning Externalization for Faithful Large Language Model Narratives of Stock Return Predictions11harxivConsistent Plan-Act for Long-Horizon Agentic Tasks11harxivPredictive Self-Supervised Learning Provably Identifies Stochastic Signals under Nuisance11harxivBoosting Adversarial Robustness and Generalization with Dictionary Structure11hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗