Post-detection inference for sequential changepoint localization

Aytijhya Saha

doi:10.1093/jrsssb/qkag069

Return

Post-detection inference for sequential changepoint localization

2026-04-27

PRE

Aytijhya Saha *

Aaditya Ramdas

DOI：10.1093/jrsssb/qkag069

Original

Original request for help

Save

Abstract

En 中文

This article addresses a fundamental but largely unexplored challenge in sequential changepoint analysis: conducting inference following a detected change. We develop a very general framework to construct confidence sets for the unknown changepoint using only the data observed up to a data-dependent stopping time at which an arbitrary sequential detection algorithm declares a change. Our framework is nonparametric, making no assumption on the composite postchange class, the observation space, or the sequential detection procedure used, and is nonasymptotically valid. We also extend it to handle composite prechange classes under a suitable assumption and also derive confidence sets for the change magnitude in parametric settings. We provide theoretical guarantees on the width of our confidence intervals. Extensive simulations demonstrate that the produced sets have reasonable size, and slightly conservative coverage. In summary, we present the first general method for sequential changepoint localization, which is theoretically sound and broadly applicable in practice.

Keywords:

sequential changepoint analysis

post-detection inference

confidence sets

data-dependent stopping time

nonparametric framework