Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regression
Jingfeng Wu, Peter L. Bartlett, Matus Telgarsky, Bin Yu
Abstract
In overparameterized logistic regression, gradient descent (GD) iterates diverge in norm while converging in direction to the maximum ℓ 2 -margin solution-a phenomenon known as the implicit bias of GD. This work investigates additional regularization effects induced by early stopping in well-specified high-dimensional logistic regression. We first demonstrate that the excess logistic risk vanishes for early-stopped GD but diverges to infinity for GD iterates at convergence. This suggests that early-stopped GD is well-calibrated, whereas asymptotic GD is statistically inconsistent. Second, we show that to attain a small excess zero-one risk, polynomially many samples are sufficient for early-stopped GD, while exponentially many samples are necessary for any interpolating estimator, including asymptotic GD. This separation underscores the statistical benefits of early stopping in the overparameterized regime. Finally, we establish nonasymptotic bounds on the norm and angular differences between earlystopped GD and ℓ 2 -regularized empirical risk minimizer, thereby connecting the implicit regularization of GD with explicit ℓ 2 -regularization.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1004f89e-cb40-4019-a513-25a5294f22d2Cited by top-tier papers6
- Large Stepsizes Accelerate Gradient Descent for Regularized Logistic RegressionJingfeng Wu, Pierre Marion, Peter L. BartlettNeurIPS 2025 · 12 citations
- How reinforcement learning after next-token prediction facilitates learningNikolaos Tsilivis, Eran Malach, Karen Ullrich, Julia KempeICLR 2026 · 9 citations
- Any-stepsize Gradient Descent for Separable Data under Fenchel-Young LossesHan Bao, Shinsaku Sakaue, Yuki TakezawaNeurIPS 2025 · 2 citations
- Implicit bias produces neural scaling laws in learning curves, from perceptrons to deep networksFrancesco D'Amico, Dario Bocchi, Matteo NegriICLR 2026 · 2 citations
- Hard labels sampled from sparse targets mislead rotation invariant algorithmsAvrajit Ghosh, Bin Yu, Manfred Warmuth, Peter BartlettICML 2026 · 1 citation
Builds on9
- Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networksZiwei Ji, Matus TelgarskyICLR 2020 · 193 citations
- Early-stopped neural networks are consistentZiwei Ji, Justin D. Li, Matus TelgarskyNeurIPS 2021 · 58 citations
- Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian MixturesYuan Cao, Quanquan Gu, Mikhail BelkinNeurIPS 2021 · 57 citations
- Implicit Bias of Gradient Descent for Logistic Regression at the Edge of StabilityJingfeng Wu, Vladimir Braverman, Jason D. LeeNeurIPS 2023 · 46 citations
- The Benefits of Implicit Regularization from SGD in Least Squares ProblemsDifan Zou, Jingfeng Wu, Vladimir Braverman, Quanquan Gu et al.NeurIPS 2021 · 41 citations
Related papers
- Implicit Sparse Regularization: The Impact of Depth and Early StoppingJiangyuan Li, Thanh Van Nguyen, Chinmay Hegde, Ka Wai WongNeurIPS 2021 · 43 citations
- The Implicit Bias of Adam on Separable DataChenyang Zhang, Difan Zou, Yuan CaoNeurIPS 2024 · 37 citations
- Direction Matters: On the Implicit Bias of Stochastic Gradient Descent with Moderate Learning RateJingfeng Wu, Difan Zou, Vladimir Braverman, Quanquan GuICLR 2021 · 18 citations
- Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast OptimizationYuhang Cai, Jingfeng Wu, Song Mei, Michael Lindsey et al.NeurIPS 2024 · 20 citations
- (S)GD over Diagonal Linear Networks: Implicit bias, Large Stepsizes and Edge of StabilityMathieu Even, Scott Pesme, Suriya Gunasekar, Nicolas FlammarionNeurIPS 2023 · 42 citations
