Sparse density estimation with l1 penalties

Florentina Bunea; Alexandre B. Tsybakov; Marten H. Wegkamp

doi:10.1007/978-3-540-72927-3_38

Sparse density estimation with l₁ penalties

Florentina Bunea
, Alexandre B. Tsybakov
, Marten H. Wegkamp

Florida State University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

36 Citations (Scopus)

Abstract

This paper studies oracle properties of ℓ₁-penalized estimators of a probability density. We show that the penalized least squares estimator satisfies sparsity oracle inequalities, i.e., bounds in terms of the number of non-zero components of the oracle vector. The results are valid even when the dimension of the model is (much) larger than the sample size. They are applied to estimation in sparse high-dimensional mixture models, to nonparametric adaptive density estimation and to the problem of aggregation of density estimators.

Original language	English
Title of host publication	Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings
Publisher	Springer Verlag
Pages	530-543
Number of pages	14
ISBN (Print)	9783540729259
DOIs	https://doi.org/10.1007/978-3-540-72927-3_38
Publication status	Published - 1 Jan 2007
Event	20th Annual Conference on Learning Theory, COLT 2007 - San Diego, CA, United States Duration: 13 Jun 2007 → 15 Jun 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4539 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th Annual Conference on Learning Theory, COLT 2007
Country/Territory	United States
City	San Diego, CA
Period	13/06/07 → 15/06/07

Access to Document

10.1007/978-3-540-72927-3_38

Cite this

Bunea, F., Tsybakov, A. B., & Wegkamp, M. H. (2007). Sparse density estimation with l₁ penalties. In Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings (pp. 530-543). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4539 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-540-72927-3_38

@inproceedings{ed81b01c6e8a417f99714307c936ea22,

title = "Sparse density estimation with l1 penalties",

abstract = "This paper studies oracle properties of ℓ1-penalized estimators of a probability density. We show that the penalized least squares estimator satisfies sparsity oracle inequalities, i.e., bounds in terms of the number of non-zero components of the oracle vector. The results are valid even when the dimension of the model is (much) larger than the sample size. They are applied to estimation in sparse high-dimensional mixture models, to nonparametric adaptive density estimation and to the problem of aggregation of density estimators.",

author = "Florentina Bunea and Tsybakov, \{Alexandre B.\} and Wegkamp, \{Marten H.\}",

year = "2007",

month = jan,

day = "1",

doi = "10.1007/978-3-540-72927-3\_38",

language = "English",

isbn = "9783540729259",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "530--543",

booktitle = "Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings",

note = "20th Annual Conference on Learning Theory, COLT 2007 ; Conference date: 13-06-2007 Through 15-06-2007",

}

Bunea, F, Tsybakov, AB & Wegkamp, MH 2007, Sparse density estimation with l₁ penalties. in Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4539 LNAI, Springer Verlag, pp. 530-543, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, United States, 13/06/07. https://doi.org/10.1007/978-3-540-72927-3_38

Sparse density estimation with l₁ penalties. / Bunea, Florentina; Tsybakov, Alexandre B.; Wegkamp, Marten H.
Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings. Springer Verlag, 2007. p. 530-543 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4539 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Sparse density estimation with l1 penalties

AU - Bunea, Florentina

AU - Tsybakov, Alexandre B.

AU - Wegkamp, Marten H.

PY - 2007/1/1

Y1 - 2007/1/1

N2 - This paper studies oracle properties of ℓ1-penalized estimators of a probability density. We show that the penalized least squares estimator satisfies sparsity oracle inequalities, i.e., bounds in terms of the number of non-zero components of the oracle vector. The results are valid even when the dimension of the model is (much) larger than the sample size. They are applied to estimation in sparse high-dimensional mixture models, to nonparametric adaptive density estimation and to the problem of aggregation of density estimators.

AB - This paper studies oracle properties of ℓ1-penalized estimators of a probability density. We show that the penalized least squares estimator satisfies sparsity oracle inequalities, i.e., bounds in terms of the number of non-zero components of the oracle vector. The results are valid even when the dimension of the model is (much) larger than the sample size. They are applied to estimation in sparse high-dimensional mixture models, to nonparametric adaptive density estimation and to the problem of aggregation of density estimators.

U2 - 10.1007/978-3-540-72927-3_38

DO - 10.1007/978-3-540-72927-3_38

M3 - Conference contribution

AN - SCOPUS:38049008576

SN - 9783540729259

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

SP - 530

EP - 543

BT - Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings

PB - Springer Verlag

T2 - 20th Annual Conference on Learning Theory, COLT 2007

Y2 - 13 June 2007 through 15 June 2007

ER -

Bunea F, Tsybakov AB, Wegkamp MH. Sparse density estimation with l₁ penalties. In Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings. Springer Verlag. 2007. p. 530-543. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-72927-3_38