Toby Dylan Hocking

Finite Sample Complexity Analysis of Binary Segmentation

Binary segmentation is the classic greedy algorithm which recursively splits a sequential data set by optimizing some loss or likelihood function. Binary segmentation is widely used for changepoint detection in data sets measured over space or time, and as a sub-routine for decis...