arXiv (All)
open access
The double descent and Runge phenomena in overparametrized polynomial interpolation
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 coefficie
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Long-step strategies in interior-point primal-dual methods#429967
- Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods#612466
- Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods#610989
- Transience Bounds for Distributed Algorithms#629689
- Majorization Inequalities from Logarithmic Convexity#1076874
Record · ID 1141970
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive