The DFS Fused Lasso: Linear-Time Denoising over General Graphs
From MaRDI portal
Publication:4558501
zbMath1471.62421arXiv1608.03384MaRDI QIDQ4558501
James G. Scott, Ryan J. Tibshirani, Oscar-Hernan Madrid-Padilla, James Sharpnack
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1608.03384
Ridge regression; shrinkage estimators (Lasso) (62J07) Applications of graph theory (05C90) Probabilistic graphical models (62H22)
Related Items
Graph signal denoising using \(t\)-shrinkage priors, Horseshoe shrinkage methods for Bayesian fusion estimation, Block-Wise Variable Selection for Clustering Via Latent States of Mixture Models, Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising, Unnamed Item, Quantile regression by dyadic CART, Data-driven Thresholding in Denoising with Spectral Graph Wavelet Transform, Logistic regression with total variation regularization, Unnamed Item, Sparse spatially clustered coefficient model via adaptive regularization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- On the prediction performance of the Lasso
- Wavelets on graphs via spectral graph theory
- The solution path of the generalized lasso
- Properties and refinements of the fused Lasso
- On total variation minimization and surface evolution using parametric maximum flows
- Locally adaptive regression splines
- On stepwise pattern recovery of the fused Lasso
- Minimax estimation via wavelet shrinkage
- Local extremes, runs, strings and multiresolution. (With discussion)
- Some remarks on distributed depth-first search.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Adaptive piecewise polynomial estimation via trend filtering
- Diffusion wavelets
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Total Variation on a Tree
- On the approximation of curves by line segments using dynamic programming
- Lower-Stretch Spanning Trees
- Sparsity and Smoothness Via the Fused Lasso
- Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs
- Multiple Change-Point Estimation With a Total Variation Penalty
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
- Learning Theory and Kernel Machines
- Using petal-decompositions to build a low stretch spanning tree
- Learning Theory
- Introduction to nonparametric estimation
