Wild refitting for black box prediction
Martin J. Wainwright

TL;DR
This paper introduces a computationally efficient 'wild refitting' method that provides high-probability upper bounds on the prediction error of black box estimators, applicable across various complex problems.
Contribution
It proposes a novel wild refitting procedure that requires only a single dataset and black box access, with theoretical guarantees for its performance.
Findings
Provides high-probability bounds on prediction error
Applicable to diverse problems like image restoration and kernel methods
Guides the design of residual formation and noise rescaling
Abstract
We describe and analyze a computionally efficient refitting procedure for computing high-probability upper bounds on the instance-wise mean-squared prediction error of penalized nonparametric estimates based on least-squares minimization. Requiring only a single dataset and black box access to the prediction method, it consists of three steps: computing suitable residuals, symmetrizing and scaling them with a pre-factor , and using them to define and solve a modified prediction problem recentered at the current estimate. We refer to it as wild refitting, since it uses Rademacher residual symmetrization as in a wild bootstrap variant. Under relatively mild conditions allowing for noise heterogeneity, we establish a high probability guarantee on its performance, showing that the wild refit with a suitably chosen wild noise scale gives an upper bound on prediction error. This…
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
TopicsSparse and Compressive Sensing Techniques · Advanced Vision and Imaging · Advanced Image Processing Techniques
