Conformal online model aggregation
원문 초록
Conformal prediction equips machine learning models with a reasonable notion of uncertainty quantification without making strong distributional assumptions. It wraps around any black-box prediction model and converts point predictions into set predictions that have a predefined marginal coverage guarantee. However, conformal prediction only works if we fix the underlying machine learning model in advance. A relatively unaddressed issue in conformal prediction is that of model selection and/or aggregation: for a given problem, which of the plethora of prediction methods (random forests, neural nets, regularized linear models, etc.) should we conformalize? This paper proposes a new approach towards conformal model aggregation in online settings that is based on combining the prediction sets from several algorithms by voting, where weights on the models are adapted over time based on past performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
When Can We Reuse a Calibration Set for Multiple Conformal Predictions?
Model-Free Kernel Conformal Depth Measures Algorithm for Uncertainty Quantification in Regression Models in Separable Hilbert Spaces
Enhancing Adversarial Robustness with Conformal Prediction: A Framework for Guaranteed Model Reliability
Efficient Robust Conformal Prediction via Lipschitz-Bounded Networks
Foundation models for time series forecasting: Application in conformal prediction
A Wireless Foundation Model for Multi-Task Prediction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.