Fast global convergence of gradient methods for high-dimensional
statistical recovery

v1v2v3 (latest)

Fast global convergence of gradient methods for high-dimensional statistical recovery

25 April 2011

Martin J. Wainwright

ArXiv (abs)PDF HTML

Papers citing "Fast global convergence of gradient methods for high-dimensional statistical recovery"

8 / 58 papers shown

Title
Learning Model-Based Sparsity via Projected Gradient Descent S. Bahmani P. Boufounos Bhiksha Raj 93 18 0 07 Sep 2012
$Efficient Point-to-Subspace Query in $\ell^1$ with Application to Robust Object Instance Recognition$ Efficient Point-to-Subspace Query in $\ell^1$ with Application to Robust Object Instance Recognition Ju Sun Yuqian Zhang John N. Wright 52 2 0 02 Aug 2012
Stochastic optimization and sparse statistical recovery: An optimal algorithm for high dimensions Alekh Agarwal S. Negahban Martin J. Wainwright 95 19 0 18 Jul 2012
Greedy Sparsity-Constrained Optimization S. Bahmani Bhiksha Raj P. Boufounos 148 197 0 25 Mar 2012
A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem Lin Xiao Tong Zhang 87 146 0 14 Mar 2012
A Novel M-Estimator for Robust PCA Teng Zhang Gilad Lerman 127 133 0 20 Dec 2011
High-dimensional regression with noisy and missing data: Provable guarantees with nonconvexity Po-Ling Loh Martin J. Wainwright 153 563 0 16 Sep 2011
$A Unifying Analysis of Projected Gradient Descent for $\ell_p$-constrained Least Squares$ A Unifying Analysis of Projected Gradient Descent for $\ell_p$ -constrained Least Squares S. Bahmani Bhiksha Raj 72 25 0 22 Jul 2011