Estimation of high-dimensional change-points under a group sparsity structure

07/19/2021
by   Hanqing Cai, et al.
0

Change-points are a routine feature of 'big data' observed in the form of high-dimensional data streams. In many such data streams, the component series possess group structures and it is natural to assume that changes only occur in a small number of all groups. We propose a new change point procedure, called 'groupInspect', that exploits the group sparsity structure to estimate a projection direction so as to aggregate information across the component series to successfully estimate the change-point in the mean structure of the series. We prove that the estimated projection direction is minimax optimal, up to logarithmic factors, when all group sizes are of comparable order. Moreover, our theory provide strong guarantees on the rate of convergence of the change-point location estimator. Numerical studies demonstrates the competitive performance of groupInspect in a wide range of settings and a real data example confirms the practical usefulness of our procedure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2020

Optimal multiple change-point detection for high-dimensional data

This manuscript makes two contributions to the field of change-point det...
research
06/18/2023

SpreadDetect: Detection of spreading change in a network over time

Change-point analysis has been successfully applied to the detect change...
research
08/03/2021

High-dimensional changepoint estimation with heterogeneous missingness

We propose a new method for changepoint estimation in partially-observed...
research
06/07/2023

Efficient sparsity adaptive changepoint estimation

We propose a new, computationally efficient, sparsity adaptive changepoi...
research
07/19/2022

A unified framework for change point detection in high-dimensional linear models

In recent years, change point detection for high dimensional data has be...
research
01/15/2020

Detecting Changes in the Second Moment Structure of High-Dimensional Sensor-Type Data in a K-Sample Setting

The K sample problem for high-dimensional vector time series is studied,...
research
07/10/2017

An Interactive Greedy Approach to Group Sparsity in High Dimension

Sparsity learning with known grouping structures has received considerab...

Please sign up or login with your details

Forgot password? Click here to reset