2018
DOI: 10.1002/sta4.202
|View full text |Cite
|
Sign up to set email alerts
|

A practical implementation of weighted kernel density estimation for handling shape constraints

Abstract: The weighted kernel density estimator is an attractive option for shape-restricted density estimation, because it is simple, familiar, and potentially applicable to many different shape constraints. Despite this, no reliable software implementation has appeared since the method's original proposal in 2002. We found that serious numerical and practical difficulties arise when attempting to implement the method. We overcame these difficulties and in the process discovered that the weighted method and our own rec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 20 publications
0
12
0
Order By: Relevance
“…However, the method is ad hoc, and asymptotic convergence of the estimates, although seen empirically, is not guaranteed. Very recently, Wolters and Braun (2018) introduced a technique that solves the limitations of the approach in Hall and Huang (2002). Specifically, they provide an algorithm to find a constrained estimate that is the nearest to an unconstrained kernel density estimate (under the integrated squared error loss function), and that can handle up to bimodal constraints.…”
Section: Challenges and Current Literaturementioning
confidence: 99%
See 3 more Smart Citations
“…However, the method is ad hoc, and asymptotic convergence of the estimates, although seen empirically, is not guaranteed. Very recently, Wolters and Braun (2018) introduced a technique that solves the limitations of the approach in Hall and Huang (2002). Specifically, they provide an algorithm to find a constrained estimate that is the nearest to an unconstrained kernel density estimate (under the integrated squared error loss function), and that can handle up to bimodal constraints.…”
Section: Challenges and Current Literaturementioning
confidence: 99%
“…The shape constraint is fully captured in the initial template itself. As a result, the subsequent estimation of the transformation is independent of the constraint, providing much greater stability in practical performance with respect to higher modality constraints than methods such as Wolters and Braun (2018).…”
Section: Proposed Formulation and Its Noveltymentioning
confidence: 99%
See 2 more Smart Citations
“…We will propose an algorithm to sample parameters from a KDE while the parameters are subject to a linear equality constraint. Our work differs from [17], [18] because these works consider (shape) constraints on the estimated pdf. The proposed algorithm can be regarded as a generalization of the conditional density estimation in [19].…”
Section: Introductionmentioning
confidence: 99%