Minimum norm interpolation by perceptra: Explicit regularization and implicit bias
Machine Learning
2023-11-13 v1 Machine Learning
Optimization and Control
Abstract
We investigate how shallow ReLU networks interpolate between known regions. Our analysis shows that empirical risk minimizers converge to a minimum norm interpolant as the number of data points and parameters tends to infinity when a weight decay regularizer is penalized with a coefficient which vanishes at a precise rate as the network width and the number of data points grow. With and without explicit regularization, we numerically study the implicit bias of common optimization algorithms towards known minimum norm interpolants.
Cite
@article{arxiv.2311.06138,
title = {Minimum norm interpolation by perceptra: Explicit regularization and implicit bias},
author = {Jiyoung Park and Ian Pelakh and Stephan Wojtowytsch},
journal= {arXiv preprint arXiv:2311.06138},
year = {2023}
}