Sparse density estimation with ℓ1 penalties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4539 LNAI, Issue , 2007, Pages 530-543

  Bunea, Florentina ^a   Tsybakov, Alexandre B ^b   Wegkamp, Marten H ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LEAST SQUARES APPROXIMATIONS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; SAMPLING; VECTORS;

LEAST SQUARES ESTIMATORS; NON-ZERO COMPONENTS; SAMPLE SIZE; SPARSE DENSITY ESTIMATION;

PROBABILITY DENSITY FUNCTION;

EID: 38049008576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72927-3_38     Document Type: Conference Paper

References (30)

1. Abramovich, F., Benjamini, Y., Donoho, D.L., Johnstone, I.M: Adapting to unknown sparsity by controlling the False Discovery Rate. Annals of Statistics 34, 584-653 (2006)
2. Barron, A., Birgé, L., Massart, P.: Risk bounds for model selection via penalization. Probability Theory and Related Fields 113, 301-413 (1999)
3. Birgé, L., Massart, P.: From model selection to adaptive estimation. Festschrift for Lucien LeCam. In: Pollard, D., Torgersen, E., Yang, G. (eds.) Research Papers in Probability and Statistics, pp. 55-87. Springer, New York (1997)
4. Bunea, F., Tsybakov, A.B., Wegkamp, M.H.: Aggregation for Gaussian regression. Preprint Department of Statistics, Florida State University. Annals of Statistics, to appear (2005)
5. 1-penalized least squares. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), vol. 4005, pp. 379-391. Springer, Heidelberg (2006a)
6. Bunea, F., Tsybakov, A.B., Wegkamp, M.H: b). Sparsity oracle inequalities for the Lasso. Submitted (2006)
7. Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM Review 43, 129-159 (2001)
8. Devroye, L., Lugosi, G.: Combinatorial Methods in density estimation. Springer, Heidelberg (2000)
9. Donoho, D.L.: Denoising via soft-thresholding. IEEE Trans. Info. Theory 41, 613 627 (1995)
10. Donoho, D.L., Elad, M., Temlyakov, V.: Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise. Manuscript (2004)
11. Donoho, D.L., Huo, X.: Uncertainty principles and ideal atomic decomposition. IEEE Transactions Inform. Theory 47, 2845-2862 (2001)
12. 2. Problems of Information Transmission 28, 44-54 (1992)
13. Golubev, G.K.: Reconstruction of sparse vectors in white Gaussian noise. Problems of Information Transmission 38, 65-79 (2002)
14. Greenshtein, E., Ritov, Y.: Persistency in high dimensional linear predictorselection and the virtue of over-parametrization. Bernoulli 10, 971-988 (2004)
15. Hall, P., Kerkyacharian, G., Picard, D.: Block threshold rules for curve estimation using kernel and wavelet methods. Annals of Statistics 26, 922-942 (1998)
16. Härdle, W., Kerkyacharian, G., Picard, D., Tsybakov, A.: Wavelets, Approximation and Statistical Applications. Lecture Notes in Statistics, vol. 129, Springer, New York (1998)
17. p adaptive density estimation. Bernoulli 2, 229-247 (1996)
18. Koltchinskii, V.: Model selection and aggregation in sparse classification problems. Oberwolfach Reports. Mathematisches Forschungsinstitut Oberwolfach. 2, 2663-2667 (2005)
19. Koltchinskii, V.: Sparsity in penalized empirical risk minimization. Submitted (2006)
20. Loubes, J.- M., van de Geer, S.A.: Adaptive estimation in regression, using soft thresholding type penalties. Statistica Neerlandica 56, 453-478 (2002)
21. Meinshausen, N., Bühlmann, P.: High-dimensional graphs and variable selection with the Lasso. Annals of Statistics 34, 1436-1462 (2006)
22. Nemirovski, A.: Topics in non-parametric statistics. In: Bernard, P. (ed.) Ecole d'Eté de Probabilités de Saint-Flour 1998. Lecture Notes in Mathematics, vol. XXVIII, Springer, New York (2000)
23. Rigollet, Ph.: Inégalités d'oracle, agrégation et adaptation. PhD thesis, University of Paris 6 (2006)
24. Rigollet, Ph.,Tsybakov, A. B.: Linear and convex aggregation of density estimators. (2004), https://hal.ccsd.cnrs.fr/ccsd-00068216.
25. Rudemo, M.: Empirical choice of histograms and kernel density estimato. Scandinavian Journal of Statistics 9, 65-78 (1982)
26. Tibshirani, R.: Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society, Series B 58, 267-288 (1996)
27. Tsybakov, A.B.: Optimal rates of aggregation. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, Springer, Heidelberg (2003)
28. Vapnik, V.N.: Statistical Learning Theory. Wiley, New York (1998)
29. van de Geer, S.A.: High dimensional generalized linear models and the Lasso. Research report No. 133. Seminar für Statistik, ETH, Zürich (2006)
30. Wegkamp, M.H.: Quasi-Universal Bandwidth Selection for Kernel Density Estimators. Canadian Journal of Statistics 27, 409-420 (1999)