Rejoinder: Local rademacher complexities and oracle inequalities in risk minimization

Annals of Statistics

Volumn 34, Issue 6, 2006, Pages 2697-2706

  Koltchinskii, Vladimir ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79954491470     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/009053606000001082     Document Type: Article

References (11)

1. Bartlett, P. (2005). Fast rates of uniform convergence and oracle inequalities for model selection. Technical Report, Univ. California, Berkeley.
2. Bunea, F., TSYBAKOV, A. andWEGKAMP, M. (2007). Aggregation for Gaussian regression. Ann. Statist. 35. To appear.
3. Candes, E. and TAO, T. (2007). The Danzig selector: Statistical estimation when p is much larger than n. Ann. Statist. 35. To appear.
4. Donoho, D. L. (2004). For most large underdetermined systems of equations the minimal ℓ1-norm near-solution approximates the sparsest near-solution. Preprint.
5. Donoho, D. L. (2004). For most large underdetermined systems of linear equations the minimal ℓ1-norm solution is also the sparsest solution. Preprint.
6. Donoho, D. L., ELAD, M. and TEMLYAKOV, V. (2006). Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52 6-18. MR2237332
7. Fromont, M. (2007). Model selection by bootstrap penalization for classification. Machine Learning 66 165-207.
8. Koltchinskii, V. (2005). Model selection and aggregation in sparse classification problems. Oberwolfach Reports. To appear.
9. Koltchinskii, V. (2005). Sparsity in penalized empirical risk minimization. Preprint.
10. Mendelson, S., Pajor, A. and Tomczak-Jaegermann, N. (2007). Reconstruction and subGaussian operators in asymptotic geometric analysis. Geometric and Functional Analysis. To appear.
11. Rudelson, M. and Vershynin, R. (2005). Geometric approach to error-correcting codes and reconstruction of signals. Int. Math. Res. Not. 2005 4019-4041. MR2206919