Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Estimator
open-in-new
<h2 id="background">Background</h2> <p>An "estimator" or "<a href="/facts/Point_estimate/AYsuptFp">point estimate</a>" is a <a href="/facts/Statistic/av21WaMK">statistic</a> (that is, a function of the data) that is used to infer the value of an unknown <a href="/facts/Statistical_parameter/fkJju25M">parameter</a> in a <a href="/facts/Statistical_model/jKkT5ftm">statistical model</a>. 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 the <i><a href="/facts/Estimand/1UVFQPEc">estimand</a></i>. It can be either finite-dimensional (in <a href="/facts/Parametric_model/FeynAa0f">parametric</a> and <a href="/facts/Semi-parametric_model/L5jTbkSc">semi-parametric models</a>), or infinite-dimensional (<a href="/facts/Semi-parametric_model/L5jTbkSc">semi-parametric</a> and <a href="/facts/Non-parametric_model/svTDJHTb">non-parametric models</a>).<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> If the parameter is denoted θ {\displaystyle \theta } then the estimator is traditionally written by adding a <a href="/facts/Circumflex/kg8xlo6W">circumflex</a> over the symbol: θ ^ {\displaystyle {\widehat {\theta }}} . Being a function of the data, the estimator is itself a <a href="/facts/Random_variable/TwTBXnLT">random variable</a>; a particular realization of this random variable is called the "estimate". Sometimes the words "estimator" and "estimate" are used interchangeably. </p><p>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 as <a href="/facts/Unbiasedness/oxIvEgmd">unbiasedness</a>, <a href="/facts/Mean_square_error/kz3TR7bv">mean square error</a>, <a href="/facts/Consistent_estimator/HAKDWYEM">consistency</a>, <a href="/facts/Asymptotic_distribution/dN7jVHqm">asymptotic distribution</a>, etc. The construction and comparison of estimators are the subjects of the <a href="/facts/Estimation_theory/4nbgFDec">estimation theory</a>. In the context of <a href="/facts/Decision_theory/TbXcQX0v">decision theory</a>, an estimator is a type of <a href="/facts/Decision_rule/pyufsMor">decision rule</a>, and its performance may be evaluated through the use of <a href="/facts/Loss_function/xv5ozuhl">loss functions</a>. </p><p>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 the <a href="/facts/Parameter_space/LpdMY5gc">parameter space</a>. There also exists another type of estimator: <a href="/facts/Interval_estimator/7G6VxM7I">interval estimators</a>, where the estimates are subsets of the parameter space. </p><p>The problem of <a href="/facts/Density_estimation/YthqJssX">density estimation</a> arises in two applications. Firstly, in estimating the <a href="/facts/Probability_density_function/zvfybna4">probability density functions</a> of random variables and secondly in estimating the <a href="/facts/Spectral_density/q3Rfs7b0">spectral density function</a> of a <a href="/facts/Time_series/fSXPR817">time series</a>. 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. </p> <h2 id="definition">Definition</h2> <p>Suppose a fixed <i>parameter</i> θ {\displaystyle \theta } needs to be estimated. Then an "estimator" is a function that maps the <a href="/facts/Sample_space/WVldkN4F">sample space</a> to a set of <i>sample estimates</i>. An estimator of θ {\displaystyle \theta } is usually denoted by the symbol θ ^ {\displaystyle {\widehat {\theta }}} . It is often convenient to express the theory using the <a href="/facts/Algebra_of_random_variables/CD0E9PYT">algebra of random variables</a>: thus if <i>X</i> is used to denote a <a href="/facts/Random_variable/TwTBXnLT">random variable</a> 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 value x {\displaystyle x} (i.e. for X = 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 a <a href="/facts/Random_variable/TwTBXnLT">random variable</a>, but this can cause confusion. </p> <h2 id="quantified-properties">Quantified properties</h2> <p>The following definitions and attributes are relevant.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> </p> <h3>Error</h3> <p>For a given sample x {\displaystyle x} , the "<a href="/facts/Errors_and_residuals_in_statistics/Ef0LgAS4">error</a>" of the estimator θ ^ {\displaystyle {\widehat {\theta }}} is defined as </p> e ( x ) = θ ^ ( x ) − θ , {\displaystyle e(x)={\widehat {\theta }}(x)-\theta ,} <p>where θ {\displaystyle \theta } is the parameter being estimated. The error, <i>e</i>, depends not only on the estimator (the estimation formula or procedure), but also on the sample. </p> <h3>Mean squared error</h3> <p>The <a href="/facts/Mean_squared_error/kz3TR7bv">mean squared error</a> of θ ^ {\displaystyle {\widehat {\theta }}} is defined as the expected value (probability-weighted average, over all samples) of the squared errors; that is, </p> MSE ( θ ^ ) = E [ ( θ ^ ( X ) − θ ) 2 ] . {\displaystyle \operatorname {MSE} ({\widehat {\theta }})=\operatorname {E} [({\widehat {\theta }}(X)-\theta )^{2}].} <p>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 the <a href="/facts/Bullseye_(target)/trLujm6W">bull's-eye of a target</a>, 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. </p> <h3>Sampling deviation</h3> <p>For a given sample x {\displaystyle x} , the <i>sampling deviation</i> of the estimator θ ^ {\displaystyle {\widehat {\theta }}} is defined as </p> 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 }}),} <p>where E ( θ ^ ( X ) ) {\displaystyle \operatorname {E} ({\widehat {\theta }}(X))} is the <a href="/facts/Expected_value/1XV0JKL8">expected value</a> of the estimator. The sampling deviation, <i>d</i>, depends not only on the estimator, but also on the sample. </p> <h3>Variance</h3> <p>The <a href="/facts/Variance/ULBJKXD1">variance</a> 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 the <i>expected value</i> 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. </p> <h3>Bias</h3> <p>The <a href="/facts/Bias_of_an_estimator/oxIvEgmd">bias</a> of θ ^ {\displaystyle {\widehat {\theta }}} is defined as B ( θ ^ ) = 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 }}} is b {\displaystyle b} means that for every θ {\displaystyle \theta } the bias of θ ^ {\displaystyle {\widehat {\theta }}} is b {\displaystyle b} . </p><p>There are two kinds of estimators: biased estimators and unbiased estimators. Whether an estimator is biased or not can be identified by the relationship between E ( θ ^ ) − θ {\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta } and 0: </p> <ul><li>If E ( θ ^ ) − θ ≠ 0 {\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta \neq 0} , θ ^ {\displaystyle {\widehat {\theta }}} is biased.</li> <li>If E ( θ ^ ) − θ = 0 {\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta =0} , θ ^ {\displaystyle {\widehat {\theta }}} is unbiased.</li></ul> <p>The bias is also the expected value of the error, since E ( θ ^ ) − θ = 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 between <a href="/facts/Accuracy_and_precision/JQ47xXDq">accuracy and precision</a>. </p><p>The estimator θ ^ {\displaystyle {\widehat {\theta }}} is an <a href="/facts/Estimator_bias/oxIvEgmd">unbiased estimator</a> of θ {\displaystyle \theta } <a href="/facts/If_and_only_if/bYSxGJ66">if and only if</a> B ( θ ^ ) = 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 few <a href="/facts/Outlier/VBhIzGbx">outliers</a>). 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. </p><p>An alternative to the version of "unbiased" above, is "median-unbiased", where the <a href="/facts/Median/YwXGWTyr">median</a> 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 of <a href="/facts/Central_tendency/9yhcQ6me">central tendency</a> of a distribution: see <a href="/facts/Bias_of_an_estimator/oxIvEgmd">median-unbiased estimators</a>. </p><p>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 probability p 1 = 1 / 4 ⋅ ( θ + 2 ) {\displaystyle p_{1}=1/4\cdot (\theta +2)} , with 0 < θ < 1 {\displaystyle 0<\theta <1} . Then, for n {\displaystyle n} leaves, the random variable N 1 {\displaystyle N_{1}} , or the number of starchy green leaves, can be modeled with a B i n ( n , p 1 ) {\displaystyle Bin(n,p_{1})} distribution. The number can be used to express the following estimator for θ {\displaystyle \theta } : θ ^ = 4 / n ⋅ N 1 − 2 {\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 / n ⋅ N 1 − 2 ] {\displaystyle E[{\widehat {\theta }}]=E[4/n\cdot N_{1}-2]} = 4 / n ⋅ E [ N 1 ] − 2 {\displaystyle =4/n\cdot E[N_{1}]-2} = 4 / n ⋅ n p 1 − 2 {\displaystyle =4/n\cdot np_{1}-2} = 4 ⋅ p 1 − 2 {\displaystyle =4\cdot p_{1}-2} = 4 ⋅ 1 / 4 ⋅ ( θ + 2 ) − 2 {\displaystyle =4\cdot 1/4\cdot (\theta +2)-2} = θ + 2 − 2 {\displaystyle =\theta +2-2} = θ {\displaystyle =\theta } . </p> <h3>Unbiased</h3> <p>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 the <a href="/facts/Minimum-variance_unbiased_estimator/t4JhrJ3a">minimum-variance unbiased estimator</a> (MVUE). </p><p>To find if your estimator is unbiased it is easy to follow along the equation E ( θ ^ ) − θ = 0 {\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta =0} , θ ^ {\displaystyle {\widehat {\theta }}} . With estimator <i>T</i> with and parameter of interest θ {\displaystyle \theta } solving the previous equation so it is shown as E [ 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. </p><p>Expectation When looking at quantities in the interest of expectation for the model distribution there is an unbiased estimator which should satisfy the two equations below. </p> 1. X ¯ n = X 1 + X 2 + ⋯ + X n n {\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 } <p>Variance Similarly, 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. </p> 1. S n 2 = 1 n − 1 ∑ i = 1 n ( X i − X ¯ ) 2 {\displaystyle 1.\quad S_{n}^{2}={\frac {1}{n-1}}\sum _{i=1}^{n}(X_{i}-{\bar {X}})^{2}} 2. E [ S n 2 ] = σ 2 {\displaystyle 2.\quad \operatorname {E} \left[S_{n}^{2}\right]=\sigma ^{2}} <p>Note we are dividing by <i>n</i> − 1 because if we divided with <i>n</i> 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 though S n 2 {\displaystyle S_{n}^{2}} is unbiased for σ 2 {\displaystyle \sigma ^{2}} the reverse is not true.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> </p> <h3>Relationships among the quantities</h3> <ul><li>The mean squared error, variance, and bias, are related: MSE ( θ ^ ) = Var ( θ ^ ) + ( B ( θ ^ ) ) 2 , {\displaystyle \operatorname {MSE} ({\widehat {\theta }})=\operatorname {Var} ({\widehat {\theta }})+(B({\widehat {\theta }}))^{2},} i.e. mean squared error = variance + square of bias. In particular, for an unbiased estimator, the variance equals the mean squared error.</li> <li>The <a href="/facts/Standard_deviation/qSug9BRl">standard deviation</a> of an estimator θ ^ {\displaystyle {\widehat {\theta }}} of θ {\displaystyle \theta } (the <a href="/facts/Square_root/AfrzfBdQ">square root</a> of the variance), or an estimate of the standard deviation of an estimator θ ^ {\displaystyle {\widehat {\theta }}} of θ {\displaystyle \theta } , is called the <i><a href="/facts/Standard_error_(statistics)/Iv96AyCD">standard error</a></i> of θ ^ {\displaystyle {\widehat {\theta }}} .</li> <li>The bias-variance tradeoff will be used in model complexity, over-fitting and under-fitting. It is mainly used in the field of <a href="/facts/Supervised_learning/JlNFNPFt">supervised learning</a> and <a href="/facts/Predictive_modelling/VI5ThSKa">predictive modelling</a> to diagnose the performance of algorithms.</li></ul> <h2 id="behavioral-properties">Behavioral properties</h2> <h3>Consistency</h3> <p class="note">Main article: <a href="/facts/Consistent_estimator/HAKDWYEM">Consistent estimator</a></p> <p>A consistent estimator is an estimator whose sequence of estimates <a href="/facts/Convergence_in_probability/pWdatFlY">converge in probability</a> to the quantity being estimated as the index (usually the <a href="/facts/Sample_size/sf8dAFzq">sample size</a>) grows without bound. In other words, increasing the sample size increases the probability of the estimator being close to the population parameter. </p><p>Mathematically, an estimator is a consistent estimator for <a href="/facts/Parameter/zFvVFMv9">parameter</a> <i>θ</i>, if and only if for the sequence of estimates {<i>tn</i>; <i>n</i> ≥ 0}, and for all <i>ε</i> > 0, no matter how small, we have </p> lim n → ∞ Pr { | t n − θ | < ε } = 1 {\displaystyle \lim _{n\to \infty }\Pr \left\{\left|t_{n}-\theta \right|<\varepsilon \right\}=1} . <p>The consistency defined above may be called weak consistency. The sequence is <i>strongly consistent</i>, if it <a href="/facts/Almost_sure_convergence/pWdatFlY">converges almost surely</a> to the true value. </p><p>An estimator that converges to a <i>multiple</i> of a parameter can be made into a consistent estimator by multiplying the estimator by a <a href="/facts/Scale_factor/zReEyq57">scale factor</a>, namely the true value divided by the asymptotic value of the estimator. This occurs frequently in <a href="/facts/Scale_parameter/6lxcyKUf">estimation of scale parameters</a> by <a href="/facts/Statistical_dispersion/xqevRHmz">measures of statistical dispersion</a>. </p> <h3>Fisher consistency</h3> <p>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: </p> θ ^ = h ( T n ) , θ = h ( T θ ) {\displaystyle {\widehat {\theta }}=h(T_{n}),\theta =h(T_{\theta })} <p>Where T n {\displaystyle T_{n}} and T θ {\displaystyle T_{\theta }} are the <a href="/facts/Empirical_distribution_function/frWIF9F9">empirical distribution function</a> 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 = S S D / n {\displaystyle {\widehat {\sigma }}^{2}=SSD/n} .<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p> <h3>Asymptotic normality</h3> <p class="note">Main article: <a href="/facts/Asymptotic_normality/dN7jVHqm">Asymptotic normality</a></p> <p>An <a href="/facts/Asymptotic_distribution/dN7jVHqm">asymptotically normal</a> estimator is a consistent estimator whose distribution around the true parameter <i>θ</i> approaches a <a href="/facts/Normal_distribution/UapjjPyQ">normal distribution</a> with standard deviation shrinking in proportion to 1 / n {\displaystyle 1/{\sqrt {n}}} as the sample size <i>n</i> grows. Using → D {\displaystyle {\xrightarrow {D}}} to denote <a href="/facts/Convergence_of_random_variables/pWdatFlY">convergence in distribution</a>, <i>tn</i> is <a href="/facts/Asymptotic_normality/dN7jVHqm">asymptotically normal</a> if </p> n ( t n − θ ) → D N ( 0 , V ) , {\displaystyle {\sqrt {n}}(t_{n}-\theta ){\xrightarrow {D}}N(0,V),} <p>for some <i>V</i>. </p><p>In this formulation <i>V/n</i> can be called the <i>asymptotic variance</i> of the estimator. However, some authors also call <i>V</i> the <i>asymptotic variance</i>. 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 estimator <i>tn</i> converges weakly to a <a href="/facts/Dirac_delta_function/V8PjRP8T">dirac delta function</a> centered at θ {\displaystyle \theta } . </p><p>The <a href="/facts/Central_limit_theorem/0gc2L0Wd">central limit theorem</a> implies asymptotic normality of the <a href="/facts/Sample_mean/Ah8VVVDT">sample mean</a> X ¯ {\displaystyle {\bar {X}}} as an estimator of the true mean. More generally, <a href="/facts/Maximum_likelihood/0Yq2dpQD">maximum likelihood</a> estimators are asymptotically normal under fairly weak regularity conditions — see the <a href="/facts/Maximum_likelihood/0Yq2dpQD">asymptotics section</a> 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. </p> <h3>Efficiency</h3> <p class="note">Main article: <a href="/facts/Efficiency_(statistics)/wTmgEqte">Efficiency (statistics)</a></p> <p>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 particular <a href="/facts/Loss_function/xv5ozuhl">loss function</a>, and it is reflected by two naturally desirable properties of estimators: to be unbiased E ( θ ^ ) − θ = 0 {\displaystyle \operatorname {E} ({\widehat {\theta }})-\theta =0} and have minimal <a href="/facts/Mean_squared_error/kz3TR7bv">mean squared error</a> (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 (see <a href="/facts/Estimator_bias/oxIvEgmd">estimator bias</a>). This equation relates the mean squared error with the estimator bias:<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> </p> E [ ( θ ^ − θ ) 2 ] = ( E ( θ ^ ) − θ ) 2 + Var ( θ ^ ) {\displaystyle \operatorname {E} [({\widehat {\theta }}-\theta )^{2}]=(\operatorname {E} ({\widehat {\theta }})-\theta )^{2}+\operatorname {Var} ({\widehat {\theta }})\ } <p>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. </p> 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})} <p>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: </p> <p>If an estimator is not efficient, the frequency vs. value graph, there will be a relatively more gentle curve. </p> <p>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 shared <i>y</i>-axis, the difference becomes more obvious. </p> <p>Among unbiased estimators, there often exists one with the lowest variance, called the minimum variance unbiased estimator (<a href="/facts/MVUE/t4JhrJ3a">MVUE</a>). In some cases an unbiased <a href="/facts/Efficiency_(statistics)/wTmgEqte">efficient estimator</a> exists, which, in addition to having the lowest variance among unbiased estimators, satisfies the <a href="/facts/Cram%25C3%25A9r%25E2%2580%2593Rao_bound/Kvhqdpol">Cramér–Rao bound</a>, which is an absolute lower bound on variance for statistics of a variable. </p><p>Concerning such "best unbiased estimators", see also <a href="/facts/Cram%25C3%25A9r%25E2%2580%2593Rao_bound/Kvhqdpol">Cramér–Rao bound</a>, <a href="/facts/Gauss%25E2%2580%2593Markov_theorem/j85SGhrw">Gauss–Markov theorem</a>, <a href="/facts/Lehmann%25E2%2580%2593Scheff%25C3%25A9_theorem/TAfIMo1E">Lehmann–Scheffé theorem</a>, <a href="/facts/Rao%25E2%2580%2593Blackwell_theorem/fI5oGC0K">Rao–Blackwell theorem</a>. </p> <h3>Robustness</h3> <p class="note">Main article: <a href="/facts/Robust_estimator/RwIMvtD2">Robust estimator</a></p> <p class="note">Further information: <a href="/facts/Robust_regression/gGvbTtVC">Robust regression</a></p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Best_linear_unbiased_estimator/j85SGhrw">Best linear unbiased estimator</a> (BLUE)</li> <li><a href="/facts/Invariant_estimator/LQRCCnyM">Invariant estimator</a></li> <li><a href="/facts/Kalman_filter/wNK7rnbk">Kalman filter</a></li> <li><a href="/facts/Markov_chain_Monte_Carlo/eTjk3WQy">Markov chain Monte Carlo</a> (MCMC)</li> <li><a href="/facts/Maximum_a_posteriori/Y5zHyqfX">Maximum a posteriori</a> (MAP)</li> <li><a href="/facts/Method_of_moments_(statistics)/Qfso3fMe">Method of moments</a>, <a href="/facts/Generalized_method_of_moments/mNc3410V">generalized method of moments</a></li> <li><a href="/facts/Minimum_mean_squared_error/hI2lqEMh">Minimum mean squared error</a> (MMSE)</li> <li><a href="/facts/Particle_filter/192bI79g">Particle filter</a></li> <li><a href="/facts/Pitman_closeness_criterion/cd14SoPc">Pitman closeness criterion</a></li> <li><a href="/facts/Sensitivity_and_specificity/pzc9qfdz">Sensitivity and specificity</a></li> <li><a href="/facts/Shrinkage_estimator/SY91pcov">Shrinkage estimator</a></li> <li><a href="/facts/Signal_processing/Npaja6zb">Signal processing</a></li> <li><a href="/facts/State_observer/HugNt2hg">State observer</a></li> <li><a href="/facts/Testimator/JxP2nXYg">Testimator</a></li> <li><a href="/facts/Wiener_filter/oGWdBTYa">Wiener filter</a></li> <li><a href="/facts/Well-behaved_statistic/mNL9zjS8">Well-behaved statistic</a></li></ul> <h2 id="further-reading">Further reading</h2> <ul><li>Bol'shev, Login Nikolaevich (2001) [1994], <a href="https://www.encyclopediaofmath.org/index.php?title=Statistical_estimator&oldid=s/s087360">"Statistical estimator"</a>, <i><a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a></i>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>.</li> <li><a href="/facts/Edwin_Thompson_Jaynes/PU536IkK">Jaynes, E. T.</a> (2007). <i>Probability Theory: The logic of science</i> (5 ed.). <a href="/facts/Cambridge_University_Press/fgEBSSRq">Cambridge University Press</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-521-59271-0..</li> <li>Kosorok, Michael (2008). <a href="https://www.springer.com/mathematics/probability/book/978-0-387-74977-8"><i>Introduction to Empirical Processes and Semiparametric Inference</i></a>. Springer Series in Statistics. <a href="/facts/Springer_Science%252BBusiness_Media/nAesf6nT">Springer</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-0-387-74978-5">10.1007/978-0-387-74978-5</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-387-74978-5.</li> <li><a href="/facts/Erich_Leo_Lehmann/hun7hqhM">Lehmann, E. L.</a>; Casella, G. (1998). <i>Theory of Point Estimation</i> (2nd ed.). <a href="/facts/Springer_Science%252BBusiness_Media/nAesf6nT">Springer</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-387-98502-6.</li> <li>Shao, Jun (1998), <i>Mathematical Statistics</i>, <a href="/facts/Springer_Science%252BBusiness_Media/nAesf6nT">Springer</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-387-98674-X</li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="https://web.archive.org/web/20200212200544/https://pdfs.semanticscholar.org/9abc/f28d04f550cc20c30ff819c3f0b8f110b808.pdf">Fundamentals on Estimation Theory</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>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 – via Google Books. <a href="0-534-05101-4" target="_blank">0-534-05101-4</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Kosorok (2008), Section 3.1, pp 35–39. <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Jaynes (2007), p.172. <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Dekking, 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. <a href="978-1-85233-896-1" target="_blank">978-1-85233-896-1</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Lauritzen, Steffen. "Properties of Estimators" (PDF). University of Oxford. Retrieved 9 December 2023. <a href="https://www.stats.ox.ac.uk/~steffen/teaching/bs2siMT04/si2c.pdf" target="_blank">https://www.stats.ox.ac.uk/~steffen/teaching/bs2siMT04/si2c.pdf</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Dekking, 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. <a href="978-1-85233-896-1" target="_blank">978-1-85233-896-1</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> </ol>