Research map / Optimization / Implicit bias and generalization
Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently
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 Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization (ICLR 2019 · similarity 0.91)
- Mirror Descent Beyond Euclidean Stability: An Exponential Separation in Initialization Sensitivity (NeurIPS 2026 · similarity 0.88)
- Implicit Bias of Mirror Flow on Separable Data (NeurIPS 2024 · similarity 0.88)
- Implicit Bias of Mirror Flow in Homogeneous Neural Networks: Sparse and Dense Feature Learning (NeurIPS 2026 · similarity 0.87)
- Achieving Margin Maximization Exponentially Fast via Progressive Norm Rescaling (ICML 2024 · similarity 0.87)
- Implicit Bias of Spectral Descent and Muon on Multiclass Separable Data (NeurIPS 2025 · similarity 0.86)
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.