analiza aiqbench
This research introduces a parameter-free algorithm for group-conditional online conformal prediction, effectively balancing robustness to data shifts with fairness across different data subsets. By achieving superior coverage guarantees without requiring tuning, the method offers a practical solution for reliable uncertainty quantification in non-exchangeable environments. The approach unifies previously distinct trade-offs in online conformal prediction, providing prediction intervals comparable to well-tuned group-specific methods.
Parameter-Free and Group Conditional Online Conformal Prediction
arXiv:2606.00419v3 Announce Type: replace-cross Abstract: Uncertainty quantification (UQ) is critical for the deployment of machine learning predictors in real-world scenarios where the data distribution may shift over time (i.e., data may not be exchangeable). Online conformal prediction (OCP) methods address this issue at the expense of either (i) group-wise error control or (ii) learning-rate independent implementation. Group-conditional coverage is essential for fairness across different collections of data points and for providing finer UQ guarantees. Parameter-free optimization is crucial for robustness to adversarial and unknown data shifts. We propose a parameter-free algorithm for group-conditional OCP and demonstrate that it achieves the best group-conditional coverage guarantees. We evaluate our algorithm on synthetic and real-world data, demonstrating that our method not only improves the reliability of existing parameter-free OCP methods but also provides prediction intervals that are comparable in size to well-tuned group-conditional approaches. By unifying group-conditional coverage with parameter-free online algorithms, our work lays a foundation for fair and robust uncertainty quantification in shifting environments.
Abstract:Uncertainty quantification (UQ) is critical for the deployment of machine learning predictors in real-world scenarios where the data distribution may shift over time (i.e., data may not be exchangeable). Online conformal prediction (OCP) methods address this issue at the expense of either (i) group-wise error control or (ii) learning-rate independent implementation. Group-conditional coverage is essential for fairness across different collections of data points and for providing finer UQ guarantees. Parameter-free optimization is crucial for robustness to adversarial and unknown data shifts. We propose a parameter-free algorithm for group-conditional OCP and demonstrate that it achieves the best group-conditional coverage guarantees. We evaluate our algorithm on synthetic and real-world data, demonstrating that our method not only improves the reliability of existing parameter-free OCP methods but also provides prediction intervals that are comparable in size to well-tuned group-conditional approaches. By unifying group-conditional coverage with parameter-free online algorithms, our work lays a foundation for fair and robust uncertainty quantification in shifting environments.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2606.00419 [stat.ML]
(or arXiv:2606.00419v3 [stat.ML] for this version)
Text integral sub licența deschisă a publicației · 172 cuvinte
Subiecte conexe
Parameter-Free and Group Conditional Online Conformal Prediction
arXiv · 3 iun. 2026
[AINews] not much happened today
Latent Space · 3 oct. 2026
GEM Training: How Meta Doubled the Efficiency of Its LLM-Scale Ads Foundation Model
Meta Engineering · 3 aug. 2026
Coverage You Can Steer: Online Conformal Calibration for RL-Driven Hardware-Aware NAS
arXiv · 5 oct. 2026