Online Jump and Kink Detection in Segmented Linear Regression: Statistical Optimality Meets Computational Efficiency

We consider the problem of sequential (online) estimation of a single change point in a piecewise linear regression model under a Gaussian setup. We demonstrate that certain CUSUM‐type statistics attain the minimax optimal rates for localizing the change point. Our minimax analysis unveils an interesting phase transition from a jump (discontinuity in function values) to a kink (a change in slope). Specifically, for a jump, the minimax rate is of order log(n)/n$$ \log (n)/n $$, whereas for a kink it scales as log(n)/n1/3$$ {\left(\log (n)/n\right)}^{1/3} $$, given that the sampling rate is of order 1/n$$ 1/n $$. We further introduce an online algorithm based on these detectors, which optimally identifies both a jump and a kink, and is able to distinguish between them. Notably, the algorithm operates with constant computational complexity and requires only constant memory per incoming sample. Finally, we evaluate the empirical performance of our method on both simulated and real‐world data sets. An implementation is available in the R package FLOC on GitHub.