Fast exact conformalization of the lasso using piecewise linear homotopy

From MaRDI portal
Publication:5212903

DOI10.1093/BIOMET/ASZ046zbMATH Open1437.62278arXiv1708.00427OpenAlexW2977751175WikidataQ127399578 ScholiaQ127399578MaRDI QIDQ5212903FDOQ5212903

Jing Lei

Publication date: 30 January 2020

Published in: Biometrika (Search for Journal in Brave)

Abstract: Conformal prediction is a general method that converts almost any point predictor to a prediction set. The resulting set keeps good statistical properties of the original estimator under standard assumptions, and guarantees valid average coverage even when the model is misspecified. A main challenge in applying conformal prediction in modern applications is efficient computation, as it generally requires an exhaustive search over the entire output space. In this paper we develop an exact and computationally efficient conformalization of the Lasso and elastic net. The method makes use of a novel piecewise linear homotopy of the Lasso solution under perturbation of a single input sample point. As a by-product, we provide a simpler and better justified online Lasso algorithm, which may be of independent interest. Our derivation also reveals an interesting accuracy-stability trade-off in conformal inference, which is analogous to the bias-variance trade-off in traditional parameter estimation. The practical performance of the new algorithm is demonstrated using both synthetic and real data examples.


Full work available at URL: https://arxiv.org/abs/1708.00427






Cited In (14)






This page was built for publication: Fast exact conformalization of the lasso using piecewise linear homotopy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212903)