scientific article; zbMATH DE number 7750674
From MaRDI portal
Publication:6073213
DOI10.11329/jjssj.53.111MaRDI QIDQ6073213
Publication date: 17 October 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- The restricted isometry property and its implications for compressed sensing
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Atomic Decomposition by Basis Pursuit
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Bayesian signal reconstruction for 1-bit compressed sensing
- A Survey of Compressed Sensing
- Restricted isometry properties and nonconvex compressive sensing
- Sparse representations in unions of bases
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and Redundant Representations
- Information, Physics, and Computation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Good error-correcting codes based on very sparse matrices
- Sparse Approximate Solutions to Linear Systems
- Approximate message passing for nonconvex sparse regularization with stability and asymptotic analysis
- Estimator of prediction error based on approximate message passing for penalized linear regression
- Cross validation in sparse linear regression with piecewise continuous nonconvex penalties and its acceleration
- Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control
- Vector Approximate Message Passing
- The LASSO Risk for Gaussian Matrices
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- Algorithmic Learning Theory
- A CDMA multiuser detection algorithm on the basis of belief propagation
- Compressed sensing
This page was built for publication:
