REVIEW 1 cited by
Narrowest Significance Pursuit: inference for multiple change-points in linear models
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
We propose Narrowest Significance Pursuit (NSP), a general and flexible methodology for automatically detecting localised regions in data sequences which each must contain a change-point (understood as an abrupt change in the parameters of an underlying linear model), at a prescribed global significance level. NSP works with a wide range of distributional assumptions on the errors, and guarantees important stochastic bounds which directly yield exact desired coverage probabilities, regardless of the form or number of the regressors. In contrast to the widely studied "post-selection inference" approach, NSP paves the way for the concept of "post-inference selection". An implementation is available in the R package nsp (see https://CRAN.R-project.org/package=nsp ).
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.