On change point detection using the fused lasso method

Abstract

In this paper we analyze the asymptotic properties of l1 penalized maximum likelihood estimation of signals with piece-wise constant mean values and/or variances. The focus is on segmentation of a non-stationary time series with respect to changes in these model parameters. This change point detection and estimation problem is also referred to as total variation denoising or l1 -mean filtering and has many important applications in most fields of science and engineering. We establish the (approximate) sparse consistency properties, including rate of convergence, of the so-called fused lasso signal approximator (FLSA). We show that this only holds if the sign of the corresponding consecutive changes are all different, and that this estimator is otherwise incapable of correctly detecting the underlying sparsity pattern. The key idea is to notice that the optimality conditions for this problem can be analyzed using techniques related to brownian bridge theory.

Cited by in corpus (9)

• A Class of Nonconvex Penalties Preserving Overall Convexity in Optimization-Based Mean Filtering
• Optimal Covariance Change Point Localization in High Dimension
• Statistically and Computationally Efficient Change Point Localization in Regression Settings
• Approximate Recovery in Changepoint Problems, from ${\ell }_2$ Estimation Error Rates
• Bayesian Fused Lasso regression for dynamic binary networks
• Element-wise estimation error of a total variation regularized estimator for change point detection
• ABM: an automatic supervised feature engineering method for loss based models based on group and fused lasso
• How to monitor and mitigate stair-casing in l1 trend filtering
• Robust Structured Statistical Estimation via Conditional Gradient Type Methods