Fetching the paper…
Reading the bibliography…
In this paper we characterize sharp time-data tradeoffs for optimization problems used for solving linear inverse problems.
Robust modeling with erratic data
J. F. Claerbout and F. Muir · 1973
Earlier work this paper cites.
Aperture synthesis with a non-regular distribution of interferometer baselines
J. A. Hogbom · 1974
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o (1/k2)
Y. Nesterov · 1983
Earlier work this paper cites.
On Milman’s inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n}
Y. Gordon · 1988
Earlier work this paper cites.
Regression shrinkage and selection via the LASSO
R. Tibshirani · 1996
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. S. Chen, D. L. Donoho, and M. A. Saunders · 1998
Earlier work this paper cites.
Introductory lectures on convex optimization
Y. Nesterov · 2004
Earlier work this paper cites.
Neighborliness of randomly projected simplices in high dimensions
D. L. Donoho and J. Tanner · 2005
Earlier work this paper cites.
Sparse nonnegative solution of underdetermined linear equations by linear programming
D. L. Donoho and J. Tanner · 2005
Earlier work this paper cites.
An iterative regularization method for total variation-based image restoration
S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin · 2005
Earlier work this paper cites.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
E. J. Candes, J. Romberg, and T. Tao · 2006
Earlier work this paper cites.
Near-optimal signal recovery from random projections: Universal encoding strategies?
E. J. Candes and T. Tao · 2006
Earlier work this paper cites.
Compressed sensing
D. L. Donoho · 2006
Earlier work this paper cites.
High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
D. L. Donoho · 2006
Earlier work this paper cites.
Thresholds for the recovery of sparse solutions via l1 minimization
D. L. Donoho and J. Tanner · 2006
Earlier work this paper cites.
Sparse reconstruction by convex relaxation: Fourier and gaussian measurements
M. Rudelson and R. Vershynin · 2006
Earlier work this paper cites.
The generic chaining: upper and lower bounds of stochastic processes
M. Talagrand · 2006
Earlier work this paper cites.
Image denoising by sparse 3-d transform-domain collaborative filtering
K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian · 2007
Earlier work this paper cites.
Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems
M. A. Figueiredo, R. D. Nowak, and S. J. Wright · 2007
Earlier work this paper cites.
Reconstruction and subgaussian operators in asymptotic geometric analysis
S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann · 2007
Earlier work this paper cites.
Gradient methods for minimizing composite objective function, 2007
Y. Nesterov · 2007
Earlier work this paper cites.
Signal recovery from random measurements via orthogonal matching pursuit
J. A. Tropp and A. C. Gilbert · 2007
Earlier work this paper cites.
Iteratively reweighted algorithms for compressive sensing
R. Chartrand and W. Yin · 2008
Earlier work this paper cites.
Stable sparse approximations via nonconvex optimization
R. Saab, R. Chartrand, and O. Yilmaz · 2008
Earlier work this paper cites.
Bregman iterative algorithms for
W. Yin, S. Osher, D. Goldfarb, and J. Darbon · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Iterative hard thresholding for compressed sensing
T. Blumensath and M. E. Davies · 2009
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candes and B. Recht · 2009
Earlier work this paper cites.
Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
D. Donoho and J. Tanner · 2009
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
D. L. Donoho, A. Maleki, and A. Montanari · 2009
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
D. L. Donoho, A. Maleki, and A. Montanari · 2009
Earlier work this paper cites.
Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property
R. Garg and R. Khandekar · 2009
Earlier work this paper cites.
Guaranteed rank minimization via singular value projection
P. Jain, R. Meka, and I. Dhillon · 2009
Cited alongside, same era.
An accelerated gradient method for trace norm minimization
S. Ji and J. Ye · 2009
Cited alongside, same era.
Matrix completion from noisy entries
R. Keshavan, A. Montanari, and S. Oh · 2009
Cited alongside, same era.
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
D. Needell and J. A. Tropp · 2009
Cited alongside, same era.
Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
D. Needell and R. Vershynin · 2009
Cited alongside, same era.
A unified framework for high-dimensional analysis of
S. Negahban, B. Yu, M. J. Wainwright, and P. K. Ravikumar · 2009
Computational and statistical tradeoffs via convex relaxation
V. Chandrasekaran and M. I. Jordan · 2013
Later among the works it cites.
Restricted isometry of Fourier matrices and list decodability of random linear codes
M. Cheraghchi, V. Guruswami, and A. Velingker · 2013
Later among the works it cites.
Random sampling in bounded orthonormal systems
S. Foucart and H. Rauhut · 2013
Later among the works it cites.
Regularized
P. Loh and M. J. Wainwright · 2013
Later among the works it cites.
Sharp MSE bounds for proximal denoising
S. Oymak and B. Hassibi · 2013
Later among the works it cites.
Sharp MSE bounds for proximal denoising
S. Oymak and B. Hassibi · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
M. Stojnic · 2009
Cited alongside, same era.
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
M. J. Wainwright · 2009
Cited alongside, same era.
Sharp thresholds for noisy and high-dimensional recovery of sparsity using
M. J. Wainwright · 2009
Cited alongside, same era.
Fast global convergence rates of gradient methods for high-dimensional statistical recovery
A. Agarwal, S. Negahban, and M. J. Wainwright · 2010
Cited alongside, same era.
A singular value thresholding algorithm for matrix completion
J. F. Cai, E. J. Candes, and Z. Shen · 2010
Cited alongside, same era.
Latent variable graphical model selection via convex optimization
V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky · 2010
Cited alongside, same era.
Later among the works it cites.
Simple bounds for noisy linear inverse problems with exact side information
S. Oymak, C. Thrampoulidis, and B. Hassibi · 2013
Later among the works it cites.
The squared-error of generalized LASSO: A precise analysis
S. Oymak, C. Thrampoulidis, and B. Hassibi · 2013
Later among the works it cites.
Fixed points of generalized approximate message passing with arbitrary matrices
S. Rangan, P. Schniter, E. Riegler, A. Fletcher, and V. Cevher · 2013
Later among the works it cites.
A framework to characterize performance of LASSO algorithms
M. Stojnic · 2013
Later among the works it cites.
A performance analysis framework for SOCP algorithms in noisy compressed sensing
M. Stojnic · 2013
Later among the works it cites.
M. Stojnic · 2013
Later among the works it cites.
A proximal-gradient homotopy method for the sparse least-squares problem
L. Xiao and T. Zhang · 2013
Later among the works it cites.
Living on the edge: Phase transitions in convex programs with random data
D. Amelunxen, M. Lotz, M. B. McCoy, and J. A. Tropp · 2014
Later among the works it cites.
Time–data tradeoffs by aggressive smoothing
J. J. Bruer, J. A. Tropp, V. Cevher, and S. Becker · 2014
Later among the works it cites.
Designing statistical estimators that balance sample size, risk, and computational cost
J. J. Bruer, J. A. Tropp, V. Cevher, and S. R. Becker · 2014
Later among the works it cites.
Geometrizing local rates of convergence for linear inverse problems
T. T. Cai, T. Liang, and A. Rakhlin · 2014
Later among the works it cites.
Phase retrieval from coded diffraction patterns
E. J. Candes, X. Li, and M. Soltanolkotabi · 2014
Later among the works it cites.
Phase retrieval via Wirtinger flow: Theory and algorithms
E. J. Candes, X. Li, and M. Soltanolkotabi · 2014
Later among the works it cites.
Dimensionality reduction with sub-Gaussian matrices: a unified theory
S. Dirksen · 2014
Later among the works it cites.
On iterative hard thresholding methods for high-dimensional M-estimation
P. Jain, A. Tewari, and P. Kar · 2014
Later among the works it cites.
Suprema of chaos processes and the restricted isometry property
F. Krahmer, S. Mendelson, and H. Rauhut · 2014
Later among the works it cites.
Learning without concentration
S. Mendelson · 2014
Later among the works it cites.
From denoising to compressed sensing
C. A. Metzler, A. Maleki, and R. G. Baraniuk · 2014
Later among the works it cites.
High-dimensional estimation with geometric constraints
Y. Plan, R. Vershynin, and E. Yudovina · 2014
Later among the works it cites.
Estimation in high dimensions: a geometric perspective
R. Vershynin · 2014
Later among the works it cites.
Decomposable norm minimization with proximal-gradient homotopy algorithm
R. Eghbali and M. Fazel · 2015
Closest in time.
A geometric view on constrained
Y. Li, Y. Hsieh, and V. Cevher · 2015
Closest in time.
Fast and reliable estimation fom nonlinear observations
S. Oymak, B. Recht, and M. Soltanolkotabi · 2015
Closest in time.
Isometric sketching of any set via the Restricted Isometry Property
S. Oymak, B. Recht, and M. Soltanolkotabi · 2015
Closest in time.
The generalized LASSO with non-linear observations
Y. Plan and R. Vershynin · 2015
Closest in time.