Fetching the paper…
Reading the bibliography…
We study randomized sketching methods for approximately solving least-squares problem with a general convex constraint.
Portfolio Selection
H. M. Markowitz · 1959
Earlier work this paper cites.
Estimating a density under order restrictions: Non-asymptotic minimax risk
L. Birgé · 1987
Earlier work this paper cites.
Elements of Information Theory
T.M. Cover and J.A. Thomas · 1991
Earlier work this paper cites.
Probability in Banach Spaces: Isoperimetry and Processes
M. Ledoux and M. Talagrand · 1991
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Assouad, Fano and Le Cam
B. Yu · 1997
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. Chen, D. L. Donoho, and M. A. Saunders · 1998
Earlier work this paper cites.
Coding facial expressions with gabor wavelets
M.J. Lyons, S. Akamatsu, M. Kamachi, and J. Gyoba · 1998
Earlier work this paper cites.
Robust regression: Asymptotics, conjectures and Monte Carlo
P. Huber · 2001
Earlier work this paper cites.
Matrix Rank Minimization with Applications
M. Fazel · 2002
Earlier work this paper cites.
The Random Projection Method
S. Vempala · 2004
Earlier work this paper cites.
Local Rademacher complexities
P. L. Bartlett, O. Bousquet, and S. Mendelson · 2005
Earlier work this paper cites.
Decoding by linear programming
E. J. Candes and T. Tao · 2005
Earlier work this paper cites.
Generalization error bounds for collaborative prediction with low-rank matrices
N. Srebro, N. Alon, and T. S. Jaakkola · 2005
Earlier work this paper cites.
Approximate nearest neighbors and the fast johnson-lindenstrauss transform
N. Ailon and B. Chazelle · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
T. Sarlos · 2006
Cited alongside, same era.
Model selection and estimation in regression with grouped variables
M. Yuan and Y. Lin · 2006
Cited alongside, same era.
Uncovering shared structures in multiclass classification
Y. Amit, M. Fink, N. Srebro, and S. Ullman · 2007
Cited alongside, same era.
Gaussian averages of interpolated bodies and applications to approximate reconstruction
Y. Gordon, A. E. Litvak, S. Mendelson, and A. Pajor · 2007
Cited alongside, same era.
Dimension reduction and coefficient estimation in multivariate linear regression
M. Yuan, A. Ekici, Z. Lu, and R. Monteiro · 2007
Cited alongside, same era.
Convex multi-task feature learning
A. Argyriou, T. Evgeniou, and M. Pontil · 2008
Cited alongside, same era.
Optimal selection of reduced rank estimators of high-dimensional matrices
F. Bunea, Y. She, and M. Wegkamp · 2011
Later among the works it cites.
Faster least squares approximation
P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlos · 2011
Later among the works it cites.
Safe feature elimination for the lasso
Laurent El Ghaoui, Vivian Viallon, and Tarek Rabbani · 2011
Later among the works it cites.
Randomized algorithms for matrices and data
M. W. Mahoney · 2011
Later among the works it cites.
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
S. Negahban and M. J. Wainwright · 2011
Later among the works it cites.
Minimax rates of estimation for high-dimensional linear regression over ℓ q \ell_{q} -balls
G. Raskutti, M. J. Wainwright, and B. Yu · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Consistency of trace norm minimization
F. Bach · 2008
Cited alongside, same era.
Blur insensitive texture classification using local phase quantization
V. Ojansivu and J. Heikkilä · 2008
Cited alongside, same era.
A fast randomized algorithm for overdetermined linear least-squares regression
V. Rokhlin and M. Tygert · 2008
Cited alongside, same era.
Random projections for the nonnegative least-squares problem
C. Boutsidis and P. Drineas · 2009
Cited alongside, same era.
Sharp thresholds for high-dimensional and noisy sparsity recovery using ℓ 1 \ell_{1} -constrained quadratic programming (Lasso)
M. J. Wainwright · 2009
Cited alongside, same era.
Blendenpik: Supercharging lapack’s least-squares solver
H. Avron, P. Maymounkov, and S. Toledo · 2010
Cited alongside, same era.
Fast approximation of matrix coherence and statistical leverage
P. Drineas, M. Magdon-Ismail, M. W. Mahoney, and D. P. Woodruff · 2012
Later among the works it cites.
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity
P. Loh and M. J. Wainwright · 2012
Later among the works it cites.
Restricted strong convexity and (weighted) matrix completion: Optimal bounds with noise
S. Negahban and M. J. Wainwright · 2012
Later among the works it cites.
Recovery of sparse probability measures via convex programming
M. Pilanci, L. El Ghaoui, and V. Chandrasekaran · 2012
Later among the works it cites.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2012
Later among the works it cites.
The fast cauchy transform and faster robust linear regression
K. L. Clarkson, P. Drineas, M. Magdon-Ismail, M. W. Majoney, X. Meng, and D. P. Woodruff · 2013
Later among the works it cites.
Sparser Johnson-Lindenstrauss transforms
D. M. Kane and J. Nelson · 2014
Closest in time.
Randomized sketches of convex programs with sharp guarantees
M. Pilanci and M. J. Wainwright · 2014
Closest in time.