Fetching the paper…
Reading the bibliography…
Gaussian comparison theorems are useful tools in probability theory; they are essential ingredients in the classical proofs of many results in empirical processes and extreme value theory.
P. K. Andersen and R. D. Gill, “Cox’s regression model for counting processes: a large sample study,” The annals of statistics , pp. 1100–1120, 1982
1982
Earlier work this paper cites.
Y. Gordon, “Some inequalities for gaussian processes and applications,” Israel Journal of Mathematics , vol. 50, no. 4, pp. 265–289, 1985
1985
Earlier work this paper cites.
——, “Elliptically contoured distributions,” Probability theory and related fields , vol. 76, no. 4, pp. 429–438, 1987
1987
Earlier work this paper cites.
Y. Gordon, On Milman’s inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n} . Springer, 1988
1988
Earlier work this paper cites.
M. Ledoux and M. Talagrand, Probability in Banach Spaces: isoperimetry and processes . Springer, 1991, vol. 23
1991
Earlier work this paper cites.
Z. Bai and Y. Yin, “Limit of the smallest eigenvalue of a large dimensional sample covariance matrix,” The annals of Probability , pp. 1275–1294, 1993
1993
Earlier work this paper cites.
W. K. Newey and D. McFadden, “Large sample estimation and hypothesis testing,” Handbook of econometrics , vol. 4, pp. 2111–2245, 1994
1994
Earlier work this paper cites.
C. R. Rao and H. Toutenburg, Linear models . Springer, 1995
1995
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society. Series B (Methodological) , pp. 267–288, 1996
1996
Earlier work this paper cites.
R. T. Rockafellar, Convex analysis . Princeton university press, 1997, vol. 28
1997
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM journal on scientific computing , vol. 20, no. 1, pp. 33–61, 1998
1998
Earlier work this paper cites.
D. P. Bertsekas, A. Nedić, and A. E. Ozdaglar, Convex analysis and optimization . Athena Scientific Belmont, 2003
2003
Earlier work this paper cites.
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” Information Theory, IEEE Transactions on , vol. 52, no. 2, pp. 489–509, 2006
2006
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” Information Theory, IEEE Transactions on , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Earlier work this paper cites.
M. Rudelson and R. Vershynin, “Sparse reconstruction by convex relaxation: Fourier and gaussian measurements,” in Information Sciences and Systems, 2006 40th Annual Conference on . IEEE, 2006, pp. 207–212
2006
Earlier work this paper cites.
E. Candes and T. Tao, “The dantzig selector: Statistical estimation when p is much larger than n,” The Annals of Statistics , pp. 2313–2351, 2007
2007
Earlier work this paper cites.
D. Donoho and J. Tanner, “Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing,” Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 367, no. 1906, pp. 4273–4293, 2009
2009
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2009
2009
Earlier work this paper cites.
P. J. Bickel, Y. Ritov, and A. B. Tsybakov, “Simultaneous analysis of lasso and dantzig selector,” The Annals of Statistics , vol. 37, no. 4, pp. 1705–1732, 2009
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2010
Cited alongside, same era.
J. Wright and Y. Ma, “Dense error correction via-minimization,” Information Theory, IEEE Transactions on , vol. 56, no. 7, pp. 3540–3560, 2010
2013
Later among the works it cites.
2013
Later among the works it cites.
L. Wang, “The l1 penalized lad estimator for high dimensional linear regression,” Journal of Multivariate Analysis , vol. 120, pp. 135–151, 2013
2013
Later among the works it cites.
2013
Later among the works it cites.
A. Maleki, L. Anitori, Z. Yang, and R. G. Baraniuk, “Asymptotic analysis of complex lasso via complex approximate message passing (camp),” Information Theory, IEEE Transactions on , vol. 59, no. 7, pp. 4290–4308, 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
G. Raskutti, M. J. Wainwright, and B. Yu, “Restricted eigenvalue properties for correlated gaussian designs,” The Journal of Machine Learning Research , vol. 99, pp. 2241–2259, 2010
2010
Cited alongside, same era.
A. Belloni, V. Chernozhukov, and L. Wang, “Square-root lasso: pivotal recovery of sparse signals via conic programming,” Biometrika , vol. 98, no. 4, pp. 791–806, 2011
2011
Cited alongside, same era.
S. B. Korada and A. Montanari, “Applications of the lindeberg principle in communications and statistical learning,” Information Theory, IEEE Transactions on , vol. 57, no. 4, pp. 2440–2450, 2011
2011
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “The noise-sensitivity phase transition in compressed sensing,” Information Theory, IEEE Transactions on , vol. 57, no. 10, pp. 6920–6941, 2011
2011
Cited alongside, same era.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” Information Theory, IEEE Transactions on , vol. 57, no. 2, pp. 764–785, 2011
2011
Cited alongside, same era.
2012
Cited alongside, same era.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Cited alongside, same era.
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
S. Boucheron, G. Lugosi, and P. Massart, Concentration inequalities: A nonasymptotic theory of independence . Oxford University Press, 2013
2013
Later among the works it cites.
2014
Closest in time.
C. Thrampoulidis and B. Hassibi, “Estimating structured signals in sparse noise: A precise noise sensitivity analysis,” in Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on . IEEE, 2014, pp. 866–873
2014
Closest in time.
2014
Closest in time.
C. Thrampoulidis, S. Oymak, and B. Hassibi, “Simple error bounds for regularized noisy linear inverse problems,” Information Theory, 2014. ISIT 2014. Proceedings. International Symposium on , pp. 3007–3011, 2014
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
2015
Closest in time.
C. Thrampoulidis and B. Hassibi, “Isotropically random orthogonal matrices: Performance of lasso and minimum conic singular values,” submitted to ISIT 2015 , 2015
2015
Closest in time.