Seeded binary segmentation: a general methodology for fast and optimal changepoint detection
We propose seeded binary segmentation for large-scale changepoint detection problems.
We construct a deterministic set of background intervals, called seeded intervals, in which …
We construct a deterministic set of background intervals, called seeded intervals, in which …
A review on minimax rates in change point detection and localisation
Y Yu - arxiv preprint arxiv:2011.01857, 2020 - arxiv.org
This paper reviews recent developments in fundamental limits and optimal algorithms for
change point analysis. We focus on minimax optimal rates in change point detection and …
change point analysis. We focus on minimax optimal rates in change point detection and …
Random forests for change point detection
We propose a novel multivariate nonparametric multiple change point detection method
using classifiers. We construct a classifier log-likelihood ratio that uses class probability …
using classifiers. We construct a classifier log-likelihood ratio that uses class probability …
Change-point detection for graphical models in the presence of missing values
We propose estimation methods for change points in high-dimensional covariance
structures with an emphasis on challenging scenarios with missing values. We advocate …
structures with an emphasis on challenging scenarios with missing values. We advocate …
A variational view on statistical multiscale estimation
We present a unifying view on various statistical estimation techniques including
penalization, variational, and thresholding methods. These estimators are analyzed in the …
penalization, variational, and thresholding methods. These estimators are analyzed in the …
Optimal multiple change-point detection for high-dimensional data
E Pilliat, A Carpentier, N Verzelen - Electronic Journal of Statistics, 2023 - projecteuclid.org
This manuscript makes two contributions to the field of change-point detection. In a general
change-point setting, we provide a generic algorithm for aggregating local homogeneity …
change-point setting, we provide a generic algorithm for aggregating local homogeneity …
High-dimensional changepoint estimation with heterogeneous missingness
We propose a new method for changepoint estimation in partially observed, high-
dimensional time series that undergo a simultaneous change in mean in a sparse subset of …
dimensional time series that undergo a simultaneous change in mean in a sparse subset of …
Detection and inference of changes in high-dimensional linear regression with non-sparse structures
For data segmentation in high-dimensional linear regression settings, the regression
parameters are often assumed to be sparse segment-wise, which enables many existing …
parameters are often assumed to be sparse segment-wise, which enables many existing …
Efficient Multiple Change Point Detection and Localization For High-Dimensional Quantile Regression with Heteroscedasticity
X Wang, B Liu, X Zhang, Y Liu - Journal of the American Statistical …, 2024 - Taylor & Francis
Data heterogeneity is a challenging issue for modern statistical data analysis. There are
different types of data heterogeneity in practice. In this article, we consider potential …
different types of data heterogeneity in practice. In this article, we consider potential …
Graphical elastic net and target matrices: Fast algorithms and software for sparse precision matrix estimation
S Kovács, T Ruckstuhl, H Obrist… - arxiv preprint arxiv …, 2021 - arxiv.org
We consider estimation of undirected Gaussian graphical models and inverse covariances
in high-dimensional scenarios by penalizing the corresponding precision matrix. While …
in high-dimensional scenarios by penalizing the corresponding precision matrix. While …