The DFS Fused Lasso: Linear-Time Denoising over General Graphs

Abstract

The fused lasso, also known as (anisotropic) total variation denoising, is widely used for piecewise constant signal estimation with respect to a given undirected graph. The fused lasso estimate is highly nontrivial to compute when the underlying graph is large and has an arbitrary structure. But for a special graph structure, namely, the chain graph, the fused lasso---or simply, 1d fused lasso---can be computed in linear time. In this paper, we establish a surprising connection between the total variation of a generic signal defined over an arbitrary graph, and the total variation of this signal over a chain graph induced by running depth-first search (DFS) over the nodes of the graph. Specifically, we prove that for any signal, its total variation over the induced chain graph is no more than twice its total variation over the original graph. This connection leads to several interesting theoretical and computational conclusions. Denoting by $m$ and $n$ the number of edges and nodes, respectively, of the graph in question, our result implies that for an underlying signal with total variation $t$ over the graph, the fused lasso achieves a mean squared error rate of \smash{$t^{2/3}{n}^{-2/3}$}. Moreover, precisely the same mean squared error rate is achieved by running the 1d fused lasso on the induced chain graph from running DFS. Importantly, the latter estimator is simple and computationally cheap, requiring only $O(m)$ operations for constructing the DFS-induced chain and $O(n)$ operations for computing the 1d fused lasso solution over this chain. Further, for trees that have bounded max degree, the error rate of \smash{$t^{2/3}{n}^{-2/3}$} cannot be improved, in the sense that it is the minimax rate for signals that have total variation $t$ over the tree.

References in corpus (4)

• Properties and refinements of the fused lasso
• Optimal rates for total variation denoising
• Total Variation Classes Beyond 1d: Minimax Rates, and the Limitations of Linear Smoothers
• Approximate Recovery in Changepoint Problems, from ${\ell }_2$ Estimation Error Rates

Cited by in corpus (23)

• Testing Network Structure Using Relations Between Small Subgraph Probabilities
• Data-driven Thresholding in Denoising with Spectral Graph Wavelet Transform
• Rank-one Convexification for Sparse Regression
• Sparse and Smooth Signal Estimation: Convexification of L0 Formulations
• Synthesis and analysis in total variation regularization
• Mask-GVAE: Blind Denoising Graphs via Partition
• Approximate $l_0$-penalized estimation of piecewise-constant signals on graphs
• T-LoHo: A Bayesian Regularization Model for Structured Sparsity and Smoothness on Graphs
• Logistic regression with total variation regularization
• Large Graph Signal Denoising with Application to Differential Privacy
• Adaptive Non-Parametric Regression With the $K$-NN Fused Lasso
• Parallel Cut Pursuit For Minimization of the Graph Total Variation
• An Optimal Reduction of TV-Denoising to Adaptive Online Learning
• Graph signal denoising using $t$-shrinkage priors
• Oracle inequalities for square root analysis estimators with application to total variation penalties
• A causal fused lasso for interpretable heterogeneous treatment effects estimation
• Optimal partition recovery in general graphs
• Graphon estimation via nearest neighbor algorithm and 2D fused lasso denoising
• Total Variation Regularized Tensor-on-scalar Regression
• On Structured Filtering-Clustering: Global Error Bound and Optimal First-Order Algorithms
• Tree-Projected Gradient Descent for Estimating Gradient-Sparse Parameters on Graphs
• Fused Spatial Point Process Intensity Estimation with Varying Coefficients on Complex Constrained Domains
• Distributed Cartesian Power Graph Segmentation for Graphon Estimation