The MAPS Algorithm: Fast model-agnostic and distribution-free prediction intervals for supervised learning
Daniel Salnikov, Dan Leonte, Kevin Michalewicz

TL;DR
The paper introduces MAPS, a scalable, model-agnostic method for computing reliable, distribution-free conditional prediction intervals in high-dimensional supervised learning, addressing limitations of existing approaches.
Contribution
It proposes the LPM representation and the MAPS algorithm, enabling distribution-free, conditional prediction intervals that adapt to any trained model and handle heteroscedastic errors.
Findings
MAPS achieves accurate conditional coverage in simulations.
It effectively debiases neural Bayes estimators for inference.
The method accounts for uncertainty in model calibration and predictions.
Abstract
A fundamental problem in modern supervised learning is computing reliable conditional prediction intervals in high-dimensional settings: existing methods often rely on restrictive modelling assumptions, do not scale as predictor dimension increases, or only guarantee marginal (population-level) rather than conditional (individual-level) coverage. We introduce the (LPM), a new conditional representation, and propose the MAPS (Model-Agnostic Prediction Sets) algorithm that produces distribution-free conditional prediction intervals and adapts to any trained predictive model. Our procedure is bootstrap-based, scales to high-dimensional inputs and accounts for heteroscedastic errors. We establish the theoretical properties of the LPM, connect prediction accuracy to interval length, and provide sufficient conditions for asymptotic conditional coverage. We…
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
TopicsFault Detection and Control Systems
