Skip to content
NewA calmer, faster ZeroHour

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

arXiv cs.AI / cs.LG / cs.CLby Rustam Isaev ()1 min read1 · 1 read
AI summary · grok-4.7Summaries by Vani AI

Paper derives nonasymptotic error bounds for split conformalized quantile regression under known covariate shift.

The paper derives nonasymptotic L^p bounds on interval length and conditional coverage for split conformalized quantile regression, assuming local regularity and accurate quantile estimates. The bounds are instantiated for quantile regression with sparse ReLU neural networks and extended to known covariate shift between calibration and test covariates. Matching minimax upper and lower bounds are obtained for two fixed-score calibration benchmarks, for every p in [1, infinity] in a scalar problem and for finite p in a K-threshold problem.

Key facts
  • Nonasymptotic L^p bounds for split conformalized quantile regression.
  • Results instantiated for sparse ReLU network quantile estimators.
  • Matching minimax bounds under known covariate shift.
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at arxiv.org

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.

arXiv cs.AI / cs.LG / cs.CL

By Rustam Isaev · arxiv.org

Read the full article at arXiv cs.AI / cs.LG / cs.CL

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.