Research map / Bandits and online learning / Online convex optimization and games
Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems (ICML 2020 · similarity 0.94)
- Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity (ICLR 2025 · similarity 0.88)
- Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization (NeurIPS 2024 · similarity 0.88)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.88)
- Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization (ICML 2025 · similarity 0.88)
- Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness (ICLR 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.