REVIEW 1 cited by
Optimal multiple change-point detection for high-dimensional 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
read the original abstract
This manuscript makes two contributions to the field of change-point detection. In a generalchange-point setting, we provide a generic algorithm for aggregating local homogeneity testsinto an estimator of change-points in a time series. Interestingly, we establish that the errorrates of the collection of tests directly translate into detection properties of the change-pointestimator. This generic scheme is then applied to various problems including covariance change-point detection, nonparametric change-point detection and sparse multivariate mean change-point detection. For the latter, we derive minimax optimal rates that are adaptive to theunknown sparsity and to the distance between change-points when the noise is Gaussian. Forsub-Gaussian noise, we introduce a variant that is optimal in almost all sparsity regimes.
Forward citations
Cited by 1 Pith paper
-
At the edge of Donsker's Theorem: Asymptotics of multiscale scan statistics
Replacing the additive penalty in multiscale scan tests by a multiplicative weighting yields critical values that are asymptotically valid for sub-Gaussian noise, based on a new thresholded weak convergence result.
Discussion (0). Continue with ORCID to comment.