Research map / Optimization / Implicit bias and generalization
The Statistical Complexity of Early-Stopped Mirror Descent
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
- Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities (NeurIPS 2018 · similarity 0.91)
- Implicit Regularization in Matrix Sensing via Mirror Descent (NeurIPS 2021 · similarity 0.91)
- Connecting Optimization and Regularization Paths (NeurIPS 2018 · similarity 0.91)
- Mirror Descent Beyond Euclidean Stability: An Exponential Separation in Initialization Sensitivity (NeurIPS 2026 · similarity 0.90)
- Implicit Bias of Mirror Flow on Separable Data (NeurIPS 2024 · similarity 0.87)
- Mirror and Preconditioned Gradient Descent in Wasserstein Space (NeurIPS 2024 · 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.