Sciweavers

10 search results - page 2 / 2
» Nonuniform Sparse Recovery with Gaussian Matrices
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 5 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 5 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
ICASSP
2011
IEEE
12 years 8 months ago
Improved thresholds for rank minimization
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
JMLR
2010
158views more  JMLR 2010»
12 years 11 months ago
Restricted Eigenvalue Properties for Correlated Gaussian Designs
Methods based on 1-relaxation, such as basis pursuit and the Lasso, are very popular for sparse regression in high dimensions. The conditions for success of these methods are now ...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 5 months ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan