Sparse recovery in convex hulls via entropy penalization1

Annals of Statistics

Volumn 37, Issue 3, 2009, Pages 1332-1359

  Koltchinskii, Vladimir ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Convex hulls; Entropy; Penalized empirical risk minimization; Sparsity

Indexed keywords

EID: 68849132263     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/08-AOS621     Document Type: Article

References (20)

1. AUDIBERT, J.-Y. (2004). Une approche PAC-bayésienne de la théorie statistique de l'apprentissage. Ph.D. thesis, Univ. Paris 6.
2. BICKEL, P., RITOV, Y. and TSYBAKOV, A. (2008). Simultaneous analysis of LASSO and Dantzig selector. Ann. Statist. To appear.
3. BUNEA, F., TSYBAKOV, A. and WEGKAMP, M. (2007a). Sparsity oracle inequalities for the LASSO. Electronic Journal of Statistics 1 169-194. MR2312149
4. 1 penalties. In Proc. 20th Annual Conference on Learning Theory (COLT 2007) 530-543. Lecture Notes in Artificial Intelligence 4539. Springer, Berlin. MR2397610
5. CANDES, E. and TAO, T. (2007). The Dantzig selector: Statistical estimation when p is much larger than n. Ann. Statist. 35 2392-2404. MR2382651
6. CATONI, O. (2004). Statistical learning theory and stochastic optimization. In Ecole d'Eté de Probabilités de Saint-Flour XXXI-2001. Lecture Notes in Mathematics 1851. Springer, New York. MR2163920
7. DALALYAN, A. and TSYBAKOV, A. (2007). Aggregation by exponential weighting and sharp oracle inequalities. In Proc. 20th Annual Conference on Learning Theory (COLT 2007) 97-111. Lecture Notes in Artificial Intelligence 4539. Springer, Berlin. MR2397581
8. 1-norm solution is also the sparsest solution. Comm. Pure Appl. Math. 59 797-829. MR2217606
9. KOLTCHINSKII, V. (2005). Model selection and aggregation in sparse classification problems. Oberwolfach Reports: Meeting on Statistical and Probabilistic Methods of Model Selection, October 2005.
10. KOLTCHINSKII, V. (2006). Local Rademacher complexities and oracle inequalities in risk minimization. Ann. Statist. 34 2593-2656. MR2329442
11. KOLTCHINSKII, V. (2008a). Sparsity in penalized empirical risk minimization. Ann. Inst. H. Poincaré Probab. Statist. To appear.
12. KOLTCHINSKII, V. (2008b). The Dantzig selector and sparsity oracle inequalities. Preprint.
13. MASSART, P. (2007). Concentration inequalities and model selection. In Ecole d'ete de Probabilités de Saint-Flour 2003. Springer, Berlin. MR2319879
14. MCALLESTER, D. A. (1999). Some PAC-Bayesian theorems. Machine Learning 37 355-363.
15. MENDELSON, S., PAJOR, A. and TOMCZAK- JAEGERMANN, N. (2007). Reconstruction and sub-Gaussian operators in asymptotic geometric analysis. Geomet. Funct. Anal. 17 1248-1282. MR2373017
16. RUDELSON, M. and VERSHYNIN, R. (2005). Geometric approach to error correcting codes and reconstruction of signals. Int. Math. Res. Not. 64 4019-4041. MR2206919
17. VAN DE GEER, S. (2008). High-dimensional generalized linear models and the lasso. Ann. Statist. 36 614-645. MR2396809
18. ZHANG, T. (2001). Regularized Winnow method. In Advances in Neural Information Processing Systems 13 (NIPS2000) (T. K. Leen, T. G. Dietrich and V. Tresp, eds.) 703-709 MIT Press.
19. ZHANG, T. (2006a). From epsilon-entropy to KL-complexity: Analysis of minimum information complexity density estimation. Ann. Statist. 34 2180-2210. MR2291497
20. ZHANG, T. (2006b). Information theoretical upper and lower bounds for statistical estimation. IEEE Trans. Inform. Theory 52 1307-1321. MR2241190