Element-wise estimation error of a total variation regularized estimator for change point detection

01/03/2019
by   Teng Zhang, et al.
0

This work studies the total variation regularized ℓ_2 estimator (fused lasso) in the setting of a change point detection problem. Compared with existing works that focus on the sum of squared estimation errors, we give bound on the element-wise estimation error. Our bound is nearly optimal in the sense that the sum of squared error matches the best existing result, up to a logarithmic factor. This analysis of the element-wise estimation error allows a screening method that can approximately detect all the change points. We also generalize this method to the muitivariate setting, i.e., to the problem of group fused lasso.

READ FULL TEXT
research
03/08/2022

Element-wise Estimation Error of Generalized Fused Lasso

The main result of this article is that we obtain an elementwise error b...
research
06/21/2011

The group fused Lasso for multiple change-point detection

We present the group fused Lasso for detection of multiple change-points...
research
01/21/2014

On change point detection using the fused lasso method

In this paper we analyze the asymptotic properties of l1 penalized maxim...
research
07/26/2022

Variance estimation in graphs with the fused lasso

We study the problem of variance estimation in general graph-structured ...
research
01/31/2019

Probability of Error for Detecting a Change in a Parameter, Total Variation of the Posterior Distribution, and Bayesian Fisher Information

The van Trees inequality relates the Ensemble Mean Squared Error of an e...
research
08/06/2019

An Algorithm for Graph-Fused Lasso Based on Graph Decomposition

This work proposes a new algorithm for solving the graph-fused lasso (GF...
research
06/04/2018

On the total variation regularized estimator over a class of tree graphs

We generalize to tree graphs obtained by connecting path graphs an oracl...

Please sign up or login with your details

Forgot password? Click here to reset