2021/11/10 by Guillaume Wang, Konstantin Donhauser, Wang, Guillaume +3
Computer Science · Earth and Planetary Sciences · Engineering · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Geophysical Methods and Applications #Information Theory (cs.IT) #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Seismic Imaging and Inversion Techniques #Sparse and Compressive Sensing Techniques #Statistics Theory (math.ST) #cs.IT #cs.LG #math.IT #math.ST #stat.ML #stat.TH
paper · pdf · doi:10.48550/arxiv.2111.05987
33 pages, 1 figure; accepted to AISTATS 2022
openalex publication_date 2021/11/10 · arxiv created 2022/03/07 · arxiv updated 2022/03/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We provide matching upper and lower bounds of order σ2/log(d/n) for the prediction error of the minimum ℓ1-norm interpolator, a.k.a. basis pursuit. Our result is tight up to negligible terms when d ≫ n, and is the first to imply asymptotic consistency of noisy minimum-norm interpolation for isotropic features and sparse ground truths. Our work complements the literature on "benign overfitting" for minimum ℓ2-norm interpolation, where asymptotic consistency can be achieved only when the features are effectively low-dimensional.