Universal Prediction Band via Semi-Definite Programming
Not on the map. Why?
Abstract (arXiv)
We propose a computationally efficient method to construct nonparametric, heteroscedastic prediction bands for uncertainty quantification, with or without any user-specified predictive model. Our approach provides an alternative to the now-standard conformal prediction for uncertainty quantification, with novel theoretical insights and computational advantages. The data-adaptive prediction band is universally applicable with minimal distributional assumptions, has strong non-asymptotic coverage properties, and is easy to implement using standard convex programs. Our approach can be viewed as a novel variance interpolation with confidence and further leverages techniques from semi-definite programming and sum-of-squares optimization. Theoretical and numerical performances for the proposed approach for uncertainty quantification are analyzed.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 10 of its 32 references that are in the map. First posted on arXiv 31 Mar 2021.
Builds on
10 of 32 references.
References · 10
- 2016Distribution-Free Predictive Inference For Regressioncited by 657
- 2019Conformalized Quantile Regressioncited by 620
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2021Deep learning: a statistical viewpointcited by 239
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2019Linearized two-layers neural networks in high dimensioncited by 155
- 2020A Precise High-Dimensional Asymptotic Theory for Boosting and Minimum-ℓ1-Norm Interpolated Classifierscited by 44
- 2020Non-parametric Models for Non-negative Functionscited by 40
- 2021Interpolating Classifiers Make Few Mistakescited by 22
- 2020Shape-Constrained Regression using Sum of Squares Polynomialscited by 5
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.