Movatterモバイル変換


[0]ホーム

URL:


Wikipedia

Estimation theory

"Parameter estimation" redirects here; not to be confused withPoint estimation orInterval estimation.
For other uses, seeEstimation (disambiguation).

Estimation theory is a branch ofstatistics that deals with estimating the values ofparameters based on measured empirical data that has a random component. The parameters describe an underlying physical setting in such a way that their value affects the distribution of the measured data. Anestimator attempts to approximate the unknown parameters using the measurements.In estimation theory, two approaches are generally considered:[1]

  • The probabilistic approach (described in this article) assumes that the measured data is random withprobability distribution dependent on the parameters of interest
  • Theset-membership approach assumes that the measured data vector belongs to a set which depends on the parameter vector.

Examples

edit

For example, it is desired to estimate the proportion of a population of voters who will vote for a particular candidate. That proportion is the parameter sought; the estimate is based on a small random sample of voters. Alternatively, it is desired to estimate the probability of a voter voting for a particular candidate, based on some demographic features, such as age.

Or, for example, inradar the aim is to find the range of objects (airplanes, boats, etc.) by analyzing the two-way transit timing of received echoes of transmitted pulses. Since the reflected pulses are unavoidably embedded in electrical noise, their measured values are randomly distributed, so that the transit time must be estimated.

As another example, in electrical communication theory, the measurements which contain information regarding the parameters of interest are often associated with anoisysignal.

Basics

edit

For a given model, several statistical "ingredients" are needed so the estimator can be implemented. The first is astatistical sample – a set of data points taken from arandom vector (RV) of sizeN. Put into avector,x=[x[0]x[1]x[N1]].{\displaystyle \mathbf {x} ={\begin{bmatrix}x[0]\\x[1]\\\vdots \\x[N-1]\end{bmatrix}}.} Secondly, there areM parametersθ=[θ1θ2θM],{\displaystyle {\boldsymbol {\theta }}={\begin{bmatrix}\theta _{1}\\\theta _{2}\\\vdots \\\theta _{M}\end{bmatrix}},} whose values are to be estimated. Third, the continuousprobability density function (pdf) or its discrete counterpart, theprobability mass function (pmf), of the underlying distribution that generated the data must be stated conditional on the values of the parameters:p(x|θ).{\displaystyle p(\mathbf {x} |{\boldsymbol {\theta }}).\,} It is also possible for the parameters themselves to have a probability distribution (e.g.,Bayesian statistics). It is then necessary to define theBayesian probabilityπ(θ).{\displaystyle \pi ({\boldsymbol {\theta }}).\,} After the model is formed, the goal is to estimate the parameters, with the estimates commonly denotedθ^{\displaystyle {\hat {\boldsymbol {\theta }}}} , where the "hat" indicates the estimate.

One common estimator is theminimum mean squared error (MMSE) estimator, which utilizes the error between the estimated parameters and the actual value of the parameterse=θ^θ{\displaystyle \mathbf {e} ={\hat {\boldsymbol {\theta }}}-{\boldsymbol {\theta }}} as the basis for optimality. This error term is then squared and theexpected value of this squared value is minimized for the MMSE estimator.

Estimators

edit
Main article:Estimator

Commonly used estimators (estimation methods) and topics related to them include:

Examples

edit

Unknown constant in additive white Gaussian noise

edit

Consider a receiveddiscrete signal,x[n]{\displaystyle x[n]} , ofN{\displaystyle N} independentsamples that consists of an unknown constantA{\displaystyle A}  withadditive white Gaussian noise (AWGN)w[n]{\displaystyle w[n]}  with zeromean and knownvarianceσ2{\displaystyle \sigma ^{2}}  (i.e.,N(0,σ2){\displaystyle {\mathcal {N}}(0,\sigma ^{2})} ).Since the variance is known then the only unknown parameter isA{\displaystyle A} .

The model for the signal is thenx[n]=A+w[n]n=0,1,,N1{\displaystyle x[n]=A+w[n]\quad n=0,1,\dots ,N-1} 

Two possible (of many) estimators for the parameterA{\displaystyle A}  are:

Both of these estimators have amean ofA{\displaystyle A} , which can be shown through taking theexpected value of each estimatorE[A^1]=E[x[0]]=A{\displaystyle \mathrm {E} \left[{\hat {A}}_{1}\right]=\mathrm {E} \left[x[0]\right]=A} andE[A^2]=E[1Nn=0N1x[n]]=1N[n=0N1E[x[n]]]=1N[NA]=A{\displaystyle \mathrm {E} \left[{\hat {A}}_{2}\right]=\mathrm {E} \left[{\frac {1}{N}}\sum _{n=0}^{N-1}x[n]\right]={\frac {1}{N}}\left[\sum _{n=0}^{N-1}\mathrm {E} \left[x[n]\right]\right]={\frac {1}{N}}\left[NA\right]=A} 

At this point, these two estimators would appear to perform the same.However, the difference between them becomes apparent when comparing the variances.var(A^1)=var(x[0])=σ2{\displaystyle \mathrm {var} \left({\hat {A}}_{1}\right)=\mathrm {var} \left(x[0]\right)=\sigma ^{2}} andvar(A^2)=var(1Nn=0N1x[n])=independence1N2[n=0N1var(x[n])]=1N2[Nσ2]=σ2N{\displaystyle \mathrm {var} \left({\hat {A}}_{2}\right)=\mathrm {var} \left({\frac {1}{N}}\sum _{n=0}^{N-1}x[n]\right){\overset {\text{independence}}{=}}{\frac {1}{N^{2}}}\left[\sum _{n=0}^{N-1}\mathrm {var} (x[n])\right]={\frac {1}{N^{2}}}\left[N\sigma ^{2}\right]={\frac {\sigma ^{2}}{N}}} 

It would seem that the sample mean is a better estimator since its variance is lower for every N > 1.

Maximum likelihood

edit
Main article:Maximum likelihood

Continuing the example using themaximum likelihood estimator, theprobability density function (pdf) of the noise for one samplew[n]{\displaystyle w[n]}  isp(w[n])=1σ2πexp(12σ2w[n]2){\displaystyle p(w[n])={\frac {1}{\sigma {\sqrt {2\pi }}}}\exp \left(-{\frac {1}{2\sigma ^{2}}}w[n]^{2}\right)} and the probability ofx[n]{\displaystyle x[n]}  becomes (x[n]{\displaystyle x[n]}  can be thought of aN(A,σ2){\displaystyle {\mathcal {N}}(A,\sigma ^{2})} )p(x[n];A)=1σ2πexp(12σ2(x[n]A)2){\displaystyle p(x[n];A)={\frac {1}{\sigma {\sqrt {2\pi }}}}\exp \left(-{\frac {1}{2\sigma ^{2}}}(x[n]-A)^{2}\right)} Byindependence, the probability ofx{\displaystyle \mathbf {x} }  becomesp(x;A)=n=0N1p(x[n];A)=1(σ2π)Nexp(12σ2n=0N1(x[n]A)2){\displaystyle p(\mathbf {x} ;A)=\prod _{n=0}^{N-1}p(x[n];A)={\frac {1}{\left(\sigma {\sqrt {2\pi }}\right)^{N}}}\exp \left(-{\frac {1}{2\sigma ^{2}}}\sum _{n=0}^{N-1}(x[n]-A)^{2}\right)} Taking thenatural logarithm of the pdflnp(x;A)=Nln(σ2π)12σ2n=0N1(x[n]A)2{\displaystyle \ln p(\mathbf {x} ;A)=-N\ln \left(\sigma {\sqrt {2\pi }}\right)-{\frac {1}{2\sigma ^{2}}}\sum _{n=0}^{N-1}(x[n]-A)^{2}} and the maximum likelihood estimator isA^=argmaxlnp(x;A){\displaystyle {\hat {A}}=\arg \max \ln p(\mathbf {x} ;A)} 

Taking the firstderivative of the log-likelihood functionAlnp(x;A)=1σ2[n=0N1(x[n]A)]=1σ2[n=0N1x[n]NA]{\displaystyle {\frac {\partial }{\partial A}}\ln p(\mathbf {x} ;A)={\frac {1}{\sigma ^{2}}}\left[\sum _{n=0}^{N-1}(x[n]-A)\right]={\frac {1}{\sigma ^{2}}}\left[\sum _{n=0}^{N-1}x[n]-NA\right]} and setting it to zero0=1σ2[n=0N1x[n]NA]=n=0N1x[n]NA{\displaystyle 0={\frac {1}{\sigma ^{2}}}\left[\sum _{n=0}^{N-1}x[n]-NA\right]=\sum _{n=0}^{N-1}x[n]-NA} 

This results in the maximum likelihood estimatorA^=1Nn=0N1x[n]{\displaystyle {\hat {A}}={\frac {1}{N}}\sum _{n=0}^{N-1}x[n]} which is simply the sample mean.From this example, it was found that the sample mean is the maximum likelihood estimator forN{\displaystyle N}  samples of a fixed, unknown parameter corrupted by AWGN.

Cramér–Rao lower bound

edit
Further information:Cramér–Rao bound

To find theCramér–Rao lower bound (CRLB) of the sample mean estimator, it is first necessary to find theFisher information numberI(A)=E([Alnp(x;A)]2)=E[2A2lnp(x;A)]{\displaystyle {\mathcal {I}}(A)=\mathrm {E} \left(\left[{\frac {\partial }{\partial A}}\ln p(\mathbf {x} ;A)\right]^{2}\right)=-\mathrm {E} \left[{\frac {\partial ^{2}}{\partial A^{2}}}\ln p(\mathbf {x} ;A)\right]} and copying from aboveAlnp(x;A)=1σ2[n=0N1x[n]NA]{\displaystyle {\frac {\partial }{\partial A}}\ln p(\mathbf {x} ;A)={\frac {1}{\sigma ^{2}}}\left[\sum _{n=0}^{N-1}x[n]-NA\right]} 

Taking the second derivative2A2lnp(x;A)=1σ2(N)=Nσ2{\displaystyle {\frac {\partial ^{2}}{\partial A^{2}}}\ln p(\mathbf {x} ;A)={\frac {1}{\sigma ^{2}}}(-N)={\frac {-N}{\sigma ^{2}}}} and finding the negative expected value is trivial since it is now a deterministic constantE[2A2lnp(x;A)]=Nσ2{\displaystyle -\mathrm {E} \left[{\frac {\partial ^{2}}{\partial A^{2}}}\ln p(\mathbf {x} ;A)\right]={\frac {N}{\sigma ^{2}}}} 

Finally, putting the Fisher information intovar(A^)1I{\displaystyle \mathrm {var} \left({\hat {A}}\right)\geq {\frac {1}{\mathcal {I}}}} results invar(A^)σ2N{\displaystyle \mathrm {var} \left({\hat {A}}\right)\geq {\frac {\sigma ^{2}}{N}}} 

Comparing this to the variance of the sample mean (determined previously) shows that the sample mean isequal to the Cramér–Rao lower bound for all values ofN{\displaystyle N}  andA{\displaystyle A} .In other words, the sample mean is the (necessarily unique)efficient estimator, and thus also theminimum variance unbiased estimator (MVUE), in addition to being themaximum likelihood estimator.

Maximum of a uniform distribution

edit
Main article:German tank problem

One of the simplest non-trivial examples of estimation is the estimation of the maximum of a uniform distribution. It is used as a hands-on classroom exercise and to illustrate basic principles of estimation theory. Further, in the case of estimation based on a single sample, it demonstrates philosophical issues and possible misunderstandings in the use ofmaximum likelihood estimators andlikelihood functions.

Given adiscrete uniform distribution1,2,,N{\displaystyle 1,2,\dots ,N}  with unknown maximum, theUMVU estimator for the maximum is given byk+1km1=m+mk1{\displaystyle {\frac {k+1}{k}}m-1=m+{\frac {m}{k}}-1} wherem is thesample maximum andk is thesample size, sampling without replacement.[2][3] This problem is commonly known as theGerman tank problem, due to application of maximum estimation to estimates of German tank production duringWorld War II.

The formula may be understood intuitively as;

"The sample maximum plus the average gap between observations in the sample",

the gap being added to compensate for the negative bias of the sample maximum as an estimator for the population maximum.[note 1]

This has a variance of[2]1k(Nk)(N+1)(k+2)N2k2 for small samples kN{\displaystyle {\frac {1}{k}}{\frac {(N-k)(N+1)}{(k+2)}}\approx {\frac {N^{2}}{k^{2}}}{\text{ for small samples }}k\ll N} so a standard deviation of approximatelyN/k{\displaystyle N/k} , the (population) average size of a gap between samples; comparemk{\displaystyle {\frac {m}{k}}}  above. This can be seen as a very simple case ofmaximum spacing estimation.

The sample maximum is themaximum likelihood estimator for the population maximum, but, as discussed above, it is biased.

Applications

edit

Numerous fields require the use of estimation theory.Some of these fields include:

Measured data are likely to be subject tonoise or uncertainty and it is through statisticalprobability thatoptimal solutions are sought to extract as muchinformation from the data as possible.

See also

edit
Main category:Estimation theory

Notes

edit
  1. ^The sample maximum is never more than the population maximum, but can be less, hence it is abiased estimator: it will tend tounderestimate the population maximum.

References

edit

Citations

edit
  1. ^Walter, E.; Pronzato, L. (1997).Identification of Parametric Models from Experimental Data. London, England: Springer-Verlag.
  2. ^abJohnson, Roger (1994), "Estimating the Size of a Population",Teaching Statistics,16 (2 (Summer)):50–52,doi:10.1111/j.1467-9639.1994.tb00688.x
  3. ^Johnson, Roger (2006),"Estimating the Size of a Population",Getting the Best from Teaching Statistics, archived fromthe original(PDF) on November 20, 2008

Sources

edit

External links

edit

[8]ページ先頭

©2009-2025 Movatter.jp