Fetching the paper…
Reading the bibliography…
The interplay between computational efficiency and statistical accuracy in high-dimensional inference has drawn increasing attention in the literature.
Probability inequalities for the sum of independent random variables
Bennett, G. (1962) · 1962
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Hoeffding, W. (1963) · 1963
Earlier work this paper cites.
Matrix perturbation theory
Stewart, G. W. and Sun, J.-g. (1990) · 1990
Earlier work this paper cites.
Minimax estimation via wavelet shrinkage
Donoho, D. L. and Johnstone, I. M. (1998) · 1998
Earlier work this paper cites.
Algorithms for non-negative matrix factorization
Lee, D. D. and Seung, H. S. (2001) · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
McSherry, F. (2001) · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., Weiss, Y., et al. (2002) · 2002
Earlier work this paper cites.
Higher criticism for detecting sparse heterogeneous mixtures
Donoho, D. and Jin, J. (2004) · 2004
Earlier work this paper cites.
Some estimates of norms of random matrices
Latała, R. (2005) · 2005
Earlier work this paper cites.
Nonnegative sparse pca
Zass, R. and Shashua, A. (2006) · 2006
Earlier work this paper cites.
Random discrete matrices
Vu, V. (2008) · 2008
Earlier work this paper cites.
Finding large average submatrices in high dimensional data
Shabalin, A. A., Weigman, V. J., Perou, C. M., and Nobel, A. B. (2009) · 2009
Earlier work this paper cites.
Introduction to nonparametric estimation
Tsybakov, A. B. (2009) · 2009
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2010) · 2010
Cited alongside, same era.
Detection of an anomalous cluster in a network
Arias-Castro, E., Candès, E. J., Durand, A., et al. (2011) · 2011
Cited alongside, same era.
Statistical and computational tradeoffs in biclustering
Balakrishnan, S., Kolar, M., Rinaldo, A., Singh, A., and Wasserman, L. (2011) · 2011
Cited alongside, same era.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Candes, E. J. and Plan, Y. (2011) · 2011
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
Gross, D. (2011) · 2011
Cited alongside, same era.
Minimax localization of structural information in large noisy matrices
Computational and statistical tradeoffs via convex relaxation
Chandrasekaran, V. and Jordan, M. I. (2013) · 2013
Later among the works it cites.
Finding hidden cliques of size \ \backslash sqrt { \{ N/e } \} in nearly linear time
Deshpande, Y. and Montanari, A. (2013) · 2013
Later among the works it cites.
Statistical algorithms and a lower bound for detecting planted cliques
Feldman, V., Grigorescu, E., Reyzin, L., Vempala, S., and Xiao, Y. (2013) · 2013
Later among the works it cites.
Computational barriers in minimax submatrix detection
Ma, Z. and Wu, Y. (2013) · 2013
Later among the works it cites.
Geometrizing local rates of convergence for linear inverse problems
Cai, T. T., Liang, T., and Rakhlin, A. (2014) · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Kolar, M., Balakrishnan, S., Rinaldo, A., and Singh, A. (2011) · 2011
Cited alongside, same era.
The convex geometry of linear inverse problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., and Willsky, A. S. (2012) · 2012
Cited alongside, same era.
A tail inequality for quadratic forms of subgaussian random vectors
Hsu, D., Kakade, S. M., and Zhang, T. (2012) · 2012
Cited alongside, same era.
Minimax rates of estimation for sparse pca in high dimensions
Vu, V. Q. and Lei, J. (2012) · 2012
Cited alongside, same era.
Minimax bounds for sparse pca with noisy high-dimensional data
Birnbaum, A., Johnstone, I. M., Nadler, B., and Paul, D. (2013) · 2013
Cited alongside, same era.
Detection of a sparse submatrix of a high-dimensional noisy matrix
Butucea, C. and Ingster, Y. I. (2013) · 2013
Cited alongside, same era.
Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix
Butucea, C., Ingster, Y. I., and Suslina, I. (2013) · 2013
Cited alongside, same era.
Chen, Y. and Xu, J. (2014) · 2014
Later among the works it cites.
Non-negative principal component analysis: Message passing algorithms and sharp asymptotics
Montanari, A. and Richard, E. (2014) · 2014
Later among the works it cites.
Aggregation and minimax optimality in high-dimensional estimation
Tsybakov, A. B. (2014) · 2014
Later among the works it cites.
A simple svd algorithm for finding hidden partitions
Vu, V. (2014) · 2014
Later among the works it cites.
Structured regularizers for high-dimensional problems: Statistical and computational issues
Wainwright, M. J. (2014) · 2014
Later among the works it cites.
Statistical and computational trade-offs in estimation of sparse principal components
Wang, T., Berthet, Q., and Samworth, R. J. (2014) · 2014
Later among the works it cites.
Lower bounds on the performance of polynomial-time algorithms for sparse linear regression
Zhang, Y., Wainwright, M. J., and Jordan, M. I. (2014) · 2014
Later among the works it cites.
Optimal estimation and rank detection for sparse spiked covariance matrices
Cai, T. T., Ma, Z., and Wu, Y. (2015) · 2015
Closest in time.