Research map / Optimization / Implicit bias and generalization
An algorithmic view of L2 regularization and some path-following algorithms
Yunzhang Zhu, Renxiong Liu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use proposed Newton path-following instead of Euler, Runge-Kutta or Rosset grid method at equal Newton-step budget | l2-regularized logistic regression path · Synthetic nonseparable and separable, (n,p) in (1000,500),(1000,1000),(1000,2000) | global approximation error of solution path | Improved |
| choose grid points adaptively (Newton method) instead of equally spaced with C(t)=1/t (ablation) | Rosset path-following method · Synthetic logistic regression | global approximation error | Improved |
| use Newton method instead of glmnet and gradient descent | solution path computation · Synthetic logistic regression, 100 simulations | runtime at small suboptimality | Mixed |
| increase initial step size (ablation) | Newton and gradient descent path methods · Synthetic logistic regression, (n,p) in (500,100),(500,500),(500,1000) | approximate statistical risk curve (KL) | Hurt |
| use second-order Runge-Kutta with larger constant step size (ablation) | ODE-based path methods · Synthetic logistic regression risk curves | approximate statistical risk curve | No clear effect |
Closest papers by meaning
- A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees (NeurIPS 2025 · similarity 0.86)
- The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport (ICML 2025 · similarity 0.86)
- Large Stepsizes Accelerate Gradient Descent for Regularized Logistic Regression (NeurIPS 2025 · similarity 0.86)
- Skip the Hessian, Keep the Rates: Globalized Semismooth Newton with Lazy Hessian Updates (NeurIPS 2026 · similarity 0.86)
- Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport (NeurIPS 2025 · similarity 0.86)
- Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations (NeurIPS 2024 · similarity 0.85)
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.
