Open Access
Translator Disclaimer
November 2018 Shape Constrained Density Estimation Via Penalized Rényi Divergence
Roger Koenker, Ivan Mizera
Statist. Sci. 33(4): 510-526 (November 2018). DOI: 10.1214/18-STS658

Abstract

Shape constraints play an increasingly prominent role in nonparametric function estimation. While considerable recent attention has been focused on log concavity as a regularizing device in nonparametric density estimation, weaker forms of concavity constraints encompassing larger classes of densities have received less attention but offer some additional flexibility. Heavier tail behavior and sharper modal peaks are better adapted to such weaker concavity constraints. When paired with appropriate maximal entropy estimation criteria, these weaker constraints yield tractable, convex optimization problems that broaden the scope of shape constrained density estimation in a variety of applied subject areas.

In contrast to our prior work, Koenker and Mizera [Ann. Statist. 38 (2010) 2998–3027], that focused on the log concave ($\alpha=1$) and Hellinger ($\alpha=1/2$) constraints, here we describe methods enabling imposition of even weaker, $\alpha\leq0$ constraints. An alternative formulation of the concavity constraints for densities in dimension $d\geq2$ also significantly expands the applicability of our proposed methods for multivariate data. Finally, we illustrate the use of the Rényi divergence criterion for norm-constrained estimation of densities in the absence of a shape constraint.

Citation

Download Citation

Roger Koenker. Ivan Mizera. "Shape Constrained Density Estimation Via Penalized Rényi Divergence." Statist. Sci. 33 (4) 510 - 526, November 2018. https://doi.org/10.1214/18-STS658

Information

Published: November 2018
First available in Project Euclid: 29 November 2018

zbMATH: 07032827
MathSciNet: MR3881206
Digital Object Identifier: 10.1214/18-STS658

Rights: Copyright © 2018 Institute of Mathematical Statistics

JOURNAL ARTICLE
17 PAGES


SHARE
Vol.33 • No. 4 • November 2018
Back to Top