minimum hellinger distance
Recently Published Documents


TOTAL DOCUMENTS

45
(FIVE YEARS 2)

H-INDEX

12
(FIVE YEARS 0)

Entropy ◽  
2018 ◽  
Vol 20 (12) ◽  
pp. 955 ◽  
Author(s):  
Yuefeng Wu ◽  
Giles Hooker

In frequentist inference, minimizing the Hellinger distance between a kernel density estimate and a parametric family produces estimators that are both robust to outliers and statistically efficient when the parametric family contains the data-generating distribution. This paper seeks to extend these results to the use of nonparametric Bayesian density estimators within disparity methods. We propose two estimators: one replaces the kernel density estimator with the expected posterior density using a random histogram prior; the other transforms the posterior over densities into a posterior over parameters through minimizing the Hellinger distance for each density. We show that it is possible to adapt the mathematical machinery of efficient influence functions from semiparametric models to demonstrate that both our estimators are efficient in the sense of achieving the Cramér-Rao lower bound. We further demonstrate a Bernstein-von-Mises result for our second estimator, indicating that its posterior is asymptotically Gaussian. In addition, the robustness properties of classical minimum Hellinger distance estimators continue to hold.


2018 ◽  
Vol 08 (01) ◽  
pp. 187-219
Author(s):  
Andrew Luong ◽  
Claire Bilodeau ◽  
Christopher Blier-Wong

2017 ◽  
Vol 9 (3) ◽  
pp. 80
Author(s):  
Roger Kadjo ◽  
Ouagnina Hili ◽  
Aubin N'dri

In this paper, we determine the Minimum Hellinger Distance estimator of a stationary GARCH process. We construct an estimator of the parameters based on the minimum Hellinger distance method. Under conditions which ensure the $\phi$-mixing of the GARCH process, we establish the almost sure convergence and the asymptotic normality of the estimator.


Sign in / Sign up

Export Citation Format

Share Document