Pith. sign in

REVIEW 1 cited by

A Note on Online Change Point 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 2006.03283 v3 pith:6P465U4X submitted 2020-06-05 math.ST stat.TH

classification math.STstat.TH
keywords changedetectionmethodologypointalarmsallowapplicableaverage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We investigate sequential change point estimation and detection in univariate nonparametric settings, where a stream of independent observations from sub-Gaussian distributions with a common variance factor and piecewise-constant but otherwise unknown means are collected. We develop a simple CUSUM-based methodology that provably control the probability of false alarms or the average run length while minimizing, in a minimax sense, the detection delay. We allow for all the model parameters to vary in order to capture a broad range of levels of statistical hardness for the problem at hand. We further show how our methodology is applicable to the case in which multiple change points are to be estimated sequentially.

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