Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Estimator

From Wikipedia, the free encyclopedia
Rule for calculating an estimate of a given quantity based on observed data

Instatistics, anestimator is a rule for calculating anestimate of a givenquantity based onobserved data: thus the rule (the estimator), the quantity of interest (theestimand) and its result (the estimate) are distinguished.[1] For example, thesample mean is a commonly used estimator of thepopulation mean.

There arepoint andinterval estimators. Thepoint estimators yield single-valued results. This is in contrast to aninterval estimator, where the result would be a range of plausible values. "Single value" does not necessarily mean "single number", but includes vector valued or function valued estimators.

Estimation theory is concerned with the properties of estimators; that is, with defining properties that can be used to compare different estimators (different rules for creating estimates) for the same quantity, based on the same data. Such properties can be used to determine the best rules to use under given circumstances. However, inrobust statistics, statistical theory goes on to consider the balance between having good properties, if tightly defined assumptions hold, and having worse properties that hold under wider conditions.

Background

[edit]

An "estimator" or "point estimate" is astatistic (that is, a function of the data) that is used to infer the value of an unknownparameter in astatistical model. A common way of phrasing it is "the estimator is the method selected to obtain an estimate of an unknown parameter". The parameter being estimated is sometimes called theestimand. It can be either finite-dimensional (inparametric andsemi-parametric models), or infinite-dimensional (semi-parametric andnon-parametric models).[2] If the parameter is denotedθ{\displaystyle \theta } then the estimator is traditionally written by adding acircumflex over the symbol:θ^{\displaystyle {\widehat {\theta }}}. Being a function of the data, the estimator is itself arandom variable; a particular realization of this random variable is called the "estimate". Sometimes the words "estimator" and "estimate" are used interchangeably.

The definition places virtually no restrictions on which functions of the data can be called the "estimators". The attractiveness of different estimators can be judged by looking at their properties, such asunbiasedness,mean square error,consistency,asymptotic distribution, etc. The construction and comparison of estimators are the subjects of theestimation theory. In the context ofdecision theory, an estimator is a type ofdecision rule, and its performance may be evaluated through the use ofloss functions.

When the word "estimator" is used without a qualifier, it usually refers to point estimation. The estimate in this case is a single point in theparameter space. There also exists another type of estimator:interval estimators, where the estimates are subsets of the parameter space.

The problem ofdensity estimation arises in two applications. Firstly, in estimating theprobability density functions of random variables and secondly in estimating thespectral density function of atime series. In these problems the estimates are functions that can be thought of as point estimates in an infinite dimensional space, and there are corresponding interval estimation problems.

Definition

[edit]

Suppose a fixedparameterθ{\displaystyle \theta } needs to be estimated. Then an "estimator" is a function that maps thesample space to a set ofsample estimates. An estimator ofθ{\displaystyle \theta } is usually denoted by the symbolθ^{\displaystyle {\widehat {\theta }}}. It is often convenient to express the theory using thealgebra of random variables: thus ifX is used to denote arandom variable corresponding to the observed data, the estimator (itself treated as a random variable) is symbolised as a function of that random variable,θ^(X){\displaystyle {\widehat {\theta }}(X)}. The estimate for a particular observed data valuex{\displaystyle x} (i.e. forX=x{\displaystyle X=x}) is thenθ^(x){\displaystyle {\widehat {\theta }}(x)}, which is a fixed value. Often an abbreviated notation is used in whichθ^{\displaystyle {\widehat {\theta }}} is interpreted directly as arandom variable, but this can cause confusion.

Quantified properties

[edit]

The following definitions and attributes are relevant.[3]

Error

[edit]

For a given samplex{\displaystyle x}, the "error" of the estimatorθ^{\displaystyle {\widehat {\theta }}} is defined as

e(x)=θ^(x)θ,{\displaystyle e(x)={\widehat {\theta }}(x)-\theta ,}

whereθ{\displaystyle \theta } is the parameter being estimated. The error,e, depends not only on the estimator (the estimation formula or procedure), but also on the sample.

Mean squared error

[edit]

Themean squared error ofθ^{\displaystyle {\widehat {\theta }}} is defined as the expected value (probability-weighted average, over all samples) of the squared errors; that is,

MSE(θ^)=E[(θ^(X)θ)2].{\displaystyle \operatorname {MSE} ({\widehat {\theta }})=\operatorname {E} [({\widehat {\theta }}(X)-\theta )^{2}].}

It is used to indicate how far, on average, the collection of estimates are from the single parameter being estimated. Consider the following analogy. Suppose the parameter is thebull's-eye of a target, the estimator is the process of shooting arrows at the target, and the individual arrows are estimates (samples). Then high MSE means the average distance of the arrows from the bull's eye is high, and low MSE means the average distance from the bull's eye is low. The arrows may or may not be clustered. For example, even if all arrows hit the same point, yet grossly miss the target, the MSE is still relatively large. However, if the MSE is relatively low then the arrows are likely more highly clustered (than highly dispersed) around the target.

Sampling deviation

[edit]

For a given samplex{\displaystyle x}, thesampling deviation of the estimatorθ^{\displaystyle {\widehat {\theta }}} is defined as

d(x)=θ^(x)E(θ^(X))=θ^(x)E(θ^),{\displaystyle d(x)={\widehat {\theta }}(x)-\operatorname {E} ({\widehat {\theta }}(X))={\widehat {\theta }}(x)-\operatorname {E} ({\widehat {\theta }}),}

whereE(θ^(X)){\displaystyle \operatorname {E} ({\widehat {\theta }}(X))} is theexpected value of the estimator. The sampling deviation,d, depends not only on the estimator, but also on the sample.

Variance

[edit]

Thevariance ofθ^{\displaystyle {\widehat {\theta }}} is the expected value of the squared sampling deviations; that is,Var(θ^)=E[(θ^E[θ^])2]{\displaystyle \operatorname {Var} ({\widehat {\theta }})=\operatorname {E} [({\widehat {\theta }}-\operatorname {E} [{\widehat {\theta }}])^{2}]}. It is used to indicate how far, on average, the collection of estimates are from theexpected value of the estimates. (Note the difference between MSE and variance.) If the parameter is the bull's-eye of a target, and the arrows are estimates, then a relatively high variance means the arrows are dispersed, and a relatively low variance means the arrows are clustered. Even if the variance is low, the cluster of arrows may still be far off-target, and even if the variance is high, the diffuse collection of arrows may still be unbiased. Finally, even if all arrows grossly miss the target, if they nevertheless all hit the same point, the variance is zero.

Bias

[edit]

Thebias ofθ^{\displaystyle {\widehat {\theta }}} is defined asB(θ^)=E(θ^)θ{\displaystyle B({\widehat {\theta }})=\operatorname {E} ({\widehat {\theta }})-\theta }. It is the distance between the average of the collection of estimates, and the single parameter being estimated. The bias ofθ^{\displaystyle {\widehat {\theta }}} is a function of the true value ofθ{\displaystyle \theta } so saying that the bias ofθ^{\displaystyle {\widehat {\theta }}} isb{\displaystyle b} means that for everyθ{\displaystyle \theta } the bias ofθ^{\displaystyle {\widehat {\theta }}} isb{\displaystyle b}.

There are two kinds of estimators: biased estimators and unbiased estimators. Whether an estimator is biased or not can be identified by the relationship betweenE(θ^)θ{\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta } and 0:

The bias is also the expected value of the error, sinceE(θ^)θ=E(θ^θ){\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta =\operatorname {E} ({\widehat {\theta }}-\theta )}. If the parameter is the bull's eye of a target and the arrows are estimates, then a relatively high absolute value for the bias means the average position of the arrows is off-target, and a relatively low absolute bias means the average position of the arrows is on target. They may be dispersed, or may be clustered. The relationship between bias and variance is analogous to the relationship betweenaccuracy and precision.

The estimatorθ^{\displaystyle {\widehat {\theta }}} is anunbiased estimator ofθ{\displaystyle \theta }if and only ifB(θ^)=0{\displaystyle B({\widehat {\theta }})=0}. Bias is a property of the estimator, not of the estimate. Often, people refer to a "biased estimate" or an "unbiased estimate", but they really are talking about an "estimate from a biased estimator", or an "estimate from an unbiased estimator". Also, people often confuse the "error" of a single estimate with the "bias" of an estimator. That the error for one estimate is large, does not mean the estimator is biased. In fact, even if all estimates have astronomical absolute values for their errors, if the expected value of the error is zero, the estimator is unbiased. Also, an estimator's being biased does not preclude the error of an estimate from being zero in a particular instance. The ideal situation is to have an unbiased estimator with low variance, and also try to limit the number of samples where the error is extreme (that is, to have fewoutliers). Yet unbiasedness is not essential. Often, if just a little bias is permitted, then an estimator can be found with lower mean squared error and/or fewer outlier sample estimates.

An alternative to the version of "unbiased" above, is "median-unbiased", where themedian of the distribution of estimates agrees with the true value; thus, in the long run half the estimates will be too low and half too high. While this applies immediately only to scalar-valued estimators, it can be extended to any measure ofcentral tendency of a distribution: seemedian-unbiased estimators.

In a practical problem,θ^{\displaystyle {\widehat {\theta }}} can always have functional relationship withθ{\displaystyle \theta }. For example, if a genetic theory states there is a type of leaf (starchy green) that occurs with probabilityp1=1/4(θ+2){\displaystyle p_{1}=1/4\cdot (\theta +2)}, with0<θ<1{\displaystyle 0<\theta <1}.Then, forn{\displaystyle n} leaves, the random variableN1{\displaystyle N_{1}}, or the number of starchy green leaves, can be modeled with aBin(n,p1){\displaystyle Bin(n,p_{1})} distribution. The number can be used to express the following estimator forθ{\displaystyle \theta }:θ^=4/nN12{\displaystyle {\widehat {\theta }}=4/n\cdot N_{1}-2}. One can show thatθ^{\displaystyle {\widehat {\theta }}} is an unbiased estimator forθ{\displaystyle \theta }:E[θ^]=E[4/nN12]{\displaystyle E[{\widehat {\theta }}]=E[4/n\cdot N_{1}-2]}=4/nE[N1]2{\displaystyle =4/n\cdot E[N_{1}]-2}=4/nnp12{\displaystyle =4/n\cdot np_{1}-2}=4p12{\displaystyle =4\cdot p_{1}-2}=41/4(θ+2)2{\displaystyle =4\cdot 1/4\cdot (\theta +2)-2}=θ+22{\displaystyle =\theta +2-2}=θ{\displaystyle =\theta }.

Unbiased

[edit]
Difference between estimators: an unbiased estimatorθ2{\displaystyle \theta _{2}} is centered aroundθ{\displaystyle \theta } vs. a biased estimatorθ1{\displaystyle \theta _{1}}.

A desired property for estimators is the unbiased trait where an estimator is shown to have no systematic tendency to produce estimates larger or smaller than the true parameter. Additionally, unbiased estimators with smaller variances are preferred over larger variances because it will be closer to the "true" value of the parameter. The unbiased estimator with the smallest variance is known as theminimum-variance unbiased estimator (MVUE).

To find if your estimator is unbiased it is easy to follow along the equationE(θ^)θ=0{\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta =0},θ^{\displaystyle {\widehat {\theta }}}. With estimatorT with and parameter of interestθ{\displaystyle \theta } solving the previous equation so it is shown asE[T]=θ{\displaystyle \operatorname {E} [T]=\theta } the estimator is unbiased. Looking at the figure to the right despiteθ2^{\displaystyle {\hat {\theta _{2}}}} being the only unbiased estimator, if the distributions overlapped and were both centered aroundθ{\displaystyle \theta } then distributionθ1^{\displaystyle {\hat {\theta _{1}}}} would actually be the preferred unbiased estimator.

ExpectationWhen looking at quantities in the interest of expectation for the model distribution there is an unbiased estimator which should satisfy the two equations below.

1.X¯n=X1+X2++Xnn{\displaystyle 1.\quad {\overline {X}}_{n}={\frac {X_{1}+X_{2}+\cdots +X_{n}}{n}}}
2.E[X¯n]=μ{\displaystyle 2.\quad \operatorname {E} \left[{\overline {X}}_{n}\right]=\mu }

VarianceSimilarly, when looking at quantities in the interest of variance as the model distribution there is also an unbiased estimator that should satisfy the two equations below.

1.Sn2=1n1i=1n(XiXn¯)2{\displaystyle 1.\quad S_{n}^{2}={\frac {1}{n-1}}\sum _{i=1}^{n}(X_{i}-{\bar {X_{n}}})^{2}}
2.E[Sn2]=σ2{\displaystyle 2.\quad \operatorname {E} \left[S_{n}^{2}\right]=\sigma ^{2}}

Note we are dividing byn − 1 because if we divided withn we would obtain an estimator with a negative bias which would thus produce estimates that are too small forσ2{\displaystyle \sigma ^{2}}. It should also be mentioned that even thoughSn2{\displaystyle S_{n}^{2}} is unbiased forσ2{\displaystyle \sigma ^{2}} the reverse is not true.[4]

Relationships among the quantities

[edit]

Behavioral properties

[edit]

Consistency

[edit]
Main article:Consistent estimator

Aconsistent estimator is an estimator whose sequence of estimatesconverge in probability to the quantity being estimated as the index (usually thesample size) grows without bound. In other words, increasing the sample size increases the probability of the estimator being close to the population parameter.

Mathematically, an estimator is a consistent estimator forparameterθ, if and only if for the sequence of estimates{tn;n ≥ 0}, and for allε > 0, no matter how small, we have

limnPr{|tnθ|<ε}=1{\displaystyle \lim _{n\to \infty }\Pr \left\{\left|t_{n}-\theta \right|<\varepsilon \right\}=1}.

The consistency defined above may be called weak consistency. The sequence isstrongly consistent, if itconverges almost surely to the true value.

An estimator that converges to amultiple of a parameter can be made into a consistent estimator by multiplying the estimator by ascale factor, namely the true value divided by the asymptotic value of the estimator. This occurs frequently inestimation of scale parameters bymeasures of statistical dispersion.

Fisher consistency

[edit]

An estimator can be considered Fisher consistent as long as the estimator is the same functional of the empirical distribution function as the true distribution function. Following the formula:

θ^=h(Tn),θ=h(Tθ){\displaystyle {\widehat {\theta }}=h(T_{n}),\theta =h(T_{\theta })}

WhereTn{\displaystyle T_{n}} andTθ{\displaystyle T_{\theta }} are theempirical distribution function and theoretical distribution function, respectively. An easy example to see if some estimator is Fisher consistent is to check the consistency of mean and variance. For example, to check consistency for the meanμ^=X¯{\displaystyle {\widehat {\mu }}={\bar {X}}} and to check for variance confirm thatσ^2=SSD/n{\displaystyle {\widehat {\sigma }}^{2}=SSD/n}.[5]

Asymptotic normality

[edit]
Main article:Asymptotic normality

Anasymptotically normal estimator is a consistent estimator whose distribution around the true parameterθ approaches anormal distribution with standard deviation shrinking in proportion to1/n{\displaystyle 1/{\sqrt {n}}} as the sample sizen grows. UsingD{\displaystyle {\xrightarrow {D}}} to denoteconvergence in distribution,tn isasymptotically normal if

n(tnθ)DN(0,V),{\displaystyle {\sqrt {n}}(t_{n}-\theta ){\xrightarrow {D}}N(0,V),}

for someV.

In this formulationV/n can be called theasymptotic variance of the estimator. However, some authors also callV theasymptotic variance.Note that convergence will not necessarily have occurred for any finite "n", therefore this value is only an approximation to the true variance of the estimator, while in the limit the asymptotic variance (V/n) is simply zero. To be more specific, the distribution of the estimatortn converges weakly to adirac delta function centered atθ{\displaystyle \theta }.

Thecentral limit theorem implies asymptotic normality of thesample meanX¯{\displaystyle {\bar {X}}} as an estimator of the true mean.More generally,maximum likelihood estimators are asymptotically normal under fairly weak regularity conditions — see theasymptotics section of the maximum likelihood article. However, not all estimators are asymptotically normal; the simplest examples are found when the true value of a parameter lies on the boundary of the allowable parameter region.

Efficiency

[edit]
Main article:Efficiency (statistics)

The efficiency of an estimator is used to estimate the quantity of interest in a "minimum error" manner. In reality, there is not an explicit best estimator; there can only be a better estimator. Whether the efficiency of an estimator is better or not is based on the choice of a particularloss function, and it is reflected by two naturally desirable properties of estimators: to be unbiasedE(θ^)θ=0{\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta =0} and have minimalmean squared error (MSE)E[(θ^θ)2]{\displaystyle \operatorname {E} [({\widehat {\theta }}-\theta )^{2}]}. These cannot in general both be satisfied simultaneously: a biased estimator may have a lower mean squared error than any unbiased estimator (seeestimator bias).This equation relates the mean squared error with the estimator bias:[4]

E[(θ^θ)2]=(E(θ^)θ)2+Var(θ^) {\displaystyle \operatorname {E} [({\widehat {\theta }}-\theta )^{2}]=(\operatorname {E} ({\widehat {\theta }})-\theta )^{2}+\operatorname {Var} ({\widehat {\theta }})\ }

The first term represents the mean squared error; the second term represents the square of the estimator bias; and the third term represents the variance of the estimator. The quality of the estimator can be identified from the comparison between the variance, the square of the estimator bias, or the MSE. The variance of the good estimator (good efficiency) would be smaller than the variance of the bad estimator (bad efficiency). The square of an estimator bias with a good estimator would be smaller than the estimator bias with a bad estimator. The MSE of a good estimator would be smaller than the MSE of the bad estimator. Suppose there are two estimator,θ^1{\displaystyle {\widehat {\theta }}_{1}} is the good estimator andθ^2{\displaystyle {\widehat {\theta }}_{2}} is the bad estimator. The above relationship can be expressed by the following formulas.

Var(θ^1)<Var(θ^2){\displaystyle \operatorname {Var} ({\widehat {\theta }}_{1})<\operatorname {Var} ({\widehat {\theta }}_{2})}
|E(θ^1)θ|<|E(θ^2)θ|{\displaystyle |\operatorname {E} ({\widehat {\theta }}_{1})-\theta |<\left|\operatorname {E} ({\widehat {\theta }}_{2})-\theta \right|}
MSE(θ^1)<MSE(θ^2){\displaystyle \operatorname {MSE} ({\widehat {\theta }}_{1})<\operatorname {MSE} ({\widehat {\theta }}_{2})}

Besides using formula to identify the efficiency of the estimator, it can also be identified through the graph. If an estimator is efficient, in the frequency vs. value graph, there will be a curve with high frequency at the center and low frequency on the two sides. For example:

If an estimator is not efficient, the frequency vs. value graph, there will be a relatively more gentle curve.

To put it simply, the good estimator has a narrow curve, while the bad estimator has a large curve. Plotting these two curves on one graph with a sharedy-axis, the difference becomes more obvious.

Comparison between good and bad estimator.

Among unbiased estimators, there often exists one with the lowest variance, called the minimum variance unbiased estimator (MVUE). In some cases an unbiasedefficient estimator exists, which, in addition to having the lowest variance among unbiased estimators, satisfies theCramér–Rao bound, which is an absolute lower bound on variance for statistics of a variable.

Concerning such "best unbiased estimators", see alsoCramér–Rao bound,Gauss–Markov theorem,Lehmann–Scheffé theorem,Rao–Blackwell theorem.

Robustness

[edit]
Main article:Robust estimator
Further information:Robust regression

See also

[edit]

References

[edit]
  1. ^Mosteller, F.; Tukey, J. W. (1987) [1968]."Data Analysis, including Statistics".The Collected Works of John W. Tukey: Philosophy and Principles of Data Analysis 1965–1986. Vol. 4. CRC Press. pp. 601–720 [p. 633].ISBN 0-534-05101-4 – viaGoogle Books.
  2. ^Kosorok (2008), Section 3.1, pp 35–39.
  3. ^Jaynes (2007), p.172.
  4. ^abDekking, Frederik Michel; Kraaikamp, Cornelis; Lopuhaä, Hendrik Paul; Meester, Ludolf Erwin (2005).A Modern Introduction to Probability and Statistics. Springer Texts in Statistics.ISBN 978-1-85233-896-1.
  5. ^Lauritzen, Steffen."Properties of Estimators"(PDF). University of Oxford. Retrieved9 December 2023.

Further reading

[edit]

External links

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Estimator&oldid=1274619673"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp