# Change detection with conformal martingales: new optimal constructions, and suboptimality of existing methods

arXiv: https://arxiv.org/abs/2609.27179 · HTML: https://mlsanity.com/paper/2609.27179/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 36 references that are in the map.
- First posted on arXiv 23 Sep 2026.

## Builds on (most cited first, 2 of 2)

- [Online Kernel CUSUM for Change-Point Detection](https://mlsanity.com/paper/2211.15070/) (2022)
- [A complete characterization of sequential testability and change detectability in i.i.d. models](https://mlsanity.com/paper/2609.05752/) (2026)

## Built on by (most cited first, 1 of 1)

- [The Premise Is the Problem: Exchangeability Failure in Self-Monitored Test-Time Adaptation](https://mlsanity.com/paper/2610.07038/) (2026)

## Abstract (arXiv)

We study distribution-free sequential changepoint detection for independent observations with unknown and unrestricted pre- and post-change laws. We build on the conformal test martingales and associated e-detectors of Vovk(2021), which control the probability of false alarm (PFA) and the average run length (ARL) respectively. The majority of these works focus on validity, with statistical efficiency usually left for simulations. We develop a comprehensive theory of how conformal p-values behave under non-exchangeable data with a changepoint at an unknown time T. We use this to analyze the post-change growth and resulting detection delay of conformal martingale methods, and prove that the standard existing methods are suboptimal for PFA and ARL control, and can lead to delays that are Omega(T) and Omega(√ARL) respectively. We propose different conformal e-processes and e-detectors that are provably minimax optimal, with delays Theta(log T) and Theta(log ARL) respectively, and have much shorter delays in simulations.