Fetching the paper…
Reading the bibliography…
We propose a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure.
Eulerian graphs and related topics , volume 1
J. Fleischner and H. Fleischner · 1990
Earlier work this paper cites.
Nonlinear total variation based noise removal algorithms
L. Rudin, S. Osher, and E. Faterni · 1992
Earlier work this paper cites.
Introduction to graph theory , volume 2
D. B. West · 2001
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Sparsity and smoothness via the fused lasso
R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight · 2005
Earlier work this paper cites.
On total variation minimization and surface evolution using parametric maximum flows
A. Chambolle and J. Darbon · 2009
Earlier work this paper cites.
A note on the group lasso and a sparse group lasso
J. Friedman, T. Hastie, and R. Tibshirani · 2010
Earlier work this paper cites.
PyAMG: Algebraic multigrid solvers in Python v2.0, 2011
W. N. Bell, L. N. Olson, and J. B. Schroder · 2011
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Cited alongside, same era.
The university of florida sparse matrix collection
T. A. Davis and Y. Hu · 2011
Cited alongside, same era.
The solution path of the generalized lasso
R. J. Tibshirani and J. Taylor · 2011
Cited alongside, same era.
Smoothing proximal gradient method for general structured sparse regression
X. Chen, Q. Lin, S. Kim, J. G. Carbonell, E. P. Xing, et al · 2012
Cited alongside, same era.
An ADMM algorithm for a class of total variation regularized estimation problems
B. Wahlberg, S. Boyd, M. Annergren, and Y. Wang · 2012
Modular proximal optimization for multidimensional total-variation regularization
Á. Barbero and S. Sra · 2014
Later among the works it cites.
Fast and flexible ADMM algorithms for trend filtering
A. Ramdas and R. J. Tibshirani · 2014
Later among the works it cites.
False discovery rate smoothing
W. Tansey, O. Koyejo, R. A. Poldrack, and J. G. Scott · 2014
Later among the works it cites.
Parameter selection and pre-conditioning for a graph form solver
C. Fougner and S. Boyd · 2015
Closest in time.
A general analysis of the convergence of admm
R. Nishihara, L. Lessard, B. Recht, A. Packard, and M. I. Jordan · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A dynamic programming algorithm for the fused lasso and l 0-segmentation
N. A. Johnson · 2013
Cited alongside, same era.
Trend filtering on graphs
Y. Wang, J. Sharpnack, A. Smola, and R. J. Tibshirani · 2015
Closest in time.