Research map / Optimization / Nonconvex and smooth optimization
High Probability Generalization Bounds with Fast Rates for Minimax Problems
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
- Sharper Generalization Bounds for Learning with Gradient-dominated Objective Functions (ICLR 2021 · similarity 0.92)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.91)
- Generalization Analysis of Biased Stochastic Gradient Methods for Minimax Problems (NeurIPS 2026 · similarity 0.91)
- What is a Good Metric to Study Generalization of Minimax Learners? (NeurIPS 2022 · similarity 0.91)
- Generalization Bounds using Lower Tail Exponents in Stochastic Optimizers (ICML 2022 · similarity 0.90)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.88)
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.