Error bounds for compressed sensing algorithms with group sparsity: A unified approach

DOI10.1016/j.acha.2015.11.006OpenAlexW2963287658MaRDI QIDQ2399645

M. Eren Ahsen, Mathukumalli Vidyasagar

Publication date: 24 August 2017

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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

zbMATH Keywords

error boundsgroup sparsitycompressed sensinggroup restricted isometry property

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm, Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates, Group sparse recovery via group square-root elastic net and the iterative multivariate thresholding-based algorithm, Unnamed Item, High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms, Computation of second-order directional stationary points for group sparse optimization, The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions

Cites Work

• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• Near-ideal model selection by \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• The benefit of group sparsity
• A simple proof of the restricted isometry property for random matrices
• Learning and generalisation. With applications to neural networks.
• Deterministic constructions of compressed sensing matrices
• Compressed sensing and best 𝑘-term approximation
• Decoding by Linear Programming
• Iteratively reweighted least squares minimization for sparse recovery
• Model Selection and Estimation in Regression with Grouped Variables
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers