Project Euclid

An approximate maximum likelihood estimate is known to be consistent under some compactness and integrability conditions. In this paper we study its convergence rate and its asymptotic efficiency in estimating smooth functionals of the parameter. We provide conditions under which the rate of convergence can be established. This rate is essentially governed by the size of the space of score functions as measured by an entropy index. We also show that, for a large class of smooth functionals, the plug-in maximum likelihood estimate is asymptotically efficient, that is, it achieves the minimal Fisher information bound. The theory is illustrated by several nonparametric or semiparametric examples.