The risk tail of minimum-norm ReLU interpolation on the sphere

We study two-layer ReLU networks without biases that interpolate n independent Rademacher labels at independent uniform points of the sphere $\mathbb{S}^{d-1}$ with the smallest Euclidean norm of the weights. For univariate networks with biases Joshi, Vardi and Srebro showed that the expected squared risk of minimum-norm interpolants of noisy labels is infinite. In the bias-free model on the sphere, at every fixed sample size n ≥ 3, the tail of the squared risk is a power law with exponent (d-1)/2, from above and from below. So the expected risk is infinite in dimensions two and three and finite in dimension four and higher. The lower bound comes from a close pair of inputs with opposite labels and the other inputs on one side of the plane between them. The upper bound comes from an explicit interpolant whose cost is controlled by the smallest angle between two input lines.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24258719
Primary Topic
Stochastic Gradient Optimization Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The risk tail of minimum-norm ReLU interpolation on the sphere

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Stochastic Gradient Optimization Techniques
preprint

The risk tail of minimum-norm ReLU interpolation on the sphere

Yitzchak Shmalo
preprint en

Abstract

We study two-layer ReLU networks without biases that interpolate n independent Rademacher labels at independent uniform points of the sphere $\mathbb{S}^{d-1}$ with the smallest Euclidean norm of the weights. For univariate networks with biases Joshi, Vardi and Srebro showed that the expected squared risk of minimum-norm interpolants of noisy labels is infinite. In the bias-free model on the sphere, at every fixed sample size n ≥ 3, the tail of the squared risk is a power law with exponent (d-1)/2, from above and from below. So the expected risk is infinite in dimensions two and three and finite in dimension four and higher. The lower bound comes from a close pair of inputs with opposite labels and the other inputs on one side of the plane between them. The upper bound comes from an explicit interpolant whose cost is controlled by the smallest angle between two input lines.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon