Fetching the paper…
Reading the bibliography…
We study recovery of piecewise-constant signals on graphs by the estimator minimizing an $l_0$-edge-penalized objective.
Estimating the current mean of a normal distribution which is subjected to changes in time
Herman Chernoff and Shelemyahu Zacks · 1964
Earlier work this paper cites.
Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
Stuart Geman and Donald Geman · 1984
Earlier work this paper cites.
Estimation of a noisy discrete-time step function: Bayes and empirical Bayes approaches
Yi-Ching Yao · 1984
Earlier work this paper cites.
Eigenvalues of the Laplacian of a graph
William N Anderson Jr and Thomas D Morley · 1985
Earlier work this paper cites.
On the statistical analysis of dirty pictures
Julian Besag · 1986
Earlier work this paper cites.
Estimating the number of change-points via Schwarz’ criterion
Yi-Ching Yao · 1988
Earlier work this paper cites.
Algorithms for the optimal identification of segment neighborhoods
Ivan E Auger and Charles E Lawrence · 1989
Earlier work this paper cites.
Exact maximum a posteriori estimation for binary images
Dorothy M Greig, Bruce T Porteous, and Allan H Seheult · 1989
Earlier work this paper cites.
Optimal approximations by piecewise smooth functions and associated variational problems
David Mumford and Jayant Shah · 1989
Earlier work this paper cites.
Least-squares estimation of a step function
Yi-Ching Yao and Siu-Tong Au · 1989
Earlier work this paper cites.
Nonlinear total variation based noise removal algorithms
Leonid I Rudin, Stanley Osher, and Emad Fatemi · 1992
Earlier work this paper cites.
A Bayesian analysis for change point problems
Daniel Barry and John A Hartigan · 1993
Earlier work this paper cites.
Minimax theory of image reconstruction
Aleksandr Petrovich Korostelev and Alexandre B Tsybakov · 1993
Earlier work this paper cites.
Random walks on graphs: A survey
Lovász L · 1993
Earlier work this paper cites.
Ideal spatial adaptation by wavelet shrinkage
David L Donoho and Iain M Johnstone · 1994
Earlier work this paper cites.
A new approach to the minimum cut problem
David R Karger and Clifford Stein · 1996
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Robert Tibshirani · 1996
Earlier work this paper cites.
Image recovery via total variation minimization and related problems
Antonin Chambolle and Pierre-Louis Lions · 1997
Earlier work this paper cites.
Variable fusion: A new adaptive signal regression method
Stephanie R Land and Jerome H Friedman · 1997
Earlier work this paper cites.
Locally adaptive regression splines
Enno Mammen and Sara van de Geer · 1997
Earlier work this paper cites.
Risk bounds for model selection via penalization
Andrew Barron, Lucien Birgé, and Pascal Massart · 1999
Earlier work this paper cites.
Wedgelets: Nearly minimax estimation of edges
David L Donoho · 1999
Earlier work this paper cites.
Epidemics and percolation in small-world networks
Cristopher Moore and Mark EJ Newman · 2000
Earlier work this paper cites.
Gaussian model selection
Lucien Birgé and Pascal Massart · 2001
Earlier work this paper cites.
Fast approximate energy minimization via graph cuts
Yuri Boykov, Olga Veksler, and Ramin Zabih · 2001
Earlier work this paper cites.
Atomic decomposition by basis pursuit
Scott Shaobing Chen, David L Donoho, and Michael A Saunders · 2001
Earlier work this paper cites.
Local extremes, runs, strings and multiresolution
P Laurie Davies and Arne Kovac · 2001
Cited alongside, same era.
Smoothers for discontinuous signals
Gerhard Winkler and Volkmar Liebscher · 2002
Cited alongside, same era.
An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
Yuri Boykov and Vladimir Kolmogorov · 2004
Cited alongside, same era.
Large-scale simultaneous hypothesis testing: the choice of a null hypothesis
Bradley Efron · 2004
Cited alongside, same era.
What energy functions can be minimized via graph cuts?
Vladimir Kolmogorov and Ramin Zabin · 2004
Cited alongside, same era.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A Spielman and Shang-Hua Teng · 2004
Cited alongside, same era.
Nonparametric regression on a graph
Arne Kovac and Andrew DAC Smith · 2011
Later among the works it cites.
Minimax rates of estimation for high-dimensional linear regression over ℓ q \ell_{q} -balls
Garvesh Raskutti, Martin J Wainwright, and Bin Yu · 2011
Later among the works it cites.
Graph sparsification by effective resistances
Daniel A Spielman and Nikhil Srivastava · 2011
Later among the works it cites.
The solution path of the generalized lasso
Ryan J Tibshirani and Jonathan Taylor · 2011
Later among the works it cites.
Optimal detection of changepoints with a linear computational cost
Rebecca Killick, Paul Fearnhead, and Idris A Eckley · 2012
Later among the works it cites.
Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver
Oren E Livne and Achi Brandt · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Near-optimal detection of geometric objects by fast multiscale methods
Ery Arias-Castro, David L Donoho, and Xiaoming Huo · 2005
Cited alongside, same era.
Total variation minimization and a class of binary MRF models
Antonin Chambolle · 2005
Cited alongside, same era.
A fast and exact algorithm for total variation minimization
Jérôme Darbon and Marc Sigelle · 2005
Cited alongside, same era.
An algorithm for optimal partitioning of data on an interval
Brad Jackson, Jeffrey D Scargle, et al · 2005
Cited alongside, same era.
Detecting multiple change-points in the mean of Gaussian process by model selection
Émilie Lebarbier · 2005
Cited alongside, same era.
Sparsity and smoothness via the fused lasso
Robert Tibshirani, Michael Saunders, Saharon Rosset, Ji Zhu, and Keith Knight · 2005
Cited alongside, same era.
Sparsistency of the edge lasso over graphs
James Sharpnack, Alessandro Rinaldo, and Aarti Singh · 2012
Later among the works it cites.
Cluster detection in networks using percolation
Ery Arias-Castro and Geoffrey R Grimmett · 2013
Later among the works it cites.
Near-optimal anomaly detection in graphs using lovasz extended scan statistic
James L Sharpnack, Akshay Krishnamurthy, and Aarti Singh · 2013
Later among the works it cites.
Detecting activations over graphs using spanning tree wavelet bases
James Sharpnack, Aarti Singh, and Alessandro Rinaldo · 2013
Later among the works it cites.
Efficient generalized fused lasso and its application to the diagnosis of Alzheimer’s disease
Bo Xin, Yoshinobu Kawahara, Yizhou Wang, and Wen Gao · 2014
Later among the works it cites.
Lower bounds on the performance of polynomial-time algorithms for sparse linear regression
Yuchen Zhang, Martin J Wainwright, and Michael I Jordan · 2014
Later among the works it cites.
Gaussian estimation: Sequence and wavelet models
Iain Johnstone · 2015
Later among the works it cites.
A fast and flexible algorithm for the graph-fused lasso
Wesley Tansey and James G Scott · 2015
Later among the works it cites.
Selective inference with a randomized response
Xiaoying Tian and Jonathan E Taylor · 2015
Later among the works it cites.
Prediction error after model search
Xiaoying Tian Harris · 2016
Later among the works it cites.
The DFS fused lasso: nearly optimal linear-time denoising over graphs and trees
Oscar Hernan Madrid Padilla, James G Scott, James Sharpnack, and Ryan J Tibshirani · 2016
Later among the works it cites.
Optimal rates for total variation denoising
Jan-Christian Hütter and Philippe Rigollet · 2016
Later among the works it cites.
Approximate recovery in changepoint problems, from ℓ 2 \ell_{2} estimation error rates
Kevin Lin, James Sharpnack, Alessandro Rinaldo, and Ryan J Tibshirani · 2016
Later among the works it cites.
Total variation classes beyond 1d: Minimax rates, and the limitations of linear smoothers
Veeranjaneyulu Sadhanala, Yu-Xiang Wang, and Ryan J Tibshirani · 2016
Later among the works it cites.
Graph sparsification approaches for Laplacian smoothing
Veeru Sadhanala, Yu-Xiang Wang, and Ryan Tibshirani · 2016
Later among the works it cites.
Trend filtering on graphs
Yu-Xiang Wang, James Sharpnack, Alex Smola, and Ryan J Tibshirani · 2016
Later among the works it cites.
On the prediction performance of the Lasso
Arnak S Dalalyan, Mohamed Hebiri, and Johannes Lederer · 2017
Closest in time.
Spatial adaptation in trend filtering
Adityanand Guntuboyina, Donovan Lieu, Sabyasachi Chatterjee, and Bodhisattva Sen · 2017
Closest in time.
Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators
Yuchen Zhang, Martin J Wainwright, and Michael I Jordan · 2017
Closest in time.