Method of moments (statistics)

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Method of moments" statistics – news · newspapers · books · scholar · JSTOR (June 2020) (Learn how and when to remove this template message)

|

Short description: Parameter estimation technique in statistics

For the technique used to prove convergence in distribution, see Method of moments (probability theory).

In statistics, the method of moments is a method of estimation of population parameters. The same principle is used to derive higher moments like skewness and kurtosis.

It starts by expressing the population moments (i.e., the expected values of powers of the random variable under consideration) as functions of the parameters of interest. Those expressions are then set equal to the sample moments. The number of such equations is the same as the number of parameters to be estimated. Those equations are then solved for the parameters of interest. The solutions are estimates of those parameters.

The method of moments was introduced by Pafnuty Chebyshev in 1887 in the proof of the central limit theorem. The idea of matching empirical moments of a distribution to the population moments dates back at least to Pearson.[1]

## Contents

* 1 Method
* 2 Advantages and disadvantages
* 3 Alternative method of moments
* 4 Examples
* 4.1 Proving the central limit theorem
* 4.2 Uniform distribution
* 5 See also
* 6 References
* 7 External links

## Method

Suppose that the problem is to estimate [math]\displaystyle{ k }[/math] unknown parameters [math]\displaystyle{ \theta_{1}, \theta_2, \dots, \theta_k }[/math] characterizing the distribution [math]\displaystyle{ f_W(w; \theta) }[/math] of the random variable [math]\displaystyle{ W }[/math].[1] Suppose the first [math]\displaystyle{ k }[/math] moments of the true distribution (the "population moments") can be expressed as functions of the [math]\displaystyle{ \theta }[/math]s:

[math]\displaystyle{ \begin{align} \mu_1 & \equiv \operatorname E[W]=g_1(\theta_1, \theta_2, \ldots, \theta_k) , \\\\[4pt] \mu_2 & \equiv \operatorname E[W^2]=g_2(\theta_1, \theta_2, \ldots, \theta_k), \\\ & \,\,\, \vdots \\\ \mu_k & \equiv \operatorname E[W^k]=g_k(\theta_1, \theta_2, \ldots, \theta_k). \end{align} }[/math]

Suppose a sample of size [math]\displaystyle{ n }[/math] is drawn, resulting in the values [math]\displaystyle{ w_1, \dots, w_n }[/math]. For [math]\displaystyle{ j=1,\dots,k }[/math], let

[math]\displaystyle{ \widehat\mu_j = \frac{1}{n} \sum_{i=1}^n w_i^j }[/math]

be the j-th sample moment, an estimate of [math]\displaystyle{ \mu_j }[/math]. The method of moments estimator for [math]\displaystyle{ \theta_1, \theta_2, \ldots, \theta_k }[/math] denoted by [math]\displaystyle{ \widehat\theta_1, \widehat\theta_2, \dots, \widehat\theta_k }[/math] is defined to be the solution (if one exists) to the equations:[2]

[math]\displaystyle{ \begin{align} \widehat \mu_1 & = g_1(\widehat\theta_1, \widehat\theta_2, \ldots, \widehat\theta_k), \\\\[4pt] \widehat \mu_2 & = g_2(\widehat\theta_1, \widehat\theta_2, \ldots, \widehat\theta_k), \\\ & \,\,\, \vdots \\\ \widehat \mu_k & = g_k(\widehat\theta_1, \widehat\theta_2, \ldots, \widehat\theta_k). \end{align} }[/math]

The method described here for single random variables generalizes in an obvious manner to multiple random variables leading to multiple choices for moments to be used. Different choices generally lead to different solutions [5], [6].

## Advantages and disadvantages

The method of moments is fairly simple and yields consistent estimators (under very weak assumptions), though these estimators are often biased.

It is an alternative to the method of maximum likelihood.

However, in some cases the likelihood equations may be intractable without computers, whereas the method-of-moments estimators can be computed much more quickly and easily. Due to easy computability, method-of-moments estimates may be used as the first approximation to the solutions of the likelihood equations, and successive improved approximations may then be found by the Newton-Raphson method. In this way the method of moments can assist in finding maximum likelihood estimates.

In some cases, infrequent with large samples but less infrequent with small samples, the estimates given by the method of moments are outside of the parameter space (as shown in the example below); it does not make sense to rely on them then. That problem never arises in the method of maximum likelihood[3] Also, estimates by the method of moments are not necessarily sufficient statistics, i.e., they sometimes fail to take into account all relevant information in the sample.

When estimating other structural parameters (e.g., parameters of a utility function, instead of parameters of a known probability distribution), appropriate probability distributions may not be known, and moment-based estimates may be preferred to maximum likelihood estimation.

## Alternative method of moments

The equations to be solved in the method of moments (MoM) are in general nonlinear and there are no generally applicable guarantees that tractable solutions exist[citation needed]. But there is an alternative approach to using sample moments to estimate data model parameters in terms of known dependence of model moments on these parameters, and this alternative requires the solution of only linear equations or, more generally, tensor equations. This alternative is referred to as the Bayesian-Like MoM (BL-MoM), and it differs from the classical MoM in that it uses optimally weighted sample moments. Considering that the MoM is typically motivated by a lack of sufficient knowledge about the data model to determine likelihood functions and associated a posteriori probabilities of unknown or random parameters, it is odd that there exists a type of MoM that is Bayesian-Like. But the particular meaning of Bayesian-Like leads to a problem formulation in which required knowledge of a posteriori probabilities is replaced with required knowledge of only the dependence of model moments on unknown model parameters, which is exactly the knowledge required by the traditional MoM [1],[2],[5]–[9]. The BL-MoM also uses knowledge of a priori probabilities of the parameters to be estimated, when available, but otherwise uses uniform priors.[citation needed]

The BL-MoM has been reported on in only the applied statistics literature in connection with parameter estimation and hypothesis testing using observations of stochastic processes for problems in Information and Communications Theory and, in particular, communications receiver design in the absence of knowledge of likelihood functions or associated a posteriori probabilities [10] and references therein. In addition, the restatement of this receiver design approach for stochastic process models as an alternative to the classical MoM for any type of multivariate data is available in tutorial form at the university website [11, page 11.4]. The applications in [10] and references demonstrate some important characteristics of this alternative to the classical MoM, and a detailed list of relative advantages and disadvantages is given in [11, page 11.4], but the literature is missing direct comparisons in specific applications of the classical MoM and the BL-MoM.[citation needed]

## Examples

An example application of the method of moments is to estimate polynomial probability density distributions. In this case, an approximating polynomial of order [math]\displaystyle{ N }[/math] is defined on an interval [math]\displaystyle{ [a,b] }[/math]. The method of moments then yields a system of equations, whose solution involves the inversion of a Hankel matrix.[2]

### Proving the central limit theorem

Let [math]\displaystyle{ X_1, X_2, \cdots }[/math] be independent random variables with mean 0 and variance 1, then let [math]\displaystyle{ S_n := \frac{1}{\sqrt n}\sum_{i=1}^n X_i }[/math]. We can compute the moments of [math]\displaystyle{ S_n }[/math] as[math]\displaystyle{ E[S_n^0] = 1, E[S_n^1] = 0, E[S_n^2] = 1, E[S_n^3] = 0, \cdots }[/math]Explicit expansion shows that[math]\displaystyle{ E[S_n^{2k+1}] = 0; \quad E[S_n^{2k}] = \frac{\binom{n}{k}\frac{(2k)!}{2^k}}{n^{k}} = \frac{n(n-1)\cdots(n-k+1)}{n^k} (2k-1)!! }[/math]where the numerator is the number of ways to select [math]\displaystyle{ k }[/math] distinct pairs of balls by picking one each from [math]\displaystyle{ 2k }[/math] buckets, each containing balls numbered from [math]\displaystyle{ 1 }[/math] to [math]\displaystyle{ n }[/math]. At the [math]\displaystyle{ n \to \infty }[/math] limit, all moments converge to that of a standard normal distribution. More analysis then show that this convergence in moments imply a convergence in distribution.

Essentially this argument was published by Chebyshev in 1887.[3]

### Uniform distribution

Consider the uniform distribution on the interval [math]\displaystyle{ [a,b] }[/math], [math]\displaystyle{ U(a,b) }[/math]. If [math]\displaystyle{ W\sim U(a,b) }[/math] then we have

[math]\displaystyle{ \mu_1 = \operatorname E[W]=\frac{1}{2}(a+b) }[/math]

[math]\displaystyle{ \mu_2 = \operatorname E[W^2]=\frac{1}{3}(a^2+ab+b^2) }[/math]

Solving these equations gives

[math]\displaystyle{ \widehat{a} = \mu_1 - \sqrt{3\left(\mu_2-\mu_1^2\right)} }[/math]

[math]\displaystyle{ \widehat{b} = \mu_1 + \sqrt{3\left(\mu_2-\mu_1^2\right)} }[/math]

Given a set of samples [math]\displaystyle{ \\{w_i\\} }[/math] we can use the sample moments [math]\displaystyle{ \widehat{\mu}_1 }[/math] and [math]\displaystyle{ \widehat{\mu}_2 }[/math] in these formulae in order to estimate [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math].

Note, however, that this method can produce inconsistent results in some cases. For example, the set of samples [math]\displaystyle{ \\{0,0,0,0,1\\} }[/math] results in the estimate [math]\displaystyle{ \widehat{a}=\frac{1}{5}-\frac{2\sqrt{3}}{5}, \widehat{b}=\frac{1}{5}+\frac{2\sqrt{3}}{5} }[/math] even though [math]\displaystyle{ \widehat{b}\lt 1 }[/math] and so it is impossible for the set [math]\displaystyle{ \\{0,0,0,0,1\\} }[/math] to have been drawn from [math]\displaystyle{ U(\widehat{a},\widehat{b}) }[/math] in this case.

## See also

* Generalized method of moments
* Decoding methods

## References

1. ↑ Kimiko O. Bowman and L. R. Shenton, "Estimator: Method of Moments", pp 2092–2098, Encyclopedia of statistical sciences, Wiley (1998).
2. ↑ J. Munkhammar, L. Mattsson, J. Rydén (2017) "Polynomial probability distribution estimation using the method of moments". PLoS ONE 12(4): e0174573. https://doi.org/10.1371/journal.pone.0174573
3. ↑ Fischer, Hans (2011). "4. Chebyshev’s and Markov’s Contributions". History of the central limit theorem : from classical to modern probability theory. New York: Springer. ISBN 978-0-387-87857-7. OCLC 682910965. https://www.worldcat.org/oclc/682910965.

[4] Pearson, K. (1936), "Method of Moments and Method of Maximum Likelihood", Biometrika 28(1/2), 35–59.

[5] Lindsay, B.G. & Basak P. (1993). “Multivariate normal mixtures: a fast consistent method of moments”, Journal of the American Statistical Association 88, 468–476.

[6] Quandt, R.E. & Ramsey, J.B. (1978). “Estimating mixtures of normal distributions and switching regressions”, Journal of the American Statistical Association 73, 730–752.

[7] https://real-statistics.com/distribution-fitting/method-of-moments/

[8] Hansen, L. (1982). “Large sample properties of generalized method of moments estimators”, Econometrica 50, 1029–1054.

[9] Lindsay, B.G. (1982). “Conditional score functions: some optimality results”, Biometrika 69, 503–512.

[10] Gardner, W.A., “Design of nearest prototype signal classifiers”, IEEE Transactions on Information Theory 27 (3), 368–372,1981

## External links

* Cyclostationarity

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Method of moments (statistics). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Method_of_moments_(statistics)&oldid=3377327"