math.NAmath.CAstat.ML
The double descent and Runge phenomena in overparametrized polynomial interpolation
📅
👥 2 authors
arXiv:2609.37657v1
Authors
Jason WeinStephan Wojtowytsch
Abstract
The Runge phenomenon in polynomial interpolation is often considered a classical analogue of the double descent phenomenon in machine learning. In this note, we explore overparameterized polynomial interpolation in three popular polynomial bases: Monomial, Chebyshev and Legendre basis with coefficients that are minimal in the $\ell^2$-norm (and, for the monomial basis, also those minimal in the $\ell^1$-norm). We present our results primarily for equidistant and Chebyshev data points, but many results are independent of the exact form of sampling.
Paper Information
- arXiv ID:
- 2609.37657v1
- Published:
Related Categories
math.NAmath.CAstat.ML