Stable Minima Cannot Overfit in Univariate ReLU Networks: Generalization by Large Step Sizes
<|reference_start|>Stable Minima Cannot Overfit in Univariate ReLU Networks: Generalization by Large Step Sizes: We study the generalization of two-layer ReLU neural networks in a univariate nonparametric regression problem with noisy labels. This is a problem where kernels (\emph{e.g.} NTK) are provably sub-optimal and benign overfitting does not happen, thus disqualifying existing theory for interpolating (0-loss, global optimal) solutions. We present a new theory of generalization for local minima that gradient descent with a constant learning rate can \emph{stably} converge to. We show that gradient descent with a fixed learning rate $\eta$ can only find local minima that represent smooth functions with a certain weighted \emph{first order total variation} bounded by $1/\eta - 1/2 + \widetilde{O}(\sigma + \sqrt{\mathrm{MSE}})$ where $\sigma$ is the label noise level, $\mathrm{MSE}$ is short for mean squared error against the ground truth, and $\widetilde{O}(\cdot)$ hides a logarithmic factor. Under mild assumptions, we also prove a nearly-optimal MSE bound of $\widetilde{O}(n^{-4/5})$ within the strict interior of the support of the $n$ data points. Our theoretical results are validated by extensive simulation that demonstrates large learning rate training induces sparse linear spline fits. To the best of our knowledge, we are the first to obtain generalization bound via minima stability in the non-interpolation case and the first to show ReLU NNs without regularization can achieve near-optimal rates in nonparametric regression.<|reference_end|>
@article{qiao2024stable,
    title={Stable Minima Cannot Overfit in Univariate ReLU Networks: Generalization
  by Large Step Sizes},
    author={Dan Qiao, Kaiqi Zhang, Esha Singh, Daniel Soudry, Yu-Xiang Wang},
    journal={arXiv preprint arXiv:2406.06838},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.06838},
    primaryClass={cs.LG cs.AI stat.ML}
}