Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 19 min ago
PreprintCC BY 4.0arXiv

Monitoring for Shifts at Unknown Times: Parameter-Free Conditional Conformal Martingales

Abstract

Conditional conformal test martingales provide sequential tests for detecting distribution shifts, using a fixed reference dataset to avoid contamination from test-time samples. Prior work used a penalized betting function via online optimization with smoothing, clipping, and other hyperparameters, which can adapt slowly when a shift occurs after a long stationary period. In this work, we introduce an approach that requires no hyperparameters and provably adapts quickly to shifts occurring at unknown times. Our key idea is to frame the penalized betting problem as portfolio selection in a three-asset market. Then, we use a restarting universal portfolio, with a heavy-tailed wealth allocation over time. We establish anytime false-alarm control and derive optimal finite-sample bounds on detection delay under detectable alternatives. We also develop an FFT-based implementation that computes the portfolio sequence over T rounds in 𝒪(T2ln T) time, instead of 𝒪(T3) of the naive implementation. Synthetic and real-world experiments suggest that the proposed approach adapts rapidly after long periods of null samples, with detection delays depending substantially less on shift time than prior baselines.

Related

  1. Information-Geometric Blind Spots of Conformal Test Martingales
    Johan Hallberg Szabadváry
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Reference-Null Calibrated Thresholds for E-Processes with Applications to Conformal Martingales
    Yi Ding, Lan Wei, Xuehu Zhu +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Change detection with conformal martingales: new optimal constructions, and suboptimality of existing methods
    Swapnaneel Bhattacharyya, Aaditya Ramdas
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Continuous data assimilation in steady Navier-Stokes equations with unknown viscosity: robust and efficient solvers and fast parameter recovery
    L. Rebholz, J. Reyes, J. Whitehead
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsNumerical analysis & scientific computingarXiv
  5. Brown's loss function and estimation of the scale parameter and the entropy in scale mixture models with unknown location
    Stavros Kourouklis
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{liu2026monitoring,
  title = {{Monitoring for Shifts at Unknown Times: Parameter-Free Conditional Conformal Martingales}},
  author = {Tuo Liu and Drew Prinster and Francesco Orabona},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.17343},
  eprint = {2610.17343},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.17343},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Monitoring for Shifts at Unknown Times: Parameter-Free Conditional Conformal Martingales
AU  - Tuo Liu
AU  - Drew Prinster
AU  - Francesco Orabona
PY  - 2026
DA  - 2026/10/12
PB  - arXiv
DO  - 10.48550/arxiv.2610.17343
UR  - https://arxiv.org/abs/2610.17343
AB  - Conditional conformal test martingales provide sequential tests for detecting distribution shifts, using a fixed reference dataset to avoid contamination from test-time samples. Prior work used a penalized betting function via online optimization with smoothing, clipping, and other hyperparameters, which can adapt slowly when a shift occurs after a long stationary period. In this work, we introduce an approach that requires no hyperparameters and provably adapts quickly to shifts occurring at unknown times. Our key idea is to frame the penalized betting problem as portfolio selection in a three-asset market. Then, we use a restarting universal portfolio, with a heavy-tailed wealth allocation over time. We establish anytime false-alarm control and derive optimal finite-sample bounds on detection delay under detectable alternatives. We also develop an FFT-based implementation that computes the portfolio sequence over T rounds in 𝒪(T^2ln T) time, instead of 𝒪(T^3) of the naive implementation. Synthetic and real-world experiments suggest that the proposed approach adapts rapidly after long periods of null samples, with detection delays depending substantially less on shift time than prior baselines.
ER  -