Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis

arXiv cs.LG Papers

Summary

The paper proposes non-parametric estimators KM-ARL and KM-ADD for evaluating changepoint detectors under finite and irregular sequence lengths, drawing an analogy between QCD and survival analysis.

arXiv:2605.18798v1 Announce Type: new Abstract: We propose non-parametric estimators for the average run length (ARL) and average detection delay (ADD) in quickest changepoint detection (QCD) under finite and irregular sequence lengths. Although ARL and ADD are widely used as optimality criteria in theoretical and simulation studies, their application to real-world datasets is hindered by limited and irregular sequence lengths. To address this issue, we propose non-parametric estimators for the ARL and ADD, termed KM-ARL and KM-ADD, by drawing an analogy between QCD and survival analysis to model detection probabilities under sequence truncation. We derive estimation bias bounds and prove that they are asymptotically unbiased unless extrapolation is required. Experiments on simulated and real-world datasets demonstrate their practical utility, enhancing robustness against limited and irregular sequence lengths, improving interpretability, and facilitating empirical, intuitive model selection. Our Python code is provided at https://github.com/TaikiMiyagawa/Kaplan-Meier-Average-Run-Length, offering ready-to-use implementations for practitioners.
Original Article
View Cached Full Text

Cached at: 05/20/26, 08:35 AM

# Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis
Source: [https://arxiv.org/abs/2605.18798](https://arxiv.org/abs/2605.18798)
[View PDF](https://arxiv.org/pdf/2605.18798)

> Abstract:We propose non\-parametric estimators for the average run length \(ARL\) and average detection delay \(ADD\) in quickest changepoint detection \(QCD\) under finite and irregular sequence lengths\. Although ARL and ADD are widely used as optimality criteria in theoretical and simulation studies, their application to real\-world datasets is hindered by limited and irregular sequence lengths\. To address this issue, we propose non\-parametric estimators for the ARL and ADD, termed KM\-ARL and KM\-ADD, by drawing an analogy between QCD and survival analysis to model detection probabilities under sequence truncation\. We derive estimation bias bounds and prove that they are asymptotically unbiased unless extrapolation is required\. Experiments on simulated and real\-world datasets demonstrate their practical utility, enhancing robustness against limited and irregular sequence lengths, improving interpretability, and facilitating empirical, intuitive model selection\. Our Python code is provided at[this https URL](https://github.com/TaikiMiyagawa/Kaplan-Meier-Average-Run-Length), offering ready\-to\-use implementations for practitioners\.

## Submission history

From: Taiki Miyagawa \[[view email](https://arxiv.org/show-email/ca4d58af/2605.18798)\] **\[v1\]**Mon, 11 May 2026 07:23:48 UTC \(1,659 KB\)

Similar Articles