Ridgeless Interpolation with Shallow ReLU Networks in $1D$ is Nearest Neighbor Curvature Extrapolation and Provably Generalizes on Lipschitz Functions
Boris Hanin

TL;DR
This paper characterizes one-layer ReLU networks that interpolate data with minimal weights, showing they perform curvature-based extrapolation and can provably generalize well on Lipschitz functions in 1D.
Contribution
It provides a geometric description of ridgeless ReLU interpolants in 1D, linking their extrapolation behavior to curvature estimates from data.
Findings
Interpolants compare curvature signs at data points to determine linear or convex/concave behavior.
Ridgeless ReLU interpolants achieve near-optimal generalization on 1D Lipschitz functions.
The method offers a geometric understanding of how shallow ReLU networks extrapolate.
Abstract
We prove a precise geometric description of all one layer ReLU networks with a single linear unit and input/output dimensions equal to one that interpolate a given dataset and, among all such interpolants, minimize the -norm of the neuron weights. Such networks can intuitively be thought of as those that minimize the mean-squared error over plus an infinitesimal weight decay penalty. We therefore refer to them as ridgeless ReLU interpolants. Our description proves that, to extrapolate values for inputs lying between two consecutive datapoints, a ridgeless ReLU interpolant simply compares the signs of the discrete estimates for the curvature of at and derived from the dataset . If the curvature estimates at and have different signs, then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Model Reduction and Neural Networks · Medical Image Segmentation Techniques
MethodsWeight Decay
