Project Euclid

References

• [1] Addario-Berry, L., Broutin, N., Devroye, L. and Lugosi, G. (2010). On combinatorial testing problems., Ann. Statist., 38 3063–3092. URL http://dx.doi.org/10.1214/10-AOS817.
  Mathematical Reviews (MathSciNet): MR2722464
  Zentralblatt MATH: 1200.62059
  Digital Object Identifier: doi:10.1214/10-AOS817
  Project Euclid: euclid.aos/1283175989
  
• [2] Bartlett, P. L., Jordan, M. I. and McAuliffe, J. D. (2006). Convexity, classification, and risk bounds., J. Amer. Statist. Assoc., 101 138–156. URL http://dx.doi.org/10.1198/016214505000000907.
  Mathematical Reviews (MathSciNet): MR2268032
  Zentralblatt MATH: 1118.62330
  Digital Object Identifier: doi:10.1198/016214505000000907
  
• [3] Berthet, Q. and Rigollet, P. (2013a). Complexity theoretic lower bounds for sparse principal component detection. In, COLT 2013 – The 26th Conference on Learning Theory, Princeton, NJ, June 12–14, 2013 (S. Shalev-Shwartz and I. Steinwart, eds.), vol. 30 of JMLR W&CP, 1046–1066.
• [4] Berthet, Q. and Rigollet, P. (2013b). Optimal detection of sparse principal components in high dimension., Ann. Statist., 41 1780–1815.
  Mathematical Reviews (MathSciNet): MR3127849
  Zentralblatt MATH: 1277.62155
  Digital Object Identifier: doi:10.1214/13-AOS1127
  Project Euclid: euclid.aos/1378386239
  
• [5] Bickel, P. J., Ritov, Y. and Tsybakov, A. B. (2009). Simultaneous analysis of Lasso and Dantzig selector., Ann. Statist., 37 1705–1732.
  Mathematical Reviews (MathSciNet): MR2533469
  Zentralblatt MATH: 1173.62022
  Digital Object Identifier: doi:10.1214/08-AOS620
  Project Euclid: euclid.aos/1245332830
  
• [6] Butucea, C. and Ingster, Y. I. (2013). Detection of a sparse submatrix of a high-dimensional noisy matrix., Bernoulli, 19 2652–2688.
  Mathematical Reviews (MathSciNet): MR3160567
  Digital Object Identifier: doi:10.3150/12-BEJ470
  Project Euclid: euclid.bj/1386078616
  
• [7] Candes, E. and Tao, T. (2007). The Dantzig selector: statistical estimation when $p$ is much larger than $n$., Ann. Statist., 35 2313–2351.
  Mathematical Reviews (MathSciNet): MR2382644
  Zentralblatt MATH: 1139.62019
  Digital Object Identifier: doi:10.1214/009053606000001523
  Project Euclid: euclid.aos/1201012958
  
• [8] Candès, E. J. and Recht, B. (2009). Exact matrix completion via convex optimization., Found. Comput. Math., 9 717–772. URL http://dx.doi.org/10.1007/s10208-009-9045-5.
  Mathematical Reviews (MathSciNet): MR2565240
  Digital Object Identifier: doi:10.1007/s10208-009-9045-5
  
• [9] Chandrasekaran, V., Parrilo, P. A. and Willsky, A. S. (2012). Latent variable graphical model selection via convex optimization., Ann. Statist., 40 1935–1967. URL http://dx.doi.org/10.1214/11-AOS949.
  Mathematical Reviews (MathSciNet): MR3059067
  Digital Object Identifier: doi:10.1214/11-AOS949
  Project Euclid: euclid.aos/1351602527
  
• [10] d’Aspremont, A., Ghaoui, L. E., Jordan, M. I. and Lanckriet, G. R. G. (2007). A direct formulation for sparse PCA using semidefinite programming., SIAM Review, 49 434–448. URL http://arxiv.org/abs/cs/0406021v3.
  Mathematical Reviews (MathSciNet): MR2353806
  Zentralblatt MATH: 1128.90050
  Digital Object Identifier: doi:10.1137/050645506
  
• [11] Jerrum, M. (1992). Large cliques elude the Metropolis process., Random Structures Algorithms, 3 347–359. URL http://dx.doi.org/10.1002/rsa.3240030402.
  Mathematical Reviews (MathSciNet): MR1179827
  
• [12] Koltchinskii, V., Lounici, K. and Tsybakov, A. B. (2011). Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion., Ann. Statist., 39 2302–2329. URL http://dx.doi.org/10.1214/11-AOS894.
  Mathematical Reviews (MathSciNet): MR2906869
  Zentralblatt MATH: 1231.62097
  Digital Object Identifier: doi:10.1214/11-AOS894
  Project Euclid: euclid.aos/1322663459
  
• [13] Kučera, L. (1995). Expected complexity of graph partitioning problems., Discrete Appl. Math., 57 193–212. Combinatorial optimization 1992 (CO92) (Oxford), URL http://dx.doi.org/10.1016/0166-218X(94)00103-K.
  Mathematical Reviews (MathSciNet): MR1327775
  Digital Object Identifier: doi:10.1016/0166-218X(94)00103-K
  
• [14] Ma, Z. and Wu, Y. (2015). Computational barriers in minimax submatrix detection., Ann. Statist. To appear.
  Mathematical Reviews (MathSciNet): MR3346698
  Digital Object Identifier: doi:10.1214/14-AOS1300
  Project Euclid: euclid.aos/1431695639
  
• [15] Ravikumar, P., Wainwright, M. J. and Lafferty, J. D. (2010). High-dimensional Ising model selection using $\ell_1$-regularized logistic regression., Ann. Statist., 38 1287–1319. URL http://dx.doi.org/10.1214/09-AOS691.
  Mathematical Reviews (MathSciNet): MR2662343
  Zentralblatt MATH: 1189.62115
  Digital Object Identifier: doi:10.1214/09-AOS691
  Project Euclid: euclid.aos/1268056617
  
• [16] Rigollet, P. and Tong, X. (2011). Neyman-Pearson classification, convexity and stochastic constraints., J. Mach. Learn. Res., 12 2831–2855.
  Mathematical Reviews (MathSciNet): MR2854349
  Zentralblatt MATH: 1280.62080
  
• [17] Rigollet, P. and Tsybakov, A. (2011). Exponential screening and optimal rates of sparse estimation., Ann. Statist., 39 731–771. URL http://dx.doi.org/10.1214/10-AOS854.
  Mathematical Reviews (MathSciNet): MR2816337
  Zentralblatt MATH: 1215.62043
  Digital Object Identifier: doi:10.1214/10-AOS854
  Project Euclid: euclid.aos/1299680953
  
• [18] Yannakakis, M. (1991). Expressing combinatorial optimization problems by linear programs., Journal of Computer and System Sciences, 43 441–466. URL http://www.sciencedirect.com/science/article/pii/002200009190024Y.
  Mathematical Reviews (MathSciNet): MR1135472
  Zentralblatt MATH: 0748.90074
  Digital Object Identifier: doi:10.1016/0022-0000(91)90024-Y