Model selection with low complexity priors

DOI10.1093/imaiai/iav005zbMath1386.94040arXiv1307.2342OpenAlexW2097717989MaRDI QIDQ4603697

Mohammad Golbabaee, Jalal Fadili, Samuel Vaiter, Gabriel Peyré

Publication date: 19 February 2018

Published in: Information and Inference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2342

zbMATH Keywords

total variationmodel selectioninverse problemssparsitycompressed sensingconvex regularizationpartial smoothness

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations, Cosparsity in Compressed Sensing, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, The degrees of freedom of partly smooth regularizers, Learning Regularization Parameter-Maps for Variational Image Reconstruction Using Deep Neural Networks and Algorithm Unrolling, Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing, Local linear convergence of proximal coordinate descent algorithm, Activity Identification and Local Linear Convergence of Forward--Backward-type Methods, On Debiasing Restoration Algorithms: Applications to Total-Variation and Nonlocal-Means, Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness, Low Complexity Regularization of Linear Inverse Problems, Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization, Sharp oracle inequalities for low-complexity priors, Sampling from non-smooth distributions through Langevin diffusion, Unnamed Item, Proximal Gradient Methods with Adaptive Subspace Sampling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Simple bounds for recovering low-complexity models
• Consistent group selection in high-dimensional linear regression
• Shrinkage and variable selection by polytopes
• Some theoretical results on the grouped variables Lasso
• The cosparse analysis model and algorithms
• The convex geometry of linear inverse problems
• Probability of unique integer solution to a system of linear equations
• Counting the faces of randomly-projected hypercubes and orthants, with applications
• Robust Sparse Analysis Regularization
• Linear convergence rates for Tikhonov regularization with positively homogeneous functionals
• Identifiable Surfaces in Constrained Optimization
• On Sparse Representations in Arbitrary Redundant Bases
• Atomic Decomposition by Basis Pursuit
• Variational Analysis
• Uncertainty principles and ideal atomic decomposition
• On the Equivalence of Soft Wavelet Shrinkage, Total Variation Diffusion, Total Variation Regularization, and SIDEs
• Convergence rates of convex variational regularization
• Sparsity and Smoothness Via the Fused Lasso
• The 𝒰-Lagrangian of a convex function
• Active Sets, Nonsmoothness, and Sensitivity
• Uncertainty Principles and Vector Quantization
• Analysis versus synthesis in signal priors
• Partial Smoothness, Tilt Stability, and Generalized Hessians
• Regularization and Variable Selection Via the Elastic Net
• Model Selection and Estimation in Regression with Grouped Variables