Abstract
Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum Renyi entropy estimators that impose weaker concavity restrictions on the fitted density are also considered, notably a minimum Hellinger discrepancy estimator that constrains the reciprocal of the square-root of the density to be concave. A limiting form of these estimators constrains solutions to the class of quasi-concave densities.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2998-3027 |
| Number of pages | 30 |
| Journal | Annals of Statistics |
| Volume | 38 |
| Issue number | 5 |
| DOIs | |
| State | Published - Oct 2010 |
Keywords
- Convex optimization
- Density estimation
- Duality
- Entropy
- Semidefinite programming.
- Shape constraints
- Strongly unimodal
- Unimodal
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
Fingerprint
Dive into the research topics of 'QUASI-concave density estimation'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS