Multiscale change point inference
420
TL;DR: A new estimator, the simultaneous multiscale change point estimator SMUCE, is introduced, which achieves the optimal detection rate of vanishing signals as n→∞, even for an unbounded number of change points.
read more
Abstract: Summary
We introduce a new estimator, the simultaneous multiscale change point estimator SMUCE, for the change point problem in exponential family regression. An unknown step function is estimated by minimizing the number of change points over the acceptance region of a multiscale test at a level α. The probability of overestimating the true number of change points K is controlled by the asymptotic null distribution of the multiscale test statistic. Further, we derive exponential bounds for the probability of underestimating K. By balancing these quantities, α will be chosen such that the probability of correctly estimating K is maximized. All results are even non-asymptotic for the normal case. On the basis of these bounds, we construct (asymptotically) honest confidence sets for the unknown step function and its change points. At the same time, we obtain exponential bounds for estimating the change point locations which for example yield the minimax rate up to a log-term. Finally, the simultaneous multiscale change point estimator achieves the optimal detection rate of vanishing signals as n∞, even for an unbounded number of change points. We illustrate how dynamic programming techniques can be employed for efficient computation of estimators and confidence regions. The performance of the multiscale approach proposed is illustrated by simulations and in two cutting edge applications from genetic engineering and photoemission spectroscopy.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Convergence of probability measures
Richard F. Bass
- 01 Jan 2011
TL;DR: Weakconvergence methods in metric spaces were studied in this article, with applications sufficient to show their power and utility, and the results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables.
4.1K
Selective review of offline change point detection methods
TL;DR: In this article, the authors present a selective survey of algorithms for the offline detection of multiple change points in multivariate time series, and a general yet structuring methodological strategy is adopted to organize this vast body of work.
953
Wild binary segmentation for multiple change-point detection
TL;DR: Wild binary segmentation (WBS) as discussed by the authors is a new technique for consistent estimation of the number and locations of multiple change-points in data, which does not require the choice of a window or span parameter and does not lead to a significant increase in computational complexity.
Wild binary segmentation for multiple change-point detection
TL;DR: Wild binary segmentation (WBS) as mentioned in this paper is a new technique for consistent estimation of the number and locations of multiple change-points in data, which does not require the choice of a window or span parameter and does not lead to a significant increase in computational complexity.
410
On optimal multiple changepoint algorithms for large data
TL;DR: Empirical results show that FPOP is substantially faster than existing dynamic programming methods, and unlike the existing methods its computational efficiency is robust to the number of changepoints in the data.
References
Controlling the false discovery rate: a practical and powerful approach to multiple testing
Yoav Benjamini,Yosef Hochberg +1 more
TL;DR: In this paper, a different approach to problems of multiple significance testing is presented, which calls for controlling the expected proportion of falsely rejected hypotheses -the false discovery rate, which is equivalent to the FWER when all hypotheses are true but is smaller otherwise.
Estimating the Dimension of a Model
TL;DR: In this paper, the problem of selecting one of a number of models of different dimensions is treated by finding its Bayes solution, and evaluating the leading terms of its asymptotic expansion.
De-noising by soft-thresholding
TL;DR: The authors prove two results about this type of estimator that are unprecedented in several ways: with high probability f/spl circ/*/sub n/ is at least as smooth as f, in any of a wide variety of smoothness measures.
10.2K
Ideal spatial adaptation by wavelet shrinkage
TL;DR: In this article, the authors developed a spatially adaptive method, RiskShrink, which works by shrinkage of empirical wavelet coefficients, and achieved a performance within a factor log 2 n of the ideal performance of piecewise polynomial and variable-knot spline methods.
Estimating and testing linear models with multiple structural changes
Jushan Bai,Pierre Perron +1 more
TL;DR: In this article, the authors developed the statistical theory for testing and estimating multiple change points in regression models, and several test statistics were proposed to determine the existence as well as the number of change points.
6.2K