ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1306.4391
  4. Cited By
On the Fundamental Limits of Recovering Tree Sparse Vectors from Noisy
  Linear Measurements

On the Fundamental Limits of Recovering Tree Sparse Vectors from Noisy Linear Measurements

18 June 2013
Akshay Soni
Jarvis Haupt
ArXivPDFHTML

Papers citing "On the Fundamental Limits of Recovering Tree Sparse Vectors from Noisy Linear Measurements"

17 / 17 papers shown
Title
Near-Optimal Adaptive Compressed Sensing
Near-Optimal Adaptive Compressed Sensing
Matthew Malloy
Robert D. Nowak
67
164
0
26 Jun 2013
Recovering Graph-Structured Activations using Adaptive Compressive
  Measurements
Recovering Graph-Structured Activations using Adaptive Compressive Measurements
A. Krishnamurthy
James Sharpnack
Aarti Singh
67
21
0
01 May 2013
Recovering Block-structured Activations Using Compressive Measurements
Recovering Block-structured Activations Using Compressive Measurements
Sivaraman Balakrishnan
Mladen Kolar
Alessandro Rinaldo
Aarti Singh
78
22
0
15 Sep 2012
Adaptive sensing performance lower bounds for sparse signal detection
  and support estimation
Adaptive sensing performance lower bounds for sparse signal detection and support estimation
R. Castro
306
33
0
04 Jun 2012
Efficient Adaptive Compressive Sensing Using Sparse Hierarchical Learned
  Dictionaries
Efficient Adaptive Compressive Sensing Using Sparse Hierarchical Learned Dictionaries
Akshay Soni
Jarvis Haupt
64
23
0
29 Nov 2011
On the Fundamental Limits of Adaptive Sensing
On the Fundamental Limits of Adaptive Sensing
E. Arias-Castro
Emmanuel J. Candes
Mark A. Davenport
138
137
0
20 Nov 2011
Group Lasso with Overlaps: the Latent Group Lasso approach
Group Lasso with Overlaps: the Latent Group Lasso approach
G. Obozinski
Laurent Jacob
Jean-Philippe Vert
111
183
0
03 Oct 2011
Compressive Imaging using Approximate Message Passing and a Markov-Tree
  Prior
Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior
Subhojit Som
Philip Schniter
96
214
0
12 Aug 2011
How well can we estimate a sparse vector?
How well can we estimate a sparse vector?
Emmanuel J. Candès
Mark A. Davenport
80
116
0
27 Apr 2011
Sequential Analysis in High Dimensional Multiple Testing and Sparse
  Recovery
Sequential Analysis in High Dimensional Multiple Testing and Sparse Recovery
Matthew Malloy
Robert D. Nowak
71
44
0
30 Mar 2011
Proximal Methods for Hierarchical Sparse Coding
Proximal Methods for Hierarchical Sparse Coding
Rodolphe Jenatton
Julien Mairal
G. Obozinski
Francis R. Bach
206
344
0
11 Sep 2010
Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
Jarvis Haupt
R. Castro
Robert D. Nowak
118
154
0
29 Jan 2010
Revisiting Marginal Regression
Revisiting Marginal Regression
Christopher R. Genovese
Jiashun Jin
Larry A. Wasserman
135
38
0
20 Nov 2009
The composite absolute penalties family for grouped and hierarchical
  variable selection
The composite absolute penalties family for grouped and hierarchical variable selection
P. Zhao
Guilherme V. Rocha
Bin Yu
196
673
0
02 Sep 2009
Learning with Structured Sparsity
Learning with Structured Sparsity
Junzhou Huang
Tong Zhang
Dimitris N. Metaxas
218
565
0
17 Mar 2009
Support union recovery in high-dimensional multivariate regression
Support union recovery in high-dimensional multivariate regression
G. Obozinski
Martin J. Wainwright
Michael I. Jordan
213
323
0
05 Aug 2008
Information-theoretic limits on sparse signal recovery: Dense versus
  sparse measurement matrices
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
Wei Wang
Martin J. Wainwright
Kannan Ramchandran
210
171
0
03 Jun 2008
1