Skip to content
AI News HubLIVE
Original source2 min read

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

Summary

This paper proposes non-parametric estimators KM-ARL and KM-ADD for evaluating average run length (ARL) and average detection delay (ADD) in quickest changepoint detection (QCD) under finite and irregular sequence lengths. By drawing an analogy between QCD and survival analysis, the method models detection probabilities under sequence truncation. The estimators are proven asymptotically unbiased except when extrapolation is required. Experiments show improved robustness and interpretability, with Python code provided.

SourcearXiv Machine LearningAuthor: Taiki Miyagawa, Akinori F. Ebihara
Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

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

[Submitted on 11 May 2026]

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

View a PDF of the paper titled Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis, by Taiki Miyagawa and 1 other authors

View PDF

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, offering ready-to-use implementations for practitioners.

Comments: Accepted to ICML 2026. GitHub: this https URL

Subjects:

Machine Learning (cs.LG); Information Theory (cs.IT); Statistics Theory (math.ST); Machine Learning (stat.ML)

Cite as: arXiv:2605.18798 [cs.LG]

(or arXiv:2605.18798v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2605.18798

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Taiki Miyagawa [view email] [v1] Mon, 11 May 2026 07:23:48 UTC (1,659 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis, by Taiki Miyagawa and 1 other authors

View PDF

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-05

Change to browse by:

cs cs.IT math math.IT math.ST stat stat.ML stat.TH

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

InvestorsAdvanced

Key points

  • Introduces KM-ARL and KM-ADD estimators to address ARL and ADD evaluation challenges in QCD with limited sequence lengths.
  • Analogizes QCD to survival analysis, using Kaplan-Meier estimation to model detection probabilities.
  • Proves asymptotic unbiasedness of the estimators unless extrapolation is needed.
  • Offers ready-to-use Python implementations, enhancing robustness and interpretability for model selection.

Highlights and analysis are generated automatically and may contain errors. Check the original source.

Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis | AI News Hub