Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Mean squared error

From Wikipedia, the free encyclopedia
Measure of the error of an estimator
"Mean squared deviation" redirects here; not to be confused withMean squared displacement.

Instatistics, themean squared error (MSE)[1] ormean squared deviation (MSD) of anestimator (of a procedure for estimating an unobserved quantity) measures theaverage of the squares of theerrors—that is, the average squared difference between the estimated values and thetrue value. MSE is arisk function, corresponding to theexpected value of thesquared error loss.[2] The fact that MSE is almost always strictly positive (and not zero) is because ofrandomness or because the estimatordoes not account for information that could produce a more accurate estimate.[3] Inmachine learning, specificallyempirical risk minimization, MSE may refer to theempirical risk (the average loss on an observed data set), as an estimate of the true MSE (the true risk: the average loss on the actual population distribution).

The MSE is a measure of the quality of an estimator. As it is derived from the square ofEuclidean distance, it is always a positive value that decreases as the error approaches zero.

The MSE is the secondmoment (about the origin) of the error, and thus incorporates both thevariance of the estimator (how widely spread the estimates are from onedata sample to another) and itsbias (how far off the average estimated value is from the true value).[citation needed] For anunbiased estimator, the MSE is the variance of the estimator. Like the variance, MSE has the same units of measurement as the square of the quantity being estimated. In an analogy tostandard deviation, taking the square root of MSE yields theroot-mean-square error orroot-mean-square deviation (RMSE or RMSD), which has the same units as the quantity being estimated; for an unbiased estimator, the RMSE is the square root of thevariance, known as thestandard error.

Definition and basic properties

[edit]

The MSE either assesses the quality of apredictor (i.e., a function mapping arbitrary inputs to a sample of values of somerandom variable), or of anestimator (i.e., amathematical function mapping asample of data to an estimate of aparameter of thepopulation from which the data is sampled). In the context of prediction, understanding theprediction interval can also be useful as it provides a range within which a future observation will fall, with a certain probability. The definition of an MSE differs according to whether one is describing a predictor or an estimator.

Predictor

[edit]

If a vector ofn{\displaystyle n} predictions is generated from a sample ofn{\displaystyle n} data points on all variables, andY{\displaystyle Y} is the vector of observed values of the variable being predicted, withY^{\displaystyle {\hat {Y}}} being the predicted values (e.g. as from aleast-squares fit), then the within-sample MSE of the predictor is computed as

MSE=1ni=1n(YiYi^)2{\displaystyle \operatorname {MSE} ={\frac {1}{n}}\sum _{i=1}^{n}\left(Y_{i}-{\hat {Y_{i}}}\right)^{2}}

In other words, the MSE is themean(1ni=1n){\textstyle \left({\frac {1}{n}}\sum _{i=1}^{n}\right)} of thesquares of the errors(YiYi^)2{\textstyle \left(Y_{i}-{\hat {Y_{i}}}\right)^{2}}. This is an easily computable quantity for a particular sample (and hence is sample-dependent).

Inmatrix notation,MSE=1ni=1n(ei)2=1neTe{\displaystyle \operatorname {MSE} ={\frac {1}{n}}\sum _{i=1}^{n}(e_{i})^{2}={\frac {1}{n}}\mathbf {e} ^{\mathsf {T}}\mathbf {e} }whereei{\displaystyle e_{i}} isYiYi^{\displaystyle Y_{i}-{\hat {Y_{i}}}} ande{\displaystyle \mathbf {e} } is an×1{\displaystyle n\times 1} column vector.

The MSE can also be computed onqdata points that were not used in estimating the model, either because they were held back for this purpose, or because these data have been newly obtained. Within this process, known ascross-validation, the MSE is often called thetest MSE,[4] and is computed as

MSE=1qi=n+1n+q(YiYi^)2{\displaystyle \operatorname {MSE} ={\frac {1}{q}}\sum _{i=n+1}^{n+q}\left(Y_{i}-{\hat {Y_{i}}}\right)^{2}}

Estimator

[edit]

The MSE of an estimatorθ^{\displaystyle {\hat {\theta }}} with respect to an unknown parameterθ{\displaystyle \theta } is defined as[1]

MSE(θ^)=Eθ[(θ^θ)2].{\displaystyle \operatorname {MSE} ({\hat {\theta }})=\operatorname {E} _{\theta }\left[({\hat {\theta }}-\theta )^{2}\right].}

This definition depends on the unknown parameter, therefore the MSE is apriori property of an estimator. The MSE could be a function of unknown parameters, in which case anyestimator of the MSE based on estimates of these parameters would be a function of the data (and thus a random variable). If the estimatorθ^{\displaystyle {\hat {\theta }}} is derived as a sample statistic and is used to estimate some population parameter, then the expectation is with respect to thesampling distribution of the sample statistic.

The MSE can be written as the sum of thevariance of the estimator and the squaredbias of the estimator, providing a useful way to calculate the MSE and implying that in the case of unbiased estimators, the MSE and variance are equivalent.[5]

MSE(θ^)=Varθ(θ^)+Bias(θ^,θ)2.{\displaystyle \operatorname {MSE} ({\hat {\theta }})=\operatorname {Var} _{\theta }({\hat {\theta }})+\operatorname {Bias} ({\hat {\theta }},\theta )^{2}.}

Proof of variance and bias relationship

[edit]

MSE(θ^)=Eθ[(θ^θ)2]=Eθ[(θ^Eθ[θ^]+Eθ[θ^]θ)2]=Eθ[(θ^Eθ[θ^])2+2(θ^Eθ[θ^])(Eθ[θ^]θ)+(Eθ[θ^]θ)2]=Eθ[(θ^Eθ[θ^])2]+Eθ[2(θ^Eθ[θ^])(Eθ[θ^]θ)]+Eθ[(Eθ[θ^]θ)2]=Eθ[(θ^Eθ[θ^])2]+2(Eθ[θ^]θ)Eθ[θ^Eθ[θ^]]+(Eθ[θ^]θ)2Eθ[θ^]θ=constant=Eθ[(θ^Eθ[θ^])2]+2(Eθ[θ^]θ)(Eθ[θ^]Eθ[θ^])+(Eθ[θ^]θ)2Eθ[θ^]=constant=Eθ[(θ^Eθ[θ^])2]+(Eθ[θ^]θ)2=Varθ(θ^)+Biasθ(θ^,θ)2{\displaystyle {\begin{aligned}\operatorname {MSE} ({\hat {\theta }})&=\operatorname {E} _{\theta }\left[({\hat {\theta }}-\theta )^{2}\right]\\&=\operatorname {E} _{\theta }\left[\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]+\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)^{2}\right]\\&=\operatorname {E} _{\theta }\left[\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)^{2}+2\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)+\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)^{2}\right]\\&=\operatorname {E} _{\theta }\left[\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)^{2}\right]+\operatorname {E} _{\theta }\left[2\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)\right]+\operatorname {E} _{\theta }\left[\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)^{2}\right]\\&=\operatorname {E} _{\theta }\left[\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)^{2}\right]+2\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)\operatorname {E} _{\theta }\left[{\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right]+\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)^{2}&&\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta ={\text{constant}}\\&=\operatorname {E} _{\theta }\left[\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)^{2}\right]+2\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)+\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)^{2}&&\operatorname {E} _{\theta }[{\hat {\theta }}]={\text{constant}}\\&=\operatorname {E} _{\theta }\left[\left({\hat {\theta }}-\operatorname {E} _{\theta }[{\hat {\theta }}]\right)^{2}\right]+\left(\operatorname {E} _{\theta }[{\hat {\theta }}]-\theta \right)^{2}\\&=\operatorname {Var} _{\theta }({\hat {\theta }})+\operatorname {Bias} _{\theta }({\hat {\theta }},\theta )^{2}\end{aligned}}}

An even shorter proof can be achieved using the well-known formula that for a random variableX{\textstyle X},E(X2)=Var(X)+(E(X))2{\textstyle \mathbb {E} (X^{2})=\operatorname {Var} (X)+(\mathbb {E} (X))^{2}}.[citation needed] By substitutingX{\textstyle X} with,θ^θ{\textstyle {\hat {\theta }}-\theta }, we haveMSE(θ^)=E[(θ^θ)2]=Var(θ^θ)+(E[θ^θ])2=Var(θ^)+Bias2(θ^,θ){\displaystyle {\begin{aligned}\operatorname {MSE} ({\hat {\theta }})&=\mathbb {E} [({\hat {\theta }}-\theta )^{2}]\\&=\operatorname {Var} ({\hat {\theta }}-\theta )+(\mathbb {E} [{\hat {\theta }}-\theta ])^{2}\\&=\operatorname {Var} ({\hat {\theta }})+\operatorname {Bias} ^{2}({\hat {\theta }},\theta )\end{aligned}}}But in real modeling case, MSE could be described as the addition of model variance, model bias, and irreducible uncertainty (seeBias–variance tradeoff). According to the relationship, the MSE of the estimators could be simply used for theefficiency comparison, which includes the information of estimator variance and bias. This is called MSE criterion.

In regression

[edit]
Further information:Reduced chi-squared statistic

Inregression analysis, plotting is a more natural way to view the overall trend of the whole data. The mean of the distance from each point to the predicted regression model can be calculated, and shown as the mean squared error. The squaring is critical to reduce the complexity with negative signs. To minimize MSE, the model could be more accurate, which would mean the model is closer to actual data. One example of a linear regression using this method is theleast squares method—which evaluates appropriateness of linear regression model to modelbivariate dataset,[6] but whose limitation is related to known distribution of the data.

The termmean squared error is sometimes used to refer to the unbiased estimate of error variance: theresidual sum of squares divided by the number ofdegrees of freedom. This definition for a known, computed quantity differs from the above definition for the computed MSE of a predictor, in that a different denominator is used. The denominator is the sample size reduced by the number of model parameters estimated from the same data, (np) forpregressors or (np−1) if an intercept is used (seeerrors and residuals in statistics for more details).[7] Although the MSE (as defined in this article) is not an unbiased estimator of the error variance, it isconsistent, given the consistency of the predictor.

In regression analysis, "mean squared error", often referred to asmean squared prediction error or "out-of-sample mean squared error", can also refer to the mean value of thesquared deviations of the predictions from the true values, over an out-of-sampletest space, generated by a model estimated over aparticular sample space. This also is a known, computed quantity, and it varies by sample and by out-of-sample test space.

In the context ofgradient descent algorithms, it is common to introduce a factor of1/2{\displaystyle 1/2} to the MSE for ease of computation after taking the derivative. So a value which is technically half the mean of squared errors may be called the MSE.

Examples

[edit]

Mean

[edit]

Suppose we have a random sample of sizen{\displaystyle n} from a population,X1,,Xn{\displaystyle X_{1},\dots ,X_{n}}. Suppose the sample units were chosenwith replacement. That is, then{\displaystyle n} units are selected one at a time, and previously selected units are still eligible for selection for alln{\displaystyle n} draws. The usual estimator for the population meanμ{\displaystyle \mu } is the sample average

X¯=1ni=1nXi{\displaystyle {\overline {X}}={\frac {1}{n}}\sum _{i=1}^{n}X_{i}}

which has an expected value equal to the true meanμ{\displaystyle \mu } (so it is unbiased) and a mean squared error of

MSE(X¯)=E[(X¯μ)2]=(σn)2=σ2n{\displaystyle \operatorname {MSE} \left({\overline {X}}\right)=\operatorname {E} \left[\left({\overline {X}}-\mu \right)^{2}\right]=\left({\frac {\sigma }{\sqrt {n}}}\right)^{2}={\frac {\sigma ^{2}}{n}}}

whereσ2{\displaystyle \sigma ^{2}} is thepopulation variance.

For aGaussian distribution this is thebest unbiased estimator of the population mean, that is the one with the lowest MSE (and hence variance) among all unbiased estimators. One can check that the MSE above equals the inverse of theFisher information (seeCramér–Rao bound). But the same sample mean is not the best estimator of the population mean, say, for auniform distribution.

Variance

[edit]
Further information:Sample variance

The usual estimator for the variance is thecorrectedsample variance:

Sn12=1n1i=1n(XiX¯)2=1n1(i=1nXi2nX¯2).{\displaystyle S_{n-1}^{2}={\frac {1}{n-1}}\sum _{i=1}^{n}\left(X_{i}-{\overline {X}}\right)^{2}={\frac {1}{n-1}}\left(\sum _{i=1}^{n}X_{i}^{2}-n{\overline {X}}^{2}\right).}

This is unbiased (its expected value isσ2{\displaystyle \sigma ^{2}}), hence also called theunbiased sample variance, and its MSE is[8]

MSE(Sn12)=1n(μ4n3n1σ4)=1n(γ2+2nn1)σ4,{\displaystyle \operatorname {MSE} (S_{n-1}^{2})={\frac {1}{n}}\left(\mu _{4}-{\frac {n-3}{n-1}}\sigma ^{4}\right)={\frac {1}{n}}\left(\gamma _{2}+{\frac {2n}{n-1}}\right)\sigma ^{4},}

whereμ4{\displaystyle \mu _{4}} is the fourthcentral moment of the distribution or population, andγ2=μ4/σ43{\displaystyle \gamma _{2}=\mu _{4}/\sigma ^{4}-3} is theexcess kurtosis.

However, one can use other estimators forσ2{\displaystyle \sigma ^{2}} which are proportional toSn12{\displaystyle S_{n-1}^{2}}, and an appropriate choice can always give a lower mean squared error. If we define

Sa2=n1aSn12=1ai=1n(XiX¯)2{\displaystyle S_{a}^{2}={\frac {n-1}{a}}S_{n-1}^{2}={\frac {1}{a}}\sum _{i=1}^{n}\left(X_{i}-{\overline {X}}\,\right)^{2}}

then we calculate:

MSE(Sa2)=E[(n1aSn12σ2)2]=E[(n1)2a2Sn142(n1aSn12)σ2+σ4]=(n1)2a2E[Sn14]2(n1a)E[Sn12]σ2+σ4=(n1)2a2E[Sn14]2(n1a)σ4+σ4E[Sn12]=σ2=(n1)2a2(γ2n+n+1n1)σ42(n1a)σ4+σ4E[Sn14]=MSE(Sn12)+σ4=n1na2((n1)γ2+n2+n)σ42(n1a)σ4+σ4{\displaystyle {\begin{aligned}\operatorname {MSE} (S_{a}^{2})&=\operatorname {E} \left[\left({\frac {n-1}{a}}S_{n-1}^{2}-\sigma ^{2}\right)^{2}\right]\\&=\operatorname {E} \left[{\frac {(n-1)^{2}}{a^{2}}}S_{n-1}^{4}-2\left({\frac {n-1}{a}}S_{n-1}^{2}\right)\sigma ^{2}+\sigma ^{4}\right]\\&={\frac {(n-1)^{2}}{a^{2}}}\operatorname {E} \left[S_{n-1}^{4}\right]-2\left({\frac {n-1}{a}}\right)\operatorname {E} \left[S_{n-1}^{2}\right]\sigma ^{2}+\sigma ^{4}\\&={\frac {(n-1)^{2}}{a^{2}}}\operatorname {E} \left[S_{n-1}^{4}\right]-2\left({\frac {n-1}{a}}\right)\sigma ^{4}+\sigma ^{4}&&\operatorname {E} \left[S_{n-1}^{2}\right]=\sigma ^{2}\\&={\frac {(n-1)^{2}}{a^{2}}}\left({\frac {\gamma _{2}}{n}}+{\frac {n+1}{n-1}}\right)\sigma ^{4}-2\left({\frac {n-1}{a}}\right)\sigma ^{4}+\sigma ^{4}&&\operatorname {E} \left[S_{n-1}^{4}\right]=\operatorname {MSE} (S_{n-1}^{2})+\sigma ^{4}\\&={\frac {n-1}{na^{2}}}\left((n-1)\gamma _{2}+n^{2}+n\right)\sigma ^{4}-2\left({\frac {n-1}{a}}\right)\sigma ^{4}+\sigma ^{4}\end{aligned}}}

This is minimized when

a=(n1)γ2+n2+nn=n+1+n1nγ2.{\displaystyle a={\frac {(n-1)\gamma _{2}+n^{2}+n}{n}}=n+1+{\frac {n-1}{n}}\gamma _{2}.}

For aGaussian distribution, whereγ2=0{\displaystyle \gamma _{2}=0}, this means that the MSE is minimized when dividing the sum bya=n+1{\displaystyle a=n+1}. The minimum excess kurtosis isγ2=2{\displaystyle \gamma _{2}=-2},[a] which is achieved by aBernoulli distribution withp = 1/2 (a coin flip), and the MSE is minimized fora=n1+2n.{\displaystyle a=n-1+{\tfrac {2}{n}}.} Hence regardless of the kurtosis, we get a "better" estimate (in the sense of having a lower MSE) by scaling down the unbiased estimator a little bit; this is a simple example of ashrinkage estimator: one "shrinks" the estimator towards zero (scales down the unbiased estimator).

Further, while the corrected sample variance is thebest unbiased estimator (minimum mean squared error among unbiased estimators) of variance for Gaussian distributions, if the distribution is not Gaussian, then even among unbiased estimators, the best unbiased estimator of the variance may not beSn12.{\displaystyle S_{n-1}^{2}.}

Gaussian distribution

[edit]

The following table gives several estimators of the true parameters of the population, μ and σ2, for the Gaussian case.[9]

True valueEstimatorMean squared error
θ=μ{\displaystyle \theta =\mu }θ^{\displaystyle {\hat {\theta }}} = the unbiased estimator of thepopulation mean,X¯=1ni=1n(Xi){\displaystyle {\overline {X}}={\frac {1}{n}}\sum _{i=1}^{n}(X_{i})}MSE(X¯)=E[(X¯μ)2]=σ2n{\displaystyle \operatorname {MSE} ({\overline {X}})=\operatorname {E} [({\overline {X}}-\mu )^{2}]={\frac {\sigma ^{2}}{n}}}
θ=σ2{\displaystyle \theta =\sigma ^{2}}θ^{\displaystyle {\hat {\theta }}} = the unbiased estimator of thepopulation variance,Sn12=1n1i=1n(XiX¯)2{\displaystyle S_{n-1}^{2}={\frac {1}{n-1}}\sum _{i=1}^{n}\left(X_{i}-{\overline {X}}\,\right)^{2}}MSE(Sn12)=E[(Sn12σ2)2]=2n1σ4{\displaystyle \operatorname {MSE} (S_{n-1}^{2})=\operatorname {E} [(S_{n-1}^{2}-\sigma ^{2})^{2}]={\frac {2}{n-1}}\sigma ^{4}}
θ=σ2{\displaystyle \theta =\sigma ^{2}}θ^{\displaystyle {\hat {\theta }}} = the biased estimator of thepopulation variance,Sn2=1ni=1n(XiX¯)2{\displaystyle S_{n}^{2}={\frac {1}{n}}\sum _{i=1}^{n}\left(X_{i}-{\overline {X}}\,\right)^{2}}MSE(Sn2)=E[(Sn2σ2)2]=2n1n2σ4{\displaystyle \operatorname {MSE} (S_{n}^{2})=\operatorname {E} [(S_{n}^{2}-\sigma ^{2})^{2}]={\frac {2n-1}{n^{2}}}\sigma ^{4}}
θ=σ2{\displaystyle \theta =\sigma ^{2}}θ^{\displaystyle {\hat {\theta }}} = the biased estimator of thepopulation variance,Sn+12=1n+1i=1n(XiX¯)2{\displaystyle S_{n+1}^{2}={\frac {1}{n+1}}\sum _{i=1}^{n}\left(X_{i}-{\overline {X}}\,\right)^{2}}MSE(Sn+12)=E([Sn+12σ2)2]=2n+1σ4{\displaystyle \operatorname {MSE} (S_{n+1}^{2})=\operatorname {E} ([S_{n+1}^{2}-\sigma ^{2})^{2}]={\frac {2}{n+1}}\sigma ^{4}}

Interpretation

[edit]

An MSE of zero, meaning that the estimatorθ^{\displaystyle {\hat {\theta }}} predicts observations of the parameterθ{\displaystyle \theta } with perfect accuracy, is ideal (but typically not possible).

Values of MSE may be used for comparative purposes. Two or morestatistical models may be compared using their MSEs—as a measure of how well they explain a given set of observations: An unbiased estimator (estimated from a statistical model) with the smallest variance among all unbiased estimators is thebest unbiased estimator or MVUE (Minimum-Variance Unbiased Estimator).

Bothanalysis of variance andlinear regression techniques estimate the MSE as part of the analysis and use the estimated MSE to determine thestatistical significance of the factors or predictors under study. The goal ofexperimental design is to construct experiments in such a way that when the observations are analyzed, the MSE is close to zero relative to the magnitude of at least one of the estimated treatment effects.

Inone-way analysis of variance, MSE can be calculated by the division of the sum of squared errors and the degree of freedom. Also, the f-value is the ratio of the mean squared treatment and the MSE.

MSE is also used in severalstepwise regression techniques as part of the determination as to how many predictors from a candidate set to include in a model for a given set of observations.

Applications

[edit]

Minimizing MSE is a key criterion in selecting estimators; seeminimum mean-square error. Among unbiased estimators, minimizing the MSE is equivalent to minimizing the variance, and the estimator that does this is theminimum variance unbiased estimator. However, a biased estimator may have lower MSE; seeestimator bias.

Instatistical modelling the MSE can represent the difference between the actual observations and the observation values predicted by the model. In this context, it is used to determine the extent to which the model fits the data as well as whether removing some explanatory variables is possible without significantly harming the model's predictive ability.

Inforecasting andprediction, theBrier score is a measure offorecast skill based on MSE.

Loss function

[edit]

Squared error loss is one of the most widely usedloss functions in statistics, though its widespread use stems more from mathematical convenience than considerations of actual loss in applications.Carl Friedrich Gauss, who introduced the use of mean squared error, was aware of its arbitrariness and was in agreement with objections to it on these grounds.[3] The mathematical benefits of mean squared error are particularly evident in its use at analyzing the performance oflinear regression, as it allows one to partition the variation in a dataset into variation explained by the model and variation explained by randomness.

Criticism

[edit]

The use of mean squared error without question has been criticized by thedecision theoristJames Berger. Mean squared error is the negative of the expected value of one specificutility function, the quadratic utility function, which may not be the appropriate utility function to use under a given set of circumstances. There are, however, some scenarios where mean squared error can serve as a good approximation to a loss function occurring naturally in an application.[10]

Likevariance, mean squared error has the disadvantage of heavily weightingoutliers.[11] This is a result of the squaring of each term, which effectively weights large errors more heavily than small ones. This property, undesirable in many applications, has led researchers to use alternatives such as themean absolute error, or those based on themedian.

See also

[edit]
Machine learning evaluation metrics
Regression
Classification
Clustering
Ranking
Computer vision
NLP
Deep learning
Recommender system
Similarity

Notes

[edit]
  1. ^This can be proved byJensen's inequality as follows. The fourthcentral moment is an upper bound for the square of variance, so that the least value for their ratio is one, therefore, the least value for theexcess kurtosis is −2, achieved, for instance, by a Bernoulli withp=1/2.

References

[edit]
  1. ^ab"Mean Squared Error (MSE)".www.probabilitycourse.com. Retrieved12 September 2020.
  2. ^Bickel, Peter J.; Doksum, Kjell A. (2015).Mathematical Statistics: Basic Ideas and Selected Topics. Vol. I (Second ed.). p. 20.If we use quadratic loss, our risk function is called themean squared error (MSE) ...
  3. ^abLehmann, E. L.; Casella, George (1998).Theory of Point Estimation (2nd ed.). New York: Springer.ISBN 978-0-387-98502-2.MR 1639875.
  4. ^Gareth, James; Witten, Daniela; Hastie, Trevor; Tibshirani, Rob (2021).An Introduction to Statistical Learning: with Applications in R. Springer.ISBN 978-1071614174.
  5. ^Wackerly, Dennis; Mendenhall, William; Scheaffer, Richard L. (2008).Mathematical Statistics with Applications (7 ed.). Belmont, CA, USA: Thomson Higher Education.ISBN 978-0-495-38508-0.
  6. ^A modern introduction to probability and statistics : understanding why and how. Dekking, Michel, 1946–. London: Springer. 2005.ISBN 978-1-85233-896-1.OCLC 262680588.{{cite book}}: CS1 maint: others (link)
  7. ^Steel, R.G.D, and Torrie, J. H.,Principles and Procedures of Statistics with Special Reference to the Biological Sciences.,McGraw Hill, 1960, page 288.
  8. ^Mood, A.; Graybill, F.; Boes, D. (1974).Introduction to the Theory of Statistics (3rd ed.). McGraw-Hill. p. 229.
  9. ^DeGroot, Morris H. (1980).Probability and Statistics (2nd ed.). Addison-Wesley.
  10. ^Berger, James O. (1985). "2.4.2 Certain Standard Loss Functions".Statistical Decision Theory and Bayesian Analysis (2nd ed.). New York: Springer-Verlag. p. 60.ISBN 978-0-387-96098-2.MR 0804611.
  11. ^Bermejo, Sergio; Cabestany, Joan (2001). "Oriented principal component analysis for large margin classifiers".Neural Networks.14 (10):1447–1461.doi:10.1016/S0893-6080(01)00106-X.PMID 11771723.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Mean_squared_error&oldid=1316575636"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp