2021
DOI: 10.1080/01621459.2020.1859380
|View full text |Cite
|
Sign up to set email alerts
|

Multiscale Quantile Segmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(10 citation statements)
references
References 60 publications
0
10
0
Order By: Relevance
“…To the best of our knowledge, Zou et al (2014) is one of very few examples yielding a procedure for nonparametric change point detection with provable guarantees on localization. A detailed comparison between our results and the ones of Zou et al (2014) will be given in Appendix A, which also includes detailed comparisons of our work with Pein, Sieling and Munk (2017), Vanegas, Behr and Munk (2019) and Garreau and Arlot (2018).…”
Section: Introductionmentioning
confidence: 88%
See 2 more Smart Citations
“…To the best of our knowledge, Zou et al (2014) is one of very few examples yielding a procedure for nonparametric change point detection with provable guarantees on localization. A detailed comparison between our results and the ones of Zou et al (2014) will be given in Appendix A, which also includes detailed comparisons of our work with Pein, Sieling and Munk (2017), Vanegas, Behr and Munk (2019) and Garreau and Arlot (2018).…”
Section: Introductionmentioning
confidence: 88%
“…Another interesting contrast can be made between the Kolmogorov-Smirnov detector and the multiscale quantile segmentation method in Vanegas, Behr and Munk (2019). Both algorithms make no assumptions on the distributional form of the cumulative distribution functions.…”
Section: Appendix A: Comparisonsmentioning
confidence: 99%
See 1 more Smart Citation
“…Next, we estimate K clusters from the obtained error scores. Multiscale quantile segmentation (MQS) is a way to partition the error scores into K clusters at K − 1 quantiles [15]. Here, we adopted MQS, denoted by J , to presumably identify pseudo error labels c i ∈ {1, • • • , K} mapped from e i , i.e.…”
Section: Self-supervised Mixture Of Expertsmentioning
confidence: 99%
“…Several efforts in this direction have been recently made for univariate data. Pein et al (2017) proposed a version of the SMUCE algorithm (Frick et al, 2014) that is sensitive to mean changes, but robust to changes in variance; Zou et al (2014) introduced a nonparametric estimator that can detect general distributions shifts; as an extension of Zou et al (2014), Haynes et al (2017) simplified the loss function in Zou et al (2014) and adopted the pruned exact linear time algorithm (Killick et al, 2012) to improve the computational efficiency; Padilla et al (2018) considered a nonparametric procedure for sequential change point detection; Fearnhead and Rigaill (2018) focused on univariate mean change point detection constructing an estimator that is robust to outliers; Jula Vanegas et al (2021) proposed an estimator for detecting changes in pre-specified quantiles of the generative model; and Padilla et al (2019) developed a nonparametric version of binary segmentation (e.g. Scott and Knott, 1974) based on the Kolmogorov-Smirnov statistic.…”
Section: Introductionmentioning
confidence: 99%