Inverse-variance weighting combines estimates of the same quantity by giving a more precise estimate a larger weight. Suppose are independent, unbiased estimators of , with known variances . For normalized weights,
The inverse is taken after squaring the standard uncertainty: twice the standard uncertainty gives one quarter as much weight. The corresponding weighted least squares criterion is ; differentiating it with respect to gives the same weighted arithmetic mean.[ref]
The optimality statement is precise. Any linear unbiased estimator requires . By the Cauchy-Schwarz inequality,
Equality holds for the displayed weights. Thus they minimize variance among linear unbiased combinations under these assumptions; a normal distribution is not needed for that proof.
For an original example, combine observed values 10 and 14 with standard uncertainties 1 and 2 in the same units. The normalized weights are and , giving estimate , variance and standard uncertainty approximately . Equal weights give 12 and standard uncertainty .
Correlated errors change the problem. A contribution common to every reading survives every weighting whose coefficients sum to one; precision limits of weighting correlated repeats derives the resulting floor. More generally, use the full covariance matrix and generalized least squares rather than treating correlated readings as independent.[ref] Uncertainty in estimated inverse-variance weights is another limitation: variances estimated from the same data are not fixed known quantities, and an accidentally tiny estimated variance does not justify arbitrary confidence.
Uncertainty in estimated inverse-variance weights arises when the variances used in inverse-variance weighting are themselves estimated. A very small estimated variance can give one observation or group a large random weight. The familiar variance formula for fixed, known weights cannot simply be reused with estimated variances treated as exact. NIST specifically warns that weights estimated from few replicates can substantially and unpredictably affect a weighted least squares analysis.[ref]
Suppose independent groups contain independent normal random variables with common mean and group variance . Let and be the group sample mean and unbiased sample variance, and form
For normal samples, each sample mean is independent of its sample variance. Conditional on the estimated weights, the estimator remains unbiased and has
Thus the law of total variance gives unconditional variance equal to the expectation of this expression. The true still appear; replacing them by the same random does not establish the actual conditional variance. Outside the independence assumptions, even conditional unbiasedness can fail.
An original two-group example takes and true , so each group mean has variance . If observed sample variances are and , the estimated normalized weights are and . For group means and , the combined estimate is . The plug-in variance is
but the true conditional variance under the stipulated model is
The corresponding standard deviations are about and . Equal weights would have variance . An accidentally small estimated variance has both overstated precision and moved the combination away from the optimal equal weights in this example.
Reciprocal moments of an estimated variance explain the unstable precision estimate. For a normal sample with , has a chi-squared distribution. Integrating its density gives
Consequently for , while the second moment requires . The density and its gamma-distribution parameterization are documented in the primary SciPy implementation notes.[ref] With , the inverse sample variance has a finite mean twice the true precision and an infinite variance; the normalized weights remain bounded, so this does not imply their variance is infinite.
More replication or a justified smooth variance model can stabilize weights. NIST describes direct replicate-based weight estimation and variance-function modeling as distinct approaches.[ref] A proposed validation repeats the complete weight-estimation and combination procedure on simulated or replicated groups, checking actual interval coverage as well as point estimates. A bootstrap must reproduce the weight-estimation stage; holding the fitted weights fixed tests a different procedure.
Weighted centering matrix 2026-11-05
A weighted centering matrix subtracts the same weighted mean from every component of a vector. Let satisfy and , where has every component equal to one. Define
Then and . The centered vector has zero weighted mean; its unweighted component sum need not vanish.
The projection properties follow directly from normalization:
Also , so its kernel of a linear map is , its range is and its rank is . It is an idempotent matrix. For unequal weights it is generally not symmetric: it projects onto the zero-weighted-mean subspace along the constant-vector direction, an oblique projection in ordinary Euclidean geometry.
For an original example, and give and . The weighted mean is zero, while the ordinary mean is . Euclidean orthogonal projection of onto the same line instead gives .
Figure 1.
Weighted centering and Euclidean orthogonal projection reach different points on the same zero-weighted-mean line
. Original two-coordinate example with and . The orange arrow subtracts from both components; the dashed arrow is perpendicular to the green line in the Euclidean metric. Details.
If every , put . Then , so this same map is orthogonal for the inner product . It is the residual-making map for minimizing over a fitted constant , the intercept-only case of weighted least squares.[ref] Zero weights preserve the algebraic projection but make this proposed inner product degenerate. When all weights equal , the construction reduces to the usual centering matrix.