Catching Change-points with Lasso

Céline Lévy‐Leduc, Zaïd Harchaoui

Neural Information Processing Systems · 2007 · 92 citations · 17 references

Concepts

Abstract

We propose a new approach for dealing with the estimation of the location of change-points in one-dimensional piecewise constant signals observed in white noise. Our approach consists in reframing this task in a variable selection context. We use a penalized least-squares criterion with a e1-type penalty for this purpose. We prove some theoretical results on the estimated change-points and on the underlying piecewise constant estimated function. Then, we explain how to implement this method in practice by combining the LAR algorithm and a reduced version of the dynamic programming algorithm and we apply it to synthetic and real data.

References

17