Adaptive Conformal Prediction (ACP)

• Adaptive Conformal Prediction is a framework that replaces a single global calibration rule with adaptive, input-dependent methods to better capture local heteroscedastic uncertainty.
• It employs mechanisms such as online miscoverage updates, input-conditioned calibration, and shift-aware reweighting to tailor prediction intervals in dynamic and subpopulation-shift scenarios.
• The approach offers flexible validity guarantees—from finite-sample marginal to PAC-style and long-run coverage—and has been effectively applied in safety-critical control, medical imaging, and quantum machine learning.

Adaptive Conformal Prediction (ACP) denotes a family of conformal methods that replace a single static calibration rule with mechanisms that adapt to the input, time index, subpopulation, model state, or downstream objective while retaining a validity notion appropriate to the setting. Across recent work, this adaptivity appears as input-dependent thresholds, online updates of the effective miscoverage level, localized or reweighted calibration, learned coverage policies, score-space transformations, and post-hoc probability calibration constrained by conformal sets (Dixit et al., 2022, Amoukou et al., 2023, Gauthier et al., 5 Oct 2025, Kotelevskii et al., 21 May 2025). The unifying motivation is that standard conformal prediction is marginally valid but often rigid: it uses one global correction or one fixed coverage level even when uncertainty is heteroscedastic, nonstationary, subpopulation-dependent, or concentrated on a small set of difficult examples (Amoukou et al., 2023, Gauthier et al., 5 Oct 2025, Octadion et al., 13 May 2026).

1. Standard conformal prediction and the motivation for adaptivity

Classical split conformal prediction constructs a set

$C_\alpha(x)=\{y:V(x,y)\le q_\alpha\},$

where $q_\alpha$ is a calibration quantile of nonconformity scores, and guarantees

$\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$

under exchangeability (Kotelevskii et al., 21 May 2025). In regression, the same logic typically yields intervals by adding a global empirical quantile of residuals to a point predictor; in multiclass classification, it yields a label set with nominal marginal coverage (Amoukou et al., 2023, Kotelevskii et al., 21 May 2025).

The motivation for ACP is that this global correction is often poorly aligned with local uncertainty. One paper states that standard split conformal prediction uses a “single, constant quantile correction” computed from calibration residuals, so every test point receives the same interval width even when the residual distribution depends on $X$ (Amoukou et al., 2023). Another emphasizes that once $\alpha$ is fixed in the classical conformal setup, it generally cannot be chosen after looking at the calibration data without invalidating the guarantee; this is precisely the rigidity that adaptive conformal methods seek to overcome (Gauthier et al., 5 Oct 2025). In medical image classification, the same issue appears in a different form: standard size-optimized RAPS can achieve good global coverage while becoming nearly deterministic and exhibiting stratified undercoverage on uncertain samples (Octadion et al., 13 May 2026).

ACP therefore addresses several related deficiencies. In nonstationary time series and control, it tracks changing prediction quality online rather than relying on exchangeability across time (Dixit et al., 2022, Zhou et al., 22 Mar 2025). In heteroscedastic regression, it seeks intervals whose lengths vary with the test point rather than using one global residual correction (Amoukou et al., 2023, Colombo, 2023). Under subpopulation shift, it modifies the calibration threshold so that it reflects the test mixture rather than the pooled calibration mixture (Wang et al., 5 Jun 2025). In multiclass calibration, it may leave the conformal set unchanged but adapt how probability mass is distributed inside the set (Kotelevskii et al., 21 May 2025).

2. Mechanisms of adaptivity

A central ACP mechanism is online adjustment of the effective miscoverage level. In motion planning among dynamic agents, the update is

$\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$

where $e_t$ indicates whether the current uncertainty set missed the realized trajectory error (Dixit et al., 2022). In safe reinforcement learning, an analogous update appears as

$\alpha_{k+1} = \alpha_k + \delta(\alpha^c - e_k),$

with $e_k$ determined by whether the current conformal interval covers the barrier-related residual (Zhou et al., 22 Mar 2025). In Adaptive Quantum Conformal Prediction, the update is

$$\alpha_{i+1}=\alpha_i+\gamma(\alpha-\mathrm{err}_i),$$

and the resulting long-run empirical miscoverage converges almost surely to the target $q_\alpha$0 under arbitrary hardware noise conditions (Spencer et al., 23 Nov 2025).

A second mechanism is input-conditioned calibration. In “Adaptive Coverage Policies in Conformal Prediction,” the fixed global level is replaced by a learned policy

$q_\alpha$1

which outputs

$q_\alpha$2

from the sum of calibration scores and a test statistic (Gauthier et al., 5 Oct 2025). In localized ACP by reweighting nonconformity scores, the conditional residual distribution is estimated by

$q_\alpha$3

so the interval width depends on the test feature vector through QRF weights (Amoukou et al., 2023). In “On training locally adaptive CP,” the conformity score itself is transformed by an object-dependent map

$q_\alpha$4

which preserves marginal validity when $q_\alpha$5 is strictly increasing and all $q_\alpha$6 share the same codomain (Colombo, 2023).

A third mechanism is shift-aware reweighting or grouping. Under unknown subpopulation shifts, the threshold is chosen by

$q_\alpha$7

where $q_\alpha$8 estimates the test mixture over latent domains (Wang et al., 5 Jun 2025). In Audited Conformal Prediction, a small labeled target sample is used to train an auxiliary audit model $q_\alpha$9 that predicts where a legacy classifier is likely to fail, and this audit signal is then integrated either into standard split conformal calibration or into a group-conditional conformal construction over audit-defined groups (Zhou et al., 12 Jun 2026).

A fourth mechanism is post-hoc probabilistic calibration on top of conformal sets. In ATS-CP, the conformal set remains the anchor, but an input-specific temperature $\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$0 is chosen so that

$\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$1

This makes the threshold or set mass depend on the input in the ACP spirit while preserving the original set-valued conformal guarantee (Kotelevskii et al., 21 May 2025).

3. Validity targets and theoretical guarantees

ACP does not have a single universal guarantee; instead, the target validity notion depends on the construction. The most basic guarantee remains the split-conformal marginal coverage statement

$\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$2

or its multiclass analogue $\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$3 (Kotelevskii et al., 21 May 2025, Octadion et al., 13 May 2026). Several ACP methods retain this finite-sample marginal guarantee exactly because they alter the score geometry, the local quantile, or the threshold selection without changing the exchangeability argument at calibration time (Amoukou et al., 2023, Colombo, 2023, Su et al., 2 Mar 2026).

A more ambitious target is training-conditional or PAC-style validity. The QRF-based localized method adds a second calibration stage and states

$\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$4

thereby strengthening marginal validity to a probably approximately correct training-conditional guarantee (Amoukou et al., 2023). The same paper also proves asymptotic conditional coverage under continuity and forest regularity assumptions: $\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$5 (Amoukou et al., 2023).

In nonexchangeable or sequential settings, ACP often targets long-run average coverage rather than fixed-sample exchangeability-based validity. For one-step prediction among dynamic agents, the average coverage theorem is

$\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$6

with $\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$7 as $\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$8 (Dixit et al., 2022). In Adaptive Quantum Conformal Prediction, the long-run miscoverage satisfies

$\Pr\bigl(Y_*\in C_\alpha(X_*)\bigr)\ge 1-\alpha$9

under arbitrary hardware noise (Spencer et al., 23 Nov 2025). In two-stage sequential models, the adaptive extension preserves the standard long-run ACI guarantee

$X$0

while adapting stage-wise residual contributions (Zhang et al., 6 Oct 2025). CP-Traj likewise guarantees long-term coverage for any admissible $X$1 when $X$2 (Li et al., 18 Aug 2025).

Other ACP variants explicitly target group-conditional or audited conditional performance. Audited Conformal Prediction gives the bound

$X$3

which approaches the target as the audit model converges to the oracle reliability function (Zhou et al., 12 Jun 2026). By contrast, the medical-image ACP paper is explicit that true distribution-free stratum-level guarantees are impossible in general without extra assumptions, so its Adaptive Lambda Criterion is presented as a practical safety heuristic rather than a theorem guaranteeing exact conditional coverage (Octadion et al., 13 May 2026).

4. Major methodological families

Several recurring ACP constructions can be distinguished in the recent literature.

Family	Representative mechanism	Representative papers
Localized or reweighted ACP	QRF weights, local c.d.f., groupwise conformalization	(Amoukou et al., 2023)
Score-space adaptive ACP	Object-dependent transformation $X$4	(Colombo, 2023)
Policy-based or e-value ACP	Learned $X$5 from calibration summary and test statistic	(Gauthier et al., 5 Oct 2025)
Post-hoc conformal-calibration hybrids	Input-specific temperature constrained by conformal mass	(Kotelevskii et al., 21 May 2025)
Shift-aware and audited ACP	Mixture-aware weighting, similarity filtering, audit groups	(Wang et al., 5 Jun 2025, Zhou et al., 12 Jun 2026)
Geometry-learning ACP for regression	Jointly optimized center $X$6 and radius $X$7 with split-conformal normalization	(Su et al., 2 Mar 2026)

In the localized/reweighted family, ACP estimates the distribution of nonconformity scores conditional on features and uses local weights to determine a test-point-dependent quantile. The QRF construction is notable because it supports finite-sample marginal validity, training-conditional coverage, and asymptotic conditional coverage, while also exploiting RF-induced partitions for computational savings (Amoukou et al., 2023).

In the score-space adaptive family, the calibration sample is not reweighted; instead, the conformity score is changed through a monotone object-dependent transformation. Because the transformed scores remain exchangeable, the method preserves the usual conformal rank argument while producing $X$8-dependent interval widths (Colombo, 2023).

In the coverage-policy family, adaptivity is moved to the coverage level itself. The e-value-based coverage policy paper shows that adaptive $X$9 can be made valid post hoc by replacing classical p-values with e-values, and it trains the policy by leave-one-out pseudo episodes with the objective

$\alpha$0

(Gauthier et al., 5 Oct 2025).

In hybrid classification methods, the conformal set remains intact but additional adaptive structure is overlaid on top. ATS-CP is explicit that it is not a new set-construction rule that changes the coverage theorem; it is a post-hoc probabilistic reinterpretation of conformal outputs. Its $\alpha$1-adaptive quantile variants are directly in the ACP family because they use input-dependent thresholds $\alpha$2, while the input-specific temperature $\alpha$3 further adapts the probability calibration inside the set (Kotelevskii et al., 21 May 2025).

In adaptive interval-geometry methods for regression, CoCP goes beyond calibrating a fixed center by alternating between learning a radius through folded quantile regression and refining the center with a soft-coverage objective. It then applies split conformal with normalized score

$\alpha$4

and outputs

$\alpha$5

retaining finite-sample marginal validity while asymptotically approaching the length-minimizing conditional interval under the stated regularity conditions (Su et al., 2 Mar 2026).

5. Applications and empirical record

ACP has been adopted in safety-critical control, sequential forecasting, medical image classification, distribution-shifted vision and language, and quantum machine learning. In motion planning among dynamic agents, ACP constructs multistep trajectory uncertainty sets from delayed prediction errors and tightens model-predictive-control constraints by a Lipschitz safety margin (Dixit et al., 2022). In safe POMDP online planning among multiple pedestrians, ACP-based trajectory regions are turned into unsafe-state sets, winning regions, and a shield for POMCP; the reported safety rate improves from $\alpha$6 to $\alpha$7 on ETH with $\alpha$8, from $\alpha$9 to $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$0 on Hotel with $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$1, and from $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$2 to $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$3 on GC with $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$4, with average planning time per step increasing from $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$5 s to $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$6 s (Sheng et al., 2024).

In safe reinforcement learning, ACP is used to quantify uncertainty directly on a control-barrier-function surrogate rather than on the raw dynamics output. The resulting ACP safety margin enforces

$\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$7

so the predicted barrier value must exceed the calibrated uncertainty radius before a control is accepted (Zhou et al., 22 Mar 2025). The simulations on a mobile robot and an inverted pendulum report that MPPI and MPPI-CBF can violate safety, while MPPI-CBF-ACP maintains safety across GP, RFF, and QFF surrogate models (Zhou et al., 22 Mar 2025).

In medical image classification, ACP appears as a stratified, safety-aware adaptation of RAPS. On OrganAMNIST, the proposed method achieves 95.72 percent global coverage with average set size 1.09 and at least 90 percent coverage across all strata, whereas standard size-optimized RAPS converges to near-deterministic behavior with stratified undercoverage on uncertain samples (Octadion et al., 13 May 2026). On PathMNIST, the same method reports 95.00% global coverage, average size 1.12, and worst-case stratum coverage 88.1% (Octadion et al., 13 May 2026). The same paper further reports quantitative Grad-CAM evidence that larger prediction sets correspond to more focused attention on ambiguous regions, with Spearman $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$8 and $\delta_{t+1}:=\delta_t+\gamma(\delta-e_t),$9 (Octadion et al., 13 May 2026).

In multiclass probability calibration, ATS-CP evaluates on a synthetic 10-class Gaussian mixture and on CIFAR-10, CIFAR-100, and TinyImageNet using ResNet-18 classifiers. The best reported synthetic result is ATS-CP-MAQ (MultiQR) with average CPSME around 0.0777, outperforming Platt scaling, isotonic regression, temperature scaling, Dirichlet scaling, and the base model (Kotelevskii et al., 21 May 2025). On image datasets, the reported mean ECE $e_t$0 values are approximately 4.59 for ATS-CP-AQ (prob), 3.49 for ATS-CP-GQ (prob), and 12.02 for ATS-CP-MAQ (prob, CondNF), compared with 22.42 for the contaminated base model and 22.30 for temperature scaling (Kotelevskii et al., 21 May 2025).

Under unknown subpopulation mixture shift, weighted ACP methods maintain coverage close to the target across many test environments and substantially reduce coverage variance relative to unweighted conformal prediction in vision and language tasks (Wang et al., 5 Jun 2025). In dynamic environments with unknown shifts, multi-model ACP extends adaptation from the conformal threshold to the model itself; SAMOCP is reported to produce smaller prediction sets than baselines, lower regret, coverage close to the target $e_t$1, and a higher fraction of useful singleton prediction sets on CIFAR-10C, CIFAR-100C, TinyImageNet-C, and synthetic image-shift data (Hajihashemi et al., 2024). In quantum machine learning, AQCP on an IBM quantum processor achieves target coverage levels and exhibits greater stability than quantum conformal prediction under time-varying hardware noise (Spencer et al., 23 Nov 2025).

6. Misconceptions, boundary cases, and neighboring frameworks

A recurring misconception is that ACP is a single algorithm. The literature instead uses the term for a design space. Some methods adapt the calibration quantile to the input, some update $e_t$2 online, some reweight calibration scores, some learn score transformations, and some use ACP only as one module inside a larger planning or decision system (Amoukou et al., 2023, Dixit et al., 2022, Gauthier et al., 5 Oct 2025). A closely related terminology also appears: one 2026 paper uses the initials ACP for Audited Conformal Prediction, a reliability-aware conformal framework for unknown distribution shift (Zhou et al., 12 Jun 2026).

A second misconception is that adaptivity automatically yields exact conditional coverage. The papers surveyed here do not make that claim in general. Several methods retain exact finite-sample marginal coverage; others provide training-conditional, PAC-style, asymptotic conditional, long-run average, or group-conditional guarantees under additional assumptions (Amoukou et al., 2023, Spencer et al., 23 Nov 2025, Zhou et al., 12 Jun 2026). The medical-imaging ACP paper is explicit that true distribution-free stratum-level guarantees are impossible in general without extra assumptions, and therefore frames its adaptive criterion as a practical safety heuristic (Octadion et al., 13 May 2026).

A third misconception is that ACP always changes the conformal set itself. ATS-CP is explicit that its probabilities are “calibrated probabilities for a conformal set,” not a replacement for the set. It preserves the conformal coverage guarantee because it does not alter the set construction; it only redistributes probability mass over labels while keeping the conformal set intact (Kotelevskii et al., 21 May 2025). The same paper also notes that aggregation in the $e_t$3-agnostic multi-quantile variants may not preserve a precise coverage interpretation as cleanly as the single-$e_t$4 procedure (Kotelevskii et al., 21 May 2025).

Finally, ACP intersects but does not coincide with several neighboring areas. CAP, for example, is best viewed as a general framework for online selective conformal prediction with FCR control rather than as a new ACP rule itself; its core novelty is calibration after adaptive selection, with exact selection-conditional coverage and FCR control, while adaptive conformal ideas enter mainly through the distribution-shift module CAP-DtACI (Bao et al., 2024). This suggests that ACP is increasingly functioning as an interface layer between conformal validity and broader requirements such as selective inference, online control, modular diagnostics, and legacy-model auditing.

Adaptive Conformal Prediction is therefore best understood not as a single theorem or algorithm, but as a broad methodological program: retain conformal validity at the level the setting permits, and use adaptive structure—locality, online feedback, shift awareness, or learned interval geometry—to reduce the mismatch between global guarantees and the actual heterogeneity of predictive uncertainty (Amoukou et al., 2023, Gauthier et al., 5 Oct 2025, Su et al., 2 Mar 2026).