Research map / Optimization / Implicit bias and generalization
Convergences of Regularized Algorithms and Stochastic Gradient Methods with Random Projections
Junhong Lin, Volkan Cevher
Read the paperCheck your idea against 137,217 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
- Optimal Rates of Sketched-regularized Algorithms for Least-Squares Regression over Hilbert Spaces (ICML 2018 · similarity 0.96)
- Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimization (NeurIPS 2020 · similarity 0.89)
- Optimal Randomized First-Order Methods for Least-Squares Problems (ICML 2020 · similarity 0.89)
- Optimal Iterative Sketching Methods with the Subsampled Randomized Hadamard Transform (NeurIPS 2020 · similarity 0.88)
- Sketching for Convex and Nonconvex Regularized Least Squares with Sharp Guarantees (ICLR 2025 · similarity 0.88)
- Controlling the Flow: Stability and Convergence for Stochastic Gradient Descent with Decaying Regularization (NeurIPS 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.
