Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
From MaRDI portal
Publication:1990576
DOI10.1214/17-AOS1656zbMath1456.62052arXiv1703.01421MaRDI QIDQ1990576
Publication date: 25 October 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.01421
Related Items (8)
Graph signal denoising using \(t\)-shrinkage priors ⋮ Constrained energy variation for change point detection ⋮ Horseshoe shrinkage methods for Bayesian fusion estimation ⋮ Unnamed Item ⋮ Estimating piecewise monotone signals ⋮ Spatial heterogeneity automatic detection and estimation ⋮ Optimal change-point detection and localization ⋮ Multivariate extensions of isotonic regression and total variation denoising via entire monotonicity and Hardy-Krause variation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detecting multiple change-points in the mean of Gaussian process by model selection
- Nonlinear total variation based noise removal algorithms
- On the prediction performance of the Lasso
- Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators
- On combinatorial testing problems
- The solution path of the generalized lasso
- Minimax theory of image reconstruction
- Estimation of a noisy discrete-time step function: Bayes and empirical Bayes approaches
- Properties and refinements of the fused Lasso
- Searching for a trail of evidence in a maze
- Consistencies and rates of convergence of jump-penalized least squares estimators
- Estimating the number of change-points via Schwarz' criterion
- Algorithms for the optimal identification of segment neighborhoods
- Risk bounds for model selection via penalization
- Locally adaptive regression splines
- Image recovery via total variation minimization and related problems
- Wedgelets: Nearly minimax estimation of edges
- Selective inference with a randomized response
- Local extremes, runs, strings and multiresolution. (With discussion)
- On the conditions used to prove oracle results for the Lasso
- Cluster detection in networks using percolation
- Minimal penalties for Gaussian model selection
- Simultaneous analysis of Lasso and Dantzig selector
- Detection of an anomalous cluster in a network
- Atomic Decomposition by Basis Pursuit
- Optimal approximations by piecewise smooth functions and associated variational problems
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- The Split Bregman Method for L1-Regularized Problems
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Ideal spatial adaptation by wavelet shrinkage
- A new approach to the minimum cut problem
- Sparsity and Smoothness Via the Fused Lasso
- A Bayesian Analysis for Change Point Problems
- Smoothers for Discontinuous Signals
- Optimal Detection of Changepoints With a Linear Computational Cost
- Multiple Change-Point Estimation With a Total Variation Penalty
- Minimizing Effective Resistance of a Graph
- Large-Scale Simultaneous Hypothesis Testing
- Estimating the Current Mean of a Normal Distribution which is Subjected to Changes in Time
- Graph Sparsification by Effective Resistances
This page was built for publication: Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
