# Weighted arithmetic mean

(Redirected from Weighted average)
"Weighted mean" redirects here. For the geometric mean, see weighted geometric mean. For the harmonic mean, see weighted harmonic mean.

The weighted mean is similar to an arithmetic mean (the most common type of average), where instead of each of the data points contributing equally to the final average, some data points contribute more than others. The notion of weighted mean plays a role in descriptive statistics and also occurs in a more general form in several other areas of mathematics.

If all the weights are equal, then the weighted mean is the same as the arithmetic mean. While weighted means generally behave in a similar fashion to arithmetic means, they do have a few counterintuitive properties, as captured for instance in Simpson's paradox.

## Examples

### Basic example

Given two school classes, one with 20 students, and one with 30 students, the grades in each class on a test were:

Morning class = 62, 67, 71, 74, 76, 77, 78, 79, 79, 80, 80, 81, 81, 82, 83, 84, 86, 89, 93, 98
Afternoon class = 81, 82, 83, 84, 85, 86, 87, 87, 88, 88, 89, 89, 89, 90, 90, 90, 90, 91, 91, 91, 92, 92, 93, 93, 94, 95, 96, 97, 98, 99

The straight average for the morning class is 80 and the straight average of the afternoon class is 90. The straight average of 80 and 90 is 85, the mean of the two class means. However, this does not account for the difference in number of students in each class (20 versus 30); hence the value of 85 does not reflect the average student grade (independent of class). The average student grade can be obtained by averaging all the grades, without regard to classes (add all the grades up and divide by the total number of students):

$\bar{x} = \frac{4300}{50} = 86.$

Or, this can be accomplished by weighting the class means by the number of students in each class (using a weighted mean of the class means):

$\bar{x} = \frac{(20\times80) + (30\times90)}{20 + 30} = 86.$

Thus, the weighted mean makes it possible to find the average student grade in the case where only the class means and the number of students in each class are available.

### Convex combination example

Since only the relative weights are relevant, any weighted mean can be expressed using coefficients that sum to one. Such a linear combination is called a convex combination.

Using the previous example, we would get the following:

$\frac{20}{20 + 30} = 0.4\,$
$\frac{30}{20 + 30} = 0.6\,$
$\bar{x} = \frac{(0.4\times80) + (0.6\times90)}{0.4 + 0.6} = 86.$

This simplifies to:

$\bar{x} = (0.4\times80) + (0.6\times90) = 86.$

## Mathematical definition

It has been suggested that portions of  be moved or incorporated into this section. (Discuss)

Formally, the weighted mean of a non-empty set of data

$\{x_1, x_2, \dots , x_n\},$

with non-negative weights

$\{w_1, w_2, \dots, w_n\},$

is the quantity

$\bar{x} = \frac{ \sum_{i=1}^n w_i x_i}{\sum_{i=1}^n w_i},$

which means:

$\bar{x} = \frac{w_1 x_1 + w_2 x_2 + \cdots + w_n x_n}{w_1 + w_2 + \cdots + w_n}.$

Therefore data elements with a high weight contribute more to the weighted mean than do elements with a low weight. The weights cannot be negative. Some may be zero, but not all of them (since division by zero is not allowed).

The formulas are simplified when the weights are normalized such that they sum up to $1$, i.e. $\sum_{i=1}^n {w_i} = 1$. For such normalized weights the weighted mean is simply $\bar {x} = \sum_{i=1}^n {w_i x_i}$.

Note that one can always normalize the weights by making the following transformation on the weights $w_i' = \frac{w_i}{\sum_{j=1}^n{w_j}}$. Using the normalized weight yields the same results as when using the original weights. Indeed,

$\bar{x} = \sum_{i=1}^n w'_i x_i= \sum_{i=1}^n \frac{w_i}{\sum_{j=1}^n w_j} x_i = \frac{ \sum_{i=1}^n w_i x_i}{\sum_{j=1}^n w_j} = \frac{ \sum_{i=1}^n w_i x_i}{\sum_{i=1}^n w_i}.$

The common mean $\frac {1}{n}\sum_{i=1}^n {x_i}$ is a special case of the weighted mean where all data have equal weights, $w_i=w$. When the weights are normalized then $w_i'=\frac{1}{n}.$

## Statistical properties

The weighted sample mean, $\bar{x}$, with normalized weights (weights summing to one) is itself a random variable. Its expected value and standard deviation are related to the expected values and standard deviations of the observations as follows,

If the observations have expected values

$E(x_i )=\bar {x_i},$

then the weighted sample mean has expectation

$E(\bar{x}) = \sum_{i=1}^n {w_i \bar{x_i}}.$

Particularly, if the expectations of all observations are equal, $\bar {x_i}=c$, then the expectation of the weighted sample mean will be the same,

$E(\bar{x})= c. \,$

For uncorrelated observations with standard deviations $\sigma_i$, the weighted sample mean has standard deviation

$\sigma(\bar x)= \sqrt {\sum_{i=1}^n {w_i^2 \sigma^2_i}}.$

Consequently, when the standard deviations of all observations are equal, $\sigma_i=d$, the weighted sample mean will have standard deviation $\sigma(\bar x)= d \sqrt {V_2}$. Here $V_2$ is the quantity

$V_2=\sum_{i=1}^n {w_i^2},$

such that $1/n \le V_2\le 1$. It attains its minimum value for equal weights, and its maximum when all weights except one are zero. In the former case we have $\sigma(\bar x)=d/ \sqrt {n}$, which is related to the central limit theorem.

Note that due to the fact that one can always transform non-normalized weights to normalized weights all formula in this section can be adapted to non-normalized weights by replacing all $w_i$ by $w_i' = \frac{w_i}{\sum_{i=1}^n{w_i}}$.

## Dealing with variance

See also: Least squares#Weighted least squares

For the weighted mean of a list of data for which each element $x_i\,\!$ comes from a different probability distribution with known variance ${\sigma_i}^2\,$, one possible choice for the weights is given by:

$w_i = \frac{1}{\sigma_i^2}.$

The weighted mean in this case is:

$\bar{x} = \frac{ \sum_{i=1}^n (x_iw_i)}{\sum_{i=1}^n w_i},$

and the variance of the weighted mean is:

$\sigma_{\bar{x}}^2 = \frac{ 1 }{\sum_{i=1}^n w_i},$

which reduces to $\sigma_{\bar{x}}^2 = \frac{ {\sigma_0}^2 }{n}$, when all $\sigma_i = \sigma_0.\,$

The significance of this choice is that this weighted mean is the maximum likelihood estimator of the mean of the probability distributions under the assumption that they are independent and normally distributed with the same mean.

### Correcting for over- or under-dispersion

Weighted means are typically used to find the weighted mean of experimental data, rather than theoretically generated data. In this case, there will be some error in the variance of each data point. Typically experimental errors may be underestimated due to the experimenter not taking into account all sources of error in calculating the variance of each data point. In this event, the variance in the weighted mean must be corrected to account for the fact that $\chi^2$ is too large. The correction that must be made is

$\sigma_{\bar{x}}^2 \rightarrow \sigma_{\bar{x}}^2 \chi^2_\nu \,$

where $\chi^2_\nu$ is $\chi^2$ divided by the number of degrees of freedom, in this case n − 1. This gives the variance in the weighted mean as:

$\sigma_{\bar{x}}^2 = \frac{ 1 }{\sum_{i=1}^n 1/{\sigma_i}^2} \times \frac{1}{(n-1)} \sum_{i=1}^n \frac{ (x_i - \bar{x} )^2}{ \sigma_i^2 };$

when all data variances are equal, $\sigma_i = \sigma_0$, they cancel out in the weighted mean variance, $\sigma_{\bar{x}}^2$, which then reduces to the standard error of the mean (squared), $\sigma_{\bar{x}}^2 = \sigma^2/n$, in terms of the sample standard deviation (squared), $\sigma^2 = \sum_{i=1}^n (x_i - \bar{x} )^2 / (n-1)$.

## Weighted sample variance

Typically when a mean is calculated it is important to know the variance and standard deviation about that mean. When a weighted mean $\mu^*$ is used, the variance of the weighted sample is different from the variance of the unweighted sample. The biased weighted sample variance is defined similarly to the normal biased sample variance:

$\sigma^2\ = \frac{ \sum_{i=1}^N{\left(x_i - \mu\right)^2} }{ N }$
$\sigma^2_\mathrm{weighted} = \frac{\sum_{i=1}^N w_i \left(x_i - \mu^*\right)^2 }{V_1}$

where $V_1 = \sum_{i=1}^n w_i$, which is 1 for normalized weights.

For small samples, it is customary to use an unbiased estimator for the population variance. In normal unweighted samples, the N in the denominator (corresponding to the sample size) is changed to N − 1. While this is simple in unweighted samples, it is not straightforward when the sample is weighted.

If each $x_i$ is drawn from a Gaussian distribution with variance $1/w_i$, the unbiased estimator of a weighted population variance is given by:[1]

$s^2\ = \frac {V_1} {V_1^2-V_2} \sum_{i=1}^N w_i \left(x_i - \mu^*\right)^2,$

where $V_2 = \sum_{i=1}^n {w_i^2}$ as introduced previously. The degrees of freedom of the weighted, unbiased sample variance vary accordingly from N − 1 down to 0.

The standard deviation is simply the square root of the variance above.

If all of the $x_i$ are drawn from the same distribution and the integer weights $w_i$ indicate frequency of occurrence in the sample, then the unbiased estimator of the weighted population variance is given by

$s^2\ = \frac {1} {V_1 - 1} \sum_{i=1}^N w_i \left(x_i - \mu^*\right)^2,$

If all $x_i$ are unique, then $N$ counts the number of unique values, and $V_1$ counts the number of samples.

For example, if values $\{2, 2, 4, 5, 5, 5\}$ are drawn from the same distribution, then we can treat this set as an unweighted sample, or we can treat it as the weighted sample $\{2, 4, 5\}$ with corresponding weights $\{2, 1, 3\}$, and we should get the same results.

## Vector-valued estimates

The above generalizes easily to the case of taking the mean of vector-valued estimates. For example, estimates of position on a plane may have less certainty in one direction than another. As in the scalar case, the weighted mean of multiple estimates can provide a maximum likelihood estimate. We simply replace $\sigma^2$ by the covariance matrix:[2]

$W_i = \Sigma_i^{-1}.$

The weighted mean in this case is:

$\bar{\mathbf{x}} = \left(\sum_{i=1}^n \Sigma_i^{-1}\right)^{-1}\left(\sum_{i=1}^n \Sigma_i^{-1} \mathbf{x}_i\right),$

and the covariance of the weighted mean is:

$\Sigma_{\bar{\mathbf{x}}} = \left(\sum_{i=1}^n \Sigma_i^{-1}\right)^{-1},$

For example, consider the weighted mean of the point [1 0] with high variance in the second component and [0 1] with high variance in the first component. Then

$\mathbf{x}_1 := [1 0]^\top, \qquad \Sigma_1 := \begin{bmatrix}1 & 0\\ 0 & 100\end{bmatrix}$
$\mathbf{x}_2 := [0 1]^\top, \qquad \Sigma_2 := \begin{bmatrix}100 & 0\\ 0 & 1\end{bmatrix}$

then the weighted mean is:

$\bar{\mathbf{x}} = \left(\Sigma_1^{-1} + \Sigma_2^{-1}\right)^{-1} \left(\Sigma_1^{-1} \mathbf{x}_1 + \Sigma_2^{-1} \mathbf{x}_2\right)$
$=\begin{bmatrix} 0.9901 &0\\ 0& 0.9901\end{bmatrix}\begin{bmatrix}1\\1\end{bmatrix} = \begin{bmatrix}0.9901 \\ 0.9901\end{bmatrix}$

which makes sense: the [1 0] estimate is "compliant" in the second component and the [0 1] estimate is compliant in the first component, so the weighted mean is nearly [1 1].

## Accounting for correlations

In the general case, suppose that $\mathbf{X}=[x_1,\dots,x_n]$, $\mathbf{C}$ is the covariance matrix relating the quantities $x_i$, $\bar{x}$ is the common mean to be estimated, and $\mathbf{W}$ is the design matrix [1, ..., 1] (of length $n$). The Gauss–Markov theorem states that the estimate of the mean having minimum variance is given by:

$\sigma^2_\bar{x}=(\mathbf{W}^T \mathbf{C}^{-1} \mathbf{W})^{-1},$

and

$\bar{x} = \sigma^2_\bar{x} (\mathbf{W}^T \mathbf{C}^{-1} \mathbf{X}).$

## Decreasing strength of interactions

Consider the time series of an independent variable $x$ and a dependent variable $y$, with $n$ observations sampled at discrete times $t_i$. In many common situations, the value of $y$ at time $t_i$ depends not only on $x_i$ but also on its past values. Commonly, the strength of this dependence decreases as the separation of observations in time increases. To model this situation, one may replace the independent variable by its sliding mean $z$ for a window size $m$.

$z_k=\sum_{i=1}^m w_i x_{k+1-i}.$
Range weighted mean interpretation
Range (1–5) Weighted mean equivalence
3.34–5.00 Strong
1.67–3.33 Satisfactory
0.00–1.66 Weak

## Exponentially decreasing weights

In the scenario described in the previous section, most frequently the decrease in interaction strength obeys a negative exponential law. If the observations are sampled at equidistant times, then exponential decrease is equivalent to decrease by a constant fraction $0<\Delta<1$ at each time step. Setting $w=1-\Delta$ we can define $m$ normalized weights by

$w_i=\frac {w^{i-1}}{V_1}$,

where $V_1$ is the sum of the unnormalized weights. In this case $V_1$ is simply

$V_1=\sum_{i=1}^m{w^{i-1}} = \frac {1-w^{m}}{1-w}$,

approaching $V_1=1/(1-w)$ for large values of $m$.

The damping constant $w$ must correspond to the actual decrease of interaction strength. If this cannot be determined from theoretical considerations, then the following properties of exponentially decreasing weights are useful in making a suitable choice: at step $(1-w)^{-1}$, the weight approximately equals ${e^{-1}}(1-w)=0.39(1-w)$, the tail area the value $e^{-1}$, the head area ${1-e^{-1}}=0.61$. The tail area at step $n$ is $\le {e^{-n(1-w)}}$. Where primarily the closest $n$ observations matter and the effect of the remaining observations can be ignored safely, then choose $w$ such that the tail area is sufficiently small.

## Weighted averages of functions

The concept of weighted average can be extended to functions.[3] Weighted averages of functions play an important role in the systems of weighted differential and integral calculus.[4]

## Notes

1. James, Frederick (2006). Statistical Methods in Experimental Physics (2nd ed.). Singapore: World Scientific. p. 324. ISBN 981-270-527-9.
2. G. H. Hardy, J. E. Littlewood, and G. Pólya. Inequalities (2nd ed.), Cambridge University Press, ISBN 978-0-521-35880-4, 1988.
3. Jane Grossman, Michael Grossman, Robert Katz. The First Systems of Weighted Differential and Integral Calculus, ISBN 0-9771170-1-4, 1980.

### Further reading

• Bevington, Philip R (1969). Data Reduction and Error Analysis for the Physical Sciences. New York, N.Y.: McGraw-Hill. OCLC 300283069.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 110, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9016491174697876, "perplexity_flag": "head"}