ResearchTrend.AI
Near-Ideal Behavior of Compressed Sensing Algorithms

Near-Ideal Behavior of Compressed Sensing Algorithms

M. Ahsen
M. Vidyasagar
ArXivPDFHTML

Papers citing "Near-Ideal Behavior of Compressed Sensing Algorithms"

3 / 3 papers shown
Title
A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers
A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers
S. Negahban
Pradeep Ravikumar
Martin J. Wainwright
Bin Yu
467
1,378
0
13 Oct 2010
A note on the group lasso and a sparse group lasso
A note on the group lasso and a sparse group lasso
J. Friedman
Trevor Hastie
Robert Tibshirani
221
841
0
05 Jan 2010
The Benefit of Group Sparsity
The Benefit of Group Sparsity
Junzhou Huang
Tong Zhang
212
466
0
20 Jan 2009

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.