Pith. sign in

REVIEW 1 cited by

High-dimensional, multiscale online changepoint detection

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

arxiv 2003.03668 v2 pith:ZBQISTAE submitted 2020-03-07 stat.ME math.STstat.COstat.MLstat.TH

classification stat.MEmath.STstat.COstat.MLstat.TH
keywords onlinechangechangepointdatadetectionhigh-dimensionalmeanprocedure
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We introduce a new method for high-dimensional, online changepoint detection in settings where a $p$-variate Gaussian data stream may undergo a change in mean. The procedure works by performing likelihood ratio tests against simple alternatives of different scales in each coordinate, and then aggregating test statistics across scales and coordinates. The algorithm is online in the sense that both its storage requirements and worst-case computational complexity per new observation are independent of the number of previous observations; in practice, it may even be significantly faster than this. We prove that the patience, or average run length under the null, of our procedure is at least at the desired nominal level, and provide guarantees on its response delay under the alternative that depend on the sparsity of the vector of mean change. Simulations confirm the practical effectiveness of our proposal, which is implemented in the R package 'ocd', and we also demonstrate its utility on a seismology data set.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Non-Stationary Dynamic Pricing: Adaptivity and Optimality

    stat.ML 2026-07 conditional novelty 7.0 of 10

    An adaptive dynamic-pricing algorithm achieves, up to logarithmic factors, the minimax optimal regret for both abrupt and smooth non-stationarity in contextual GLM demand, and comes with a matching lower bound.

Pith tools