Abstract

We study change point detection and localization for univariate data in fully nonparametric settings, in which at each time point, we acquire an independent and identically distributed sample from an unknown distribution that is piecewise constant. The magnitude of the distributional changes at the change points is quantified using the Kolmogorov–Smirnov distance. Our framework allows all the relevant parameters, namely the minimal spacing between two consecutive change points, the minimal magnitude of the changes in the Kolmogorov–Smirnov distance, and the number of sample points collected at each time point, to change with the length of the time series. We propose a novel change point detection algorithm based on the Kolmogorov–Smirnov statistic and show that it is nearly minimax rate optimal. Our theory demonstrates a phase transition in the space of model parameters. The phase transition separates parameter combinations for which consistent localization is possible from the ones for which this task is statistically infeasible. We provide extensive numerical experiments to support our theory.

Highlights

  • (2021), has investigated scenarios where covariance matrices change

  • Padilla et al (2018) proposed an algorithm for nonparametric change point detection based on the Kolmogorov–Smirnov statistic

  • Celisse and Harchaoui (2019) considered a kernel version of the cumulative sum (CUSUM) statistic and an 0-type optimization procedure which can be solved by dynamic programming

Read more

Summary

Introduction

(2021), has investigated scenarios where covariance matrices change. Cribben and Yu (2017), Liu et al (2018) and Wang, Yu and Rinaldo (2018), among others, inspected dynamic network change point detection problems. Most of the existing theoretical frameworks for statistical analysis of change point problems, rely heavily on strong modelling assumptions of parametric nature. Such approaches may be inadequate to capture the inherent complexity of modern, high-dimensional datasets. Padilla et al (2018) proposed an algorithm for nonparametric change point detection based on the Kolmogorov–Smirnov statistic. Our notation and settings are fairly standard, with one crucial difference from most of the contributions in the field: the changes in the underlying distribution at the change points are not parametrically specified, but are instead quantified through a nonparametric measure of distance between distributions This feature renders our methods and analysis applicable to a wide range of change point problems.

Objectives
Methods
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call