We use a Bayesian version of the Cramer-Rao lower bound due to van Trees to give an elementary proof that the limiting distibution of any regular estimator cannot have a variance less than the classical information bound, under minimal regularity conditions. We also show how minimax convergence rates can be derived in various non- and semi-parametric problems from the van Trees inequality. Finally we develop multivariate versions of the inequality and give applications.
No takes yet. Share an insight, caveat, or question.
Gill et al. (1995) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: