A generalization of inverse probability weighting
Section 5. The generalized Godambe-Joshi lower bound
For any unbiased estimator of the population total if is the variance of under the sampling plan, Godambe and Joshi (1965) have given a lower bound for the value of under the assumption that the variance matrix was diagonal. That lower bound is the sum of the elements of the diagonal matrix That result is generalized in the following paragraph.
For any linear unbiased total estimator, if is positive definite, then is not lower than the sum of the elements of the matrix It is easily verified that the usual Godambe-Joshi lower bound is obtained if is diagonal.
Just as the calibration estimator asymptotically attains the Godambe-Joshi lower bound, the generalized calibration estimator with asymptotically attains the generalized Godambe-Joshi lower bound, regardless of the value of the matrices and The link between the value of those three matrices and the value of is not examined in this paper, but the calibration problem stated in Section 3 does clarify the role of each of those matrices. The derivation of the generalized lower bound and the proof of the optimality of the generalized calibration estimator are given in Théberge (2017).
The fact that asymptotically attains the generalized Godambe-Joshi lower bound shows that the generalized inverse probability estimator performs well when applied to residuals, as it does in (3.1), even though it is not recommended in general. Similarly, the ordinary inverse probability estimator can be inefficient if the sample size is random, but will perform well if applied to residuals.
It should be noted that, contrary to the ordinary Godambe-Joshi lower bound, the generalized lower bound applies only to linear unbiased estimators. In fact, an example with not diagonal, of a non-linear unbiased estimator which does better than the lower bound is given in Théberge (2017).
- Date modified: