Hájek–Le Cam convolution theorem
Introduction In statistics, the '''Hájek–Le Cam convolution theorem''' states that any regular estimator in a parametric model is asymptotically equivalent to a sum of two independent random variables, one of which is normal with asymptotic variance equal to the inverse of Fisher information, and the other having arbitrary distribution.The obvious corollary from this theorem is that the “best” among regular estimators are those with the second component identically equal to zero. Such estimators are called '''efficient''' and are known to always exist for regular parametric models.The theorem is named after Jaroslav Hájek and Lucien Le Cam.
Statement Let ℘ = {''Pθ'' | ''θ'' ∈ Θ ⊂ ℝ''k''} be a regular parametric model, and ''q''(''θ''): Θ → ℝ''m'' be a parameter in this model (typically a parameter is just one of the components of vector ''θ''). Assume that function ''q'' is differentiable on Θ, with the ''m × k'' matrix of derivatives denoted as ''q̇θ''. Define:   — the ''information bound'' for ''q'',:   — the ''efficient influence function'' for ''q'',where ''I''(''θ'') is the Fisher information matrix for model ℘,  is the score function, and ′ denotes matrix transpose. '''Theorem''' . Suppose ''Tn'' is a uniformly (locally) regular estimator of the parameter ''q''. Then There exist independent random ''m''-vectors  and ''Δθ'' such that: where ''d'' denotes convergence in distribution. More specifically,:  If the map ''θ'' → ''q̇θ'' is continuous, then the convergence in (A) holds uniformly on compact subsets of Θ. Moreover, in that case Δ''θ'' = 0 for all ''θ'' if and only if ''Tn'' is uniformly (locally) asymptotically linear with influence function ''ψ''''q''(''θ'')
References *