Skip to content
aiqbench takeAI Research

aiqbench analysis

This research establishes nonasymptotic error bounds for split conformalized quantile regression, specifically addressing performance under covariate shift and sparse ReLU architectures. By deriving matching minimax limits for fixed-score calibration benchmarks, the work provides rigorous theoretical guarantees essential for deploying reliable uncertainty quantification in real-world AI systems where data distributions may vary.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Conformalized Quantile Regression and Minimax Limits of Fixed-Score Calibration under Known Covariate Shift

arXiv2 min read

arXiv:2609.24929v1 Announce Type: cross Abstract: In this paper, we study nonasymptotic $L^p$ error bounds for interval length and conditional coverage in split conformalized quantile regression (CQR). Our bounds rely on local regularity conditions and accuracy guarantees for the estimated quantiles. We further instantiate our bounds for quantile regression with sparse ReLU neural networks. We also consider covariate shift, where the calibration and test covariates have different distributions, and derive nonasymptotic bounds for this setting. We obtain matching minimax upper and lower bounds in expectation for two constructed fixed-score calibration benchmarks under known covariate shift. The bounds match for every $p\in[1,\infty]$ in the scalar problem and for finite $p$ in the $K$-threshold problem; for the latter, a high-probability minimax lower bound holds for every $p\in[1,\infty]$.

Abstract:In this paper, we study nonasymptotic $L^p$ error bounds for interval length and conditional coverage in split conformalized quantile regression (CQR). Our bounds rely on local regularity conditions and accuracy guarantees for the estimated quantiles. We further instantiate our bounds for quantile regression with sparse ReLU neural networks. We also consider covariate shift, where the calibration and test covariates have different distributions, and derive nonasymptotic bounds for this setting. We obtain matching minimax upper and lower bounds in expectation for two constructed fixed-score calibration benchmarks under known covariate shift. The bounds match for every $p\in[1,\infty]$ in the scalar problem and for finite $p$ in the $K$-threshold problem; for the latter, a high-probability minimax lower bound holds for every $p\in[1,\infty]$.

Statistics Theory (math.ST); Machine Learning (cs.LG); Machine Learning (stat.ML)

arXiv:2609.24929 [math.ST]

(or arXiv:2609.24929v1 [math.ST] for this version)

https://doi.org/10.48550/arXiv.2609.24929 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 219 words

Related coverage