Two novel online conformal prediction algorithms enforce nested prediction sets across coverage levels using online optimization with regret bounds for quantile error control.
European conference on machine learning , pages=
4 Pith papers cite this work. Polarity classification is still indexing.
years
2026 4verdicts
UNVERDICTED 4representative citing papers
C-SymmPI reformulates conditional coverage as miscoverage error over a user-specified function class to deliver near-conditional guarantees under group symmetries and distributional invariance.
A fair conformal classification method guarantees conditional coverage on adaptively identified subgroups defined via learned representations.
Clipped least-squares importance fitting enables weighted conformal prediction to achieve dataset-conditional coverage guarantees under unbounded covariate shifts by bounding undercoverage and estimating a corrective inflation factor from data.
citing papers explorer
-
Online Conformal Prediction: Enforcing monotonicity via Online Optimization
Two novel online conformal prediction algorithms enforce nested prediction sets across coverage levels using online optimization with regret bounds for quantile error control.
-
Conditional Predictive Inference for General Structured Data with Group Symmetries
C-SymmPI reformulates conditional coverage as miscoverage error over a user-specified function class to deliver near-conditional guarantees under group symmetries and distributional invariance.
-
Fair Conformal Classification via Learning Representation-Based Groups
A fair conformal classification method guarantees conditional coverage on adaptively identified subgroups defined via learned representations.
-
Weight Clipping for Robust Conformal Inference under Unbounded Covariate Shifts
Clipped least-squares importance fitting enables weighted conformal prediction to achieve dataset-conditional coverage guarantees under unbounded covariate shifts by bounding undercoverage and estimating a corrective inflation factor from data.