The asymptotic bound by the kiefer-type information inequality and its atainment

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In non-regular cases when the regularity conditions does not hold, the Chapman-Robbins (1951) inequality for the variance of unbiased estimators is well known, but the lower bound by the inequality is not attainable. In this article, we extend the Kiefer-type information inequality applicable to the non-regular case to the asymptotic situation, and we apply it to the case of a family of truncated distributions, in which the lower bound by the Kiefer-type inequality derived from an appropriate prior distribution is attained by the asymptotically unbiased estimator. It also follows from the completeness of the sufficient statistic that the lower bound is asymptotically best. Some examples are also given. © Taylor & Francis Group, LLC.

Cite

CITATION STYLE

APA

Akahira, M., & Ohyauchi, N. (2007). The asymptotic bound by the kiefer-type information inequality and its atainment. Communications in Statistics - Theory and Methods, 36(11), 2049–2059. https://doi.org/10.1080/03610920601144103

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free