REVIEW 1 cited by
Backward CUSUM for Testing and Monitoring Structural Change with an Application to COVID-19 Pandemic Data
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Backward CUSUM for Testing and Monitoring Structural Change with an Application to COVID-19 Pandemic Data
read the original abstract
It is well known that the conventional cumulative sum (CUSUM) test suffers from low power and large detection delay. In order to improve the power of the test, we propose two alternative statistics. The backward CUSUM detector considers the recursive residuals in reverse chronological order, whereas the stacked backward CUSUM detector sequentially cumulates a triangular array of backwardly cumulated residuals. A multivariate invariance principle for partial sums of recursive residuals is given, and the limiting distributions of the test statistics are derived under local alternatives. In the retrospective context, the local power of the tests is shown to be substantially higher than that of the conventional CUSUM test if a break occurs in the middle or at the end of the sample. When applied to monitoring schemes, the detection delay of the stacked backward CUSUM is found to be much shorter than that of the conventional monitoring CUSUM procedure. Furthermore, we propose an estimator of the break date based on the backward CUSUM detector and show that in monitoring exercises this estimator tends to outperform the usual maximum likelihood estimator. Finally, an application of the methodology to COVID-19 data is presented.
Forward citations
Cited by 1 Pith paper
-
focus and focus-cpt: Fast Online Changepoint Detection in R and Python
A single R/Python package now implements the focus family of exact online changepoint detectors, with convex-hull pruning and a claimed per-iteration cost of O(log(n)^d) for d-dimensional data.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.