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

📅 2026-09-21
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文研究了在已知协变量偏移情况下,通过分位数回归和稀疏ReLU神经网络方法解决非渐近L^p误差界问题。
📝 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]$.
Problem

Research questions and friction points this paper is trying to address.

covariate shift
quantile regression
nonasymptotic bounds
coverage probability
interval length
Innovation

Methods, ideas, or system contributions that make the work stand out.

Conformalized Quantile Regression
Nonasymptotic L^p Error Bounds
Covariate Shift
Sparse ReLU Neural Networks
Minimax Limits
🔎 Similar Papers
💼 Related Jobs
No related jobs found.
R
Rustam Isaev
Faculty of Computer Science, HSE University, Moscow, Russia
A
Anton Conrad
Laboratoire de Recherche d’EPITA, Le Kremlin-Bicêtre, France
D
Denis Belomestny
Faculty of Computer Science, HSE University, Moscow, Russia
Eric Moulines
Eric Moulines
Professeur, Ecole Polytechnique, Membre de l'Académie des Sciences
StatisticsMachine learningSignal Processing
Sergey Samsonov
Sergey Samsonov
HSE university, Moscow
high-dimensional probabilityMarkov ChainsMCMC