paper-with-me

홈 › Papers

Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast Optimization

2024-06-12 · Yuhang Cai, Jingfeng Wu, Song Mei, Michael Lindsey, Peter L. Bartlett

The typical training of neural networks using large stepsize gradient descent (GD) under the logistic loss often involves two distinct phases, where the empirical risk oscillates in the first phase but decreases monotonically in the second phase. We investigate this phenomenon in two-layer networks that satisfy a near-homogeneity condition. We show that the second phase begins once the empirical risk falls below a certain threshold, dependent on the stepsize. Additionally, we show that the normalized margin grows nearly monotonically in the second phase, demonstrating an implicit bias of GD in training non-homogeneous predictors. If the dataset is linearly separable and the derivative of the activation function is bounded away from zero, we show that the average empirical risk decreases, implying that the first phase must stop in finite steps. Finally, we demonstrate that by choosing a suitably large stepsize, GD that undergoes this phase transition is more efficient than GD that monotonically decreases the risk. Our analysis applies to networks of any width, beyond the well-known neural tangent kernel and mean-field regimes.

📄 PDF Abstract BibTeX arXiv:2406.08654

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Generalization Bounds of Stochastic Gradient Descent in Homogeneous Neural Networks

2026-02-26 · Wenquan Ma, Yang Sui, Jiaye Teng, Bohan Wang 외 arxiv

Algorithmic stability is among the most potent techniques in generalization analysis. However, its derivation usually requires a stepsize $η_t = \mathcal{O}(1/t)$ under non-convex training regimes, where $t$ denotes iter…

(S)GD over Diagonal Linear Networks: Implicit bias, Large Stepsizes and Edge of Stability

2023-09-21 · NeurIPS 2023 11

In this paper, we investigate the impact of stochasticity and large stepsizes on the implicit regularisation of gradient descent (GD) and stochastic gradient descent (SGD) over $2$-layer diagonal linear networks. We prov…

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play

2025-06-16 · John Lazarsfeld, Georgios Piliouras, Ryann Sim, Andre Wibisono

This paper investigates the sublinear regret guarantees of two non-no-regret algorithms in zero-sum games: Fictitious Play, and Online Gradient Descent with constant stepsizes. In general adversarial online learning sett…

Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency

2024-02-24 · Jingfeng Wu, Peter L. Bartlett, Matus Telgarsky, Bin Yu

We consider gradient descent (GD) with a constant stepsize applied to logistic regression with linearly separable data, where the constant stepsize $\eta$ is so large that the loss initially oscillates. We show that GD e…

General Classification

Open Problem: Anytime Convergence Rate of Gradient Descent

2024-06-19 · Guy Kornowski, Ohad Shamir

Recent results show that vanilla gradient descent can be accelerated for smooth convex objectives, merely by changing the stepsize sequence. We show that this can lead to surprisingly large errors indefinitely, and there…