q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
THE JOURNEY THROUGH TIME

Explore Black History

Explore the people, places, events, achievements, struggles and stories that shaped our journey.

✊🏾

Civil Rights

Movements, leaders, victories and the continuing fight for equality.

⚙️

Black Inventors

Innovation, patents, science, technology and world-changing contributions.

🏆

Sports

Pioneers, champions, Negro Leagues, records, activism and excellence.

♟️

People

Meet the people whose lives, choices and achievements shaped the journey.

📍

Places

Black towns, communities, institutions and places where history happened.

📜

Events

Moments that changed communities, movements, institutions and the nation.

Enter a person, place, event, or topic.
MY'STORY

The MOVE Fire

This is a personal recollection on the Move fire on May 13, 1985 Philadelphia police fired thousands of rounds at the MOVE house, city officials approved dropping an explosive device on the roof, the resulting fire was allowed to burn, 11 people—including five children—died, and 61 homes were destroyed. Philadelphia City Council later called it a “brutal attack carried out by the City of Philadelphia on its own citizens” and acknowledged that no individual faced criminal consequences for the bombing. One timeline correction worth preserving for the BHP record: the major previous MOVE-police confrontation was August 8, 1978, about seven years before the bombing, not a year or two earlier. Officer James Ramp was killed, other police and firefighters were wounded, nine MOVE members were later convicted, and television cameras recorded police beating Delbert Africa during his arrest. The 1985 MOVE Commission later specifically criticized city planners for failing to adequately use lessons from that 1978 confrontation. And that actually strengthens the point you’re making: 1985 did not happen without precedent or institutional memory. There had already been a deadly confrontation with MOVE, years of conflict, negotiations and police involvement before Osage Avenue.

MORE →
BLACK FACTS
The Truths They Never Taught You...

Katherine Johnson — Mathematics to the Moon

Katherine Johnson’s mathematical calculations helped guide some of America’s most important early space missions while she confronted the racial and gender barriers faced by Black women in twentieth-century America.

MORE →
BHP gathered finds from its connected research sources. Showing the 4 strongest Black History matches.
← BACK TO RESULTS
Wikipedia

Consistent estimator

{T1, T2, T3, ...} is a sequence of estimators for parameter θ0, the true value of which is 4. This sequence is consistent: the estimators are getting more and more concentrated near the true value θ0; at the same time, these estimators are biased. The limiting distribution of the sequence is a degenerate random variable which equals θ0 with probability 1.

In statistics, a consistent estimator or asymptotically consistent estimator is an estimator—a rule for computing estimates of a parameter θ0—having the property that as the number of data points used increases indefinitely, the resulting sequence of estimates converges in probability to θ0. This means that the distributions of the estimates become more and more concentrated near the true value of the parameter being estimated, so that the probability of the estimator being arbitrarily close to θ0 converges to one.

In practice one constructs an estimator as a function of an available sample of size n, and then imagines being able to keep collecting data and expanding the sample ad infinitum. In this way one would obtain a sequence of estimates indexed by n, and consistency is a property of what occurs as the sample size “grows to infinity”. If the sequence of estimates can be mathematically shown to converge in probability to the true value θ0, it is called a consistent estimator; otherwise the estimator is said to be inconsistent.

Consistency as defined here is sometimes referred to as weak consistency. When we replace convergence in probability with almost sure convergence, then the estimator is said to be strongly consistent. Consistency is related to bias; see bias versus consistency.

Definition

[edit]

Formally speaking, an estimator Tn of parameter θ is said to be weakly consistent, if it converges in probability to the true value of the parameter:[1]

i.e. if, for all ε > 0

An estimator Tn of parameter θ is said to be strongly consistent, if it converges almost surely to the true value of the parameter:

A more rigorous definition takes into account the fact that θ is actually unknown, and thus, the convergence in probability must take place for every possible value of this parameter. Suppose {pθ: θ ∈ Θ} is a family of distributions (the parametric model), and Xθ = {X1, X2, … : Xi ~ pθ} is an infinite sample from the distribution pθ. Let { Tn(Xθ) } be a sequence of estimators for some parameter g(θ). Usually, Tn will be based on the first n observations of a sample. Then this sequence {Tn} is said to be (weakly) consistent if [2]

This definition uses g(θ) instead of simply θ, because often one is interested in estimating a certain function or a sub-vector of the underlying parameter. In the next example, we estimate the location parameter of the model, but not the scale:

Examples

[edit]

Sample mean of a normal random variable

[edit]

Suppose one has a sequence of statistically independent observations {X1, X2, ...} from a normal N(μ, σ2) distribution. To estimate μ based on the first n observations, one can use the sample mean: Tn = (X1 + ... + Xn)/n. This defines a sequence of estimators, indexed by the sample size n.

From the properties of the normal distribution, we know the sampling distribution of this statistic: Tn is itself normally distributed, with mean μ and variance σ2/n. Equivalently, has a standard normal distribution:

as n tends to infinity, for any fixed ε > 0. Therefore, the sequence Tn of sample means is consistent for the population mean μ (recalling that is the cumulative distribution of the standard normal distribution).

Establishing consistency

[edit]

The notion of asymptotic consistency is very close, almost synonymous to the notion of convergence in probability. As such, any theorem, lemma, or property which establishes convergence in probability may be used to prove the consistency. Many such tools exist:

  • In order to demonstrate consistency directly from the definition one can use the inequality [3]

the most common choice for function h being either the absolute value (in which case it is known as Markov inequality), or the quadratic function (respectively Chebyshev's inequality).

  • Another useful result is the continuous mapping theorem: if Tn is consistent for θ and g(·) is a real-valued function continuous at the point θ, then g(Tn) will be consistent for g(θ):[4]
  • Slutsky's theorem can be used to combine several different estimators, or an estimator with a non-random convergent sequence. If Tn →dα, and Sn →pβ, then [5]
  • If estimator Tn is given by an explicit formula, then most likely the formula will employ sums of random variables, and then the law of large numbers can be used: for a sequence {Xn} of random variables and under suitable conditions,

Bias versus consistency

[edit]

Unbiased but not consistent

[edit]

An estimator can be unbiased but not consistent. For example, for an iid sample {x
1
,..., x
n
} one can use T
n
(X) = x
n
as the estimator of the mean E[X]. Note that here the sampling distribution of T
n
is the same as the underlying distribution (for any n, as it ignores all points but the last). So E[T
n
(X)] = E[X] for any n, hence it is unbiased, but it does not converge to any value.

However, if a sequence of estimators is unbiased and converges to a value, then it is consistent, as it must converge to the correct value.

Biased but consistent

[edit]

Alternatively, an estimator can be biased but consistent. For example, if the mean is estimated by it is biased, but as , it approaches the correct value, and so it is consistent.

Important examples include the sample variance and sample standard deviation. Without Bessel's correction (that is, when using the sample size instead of the degrees of freedom ), these are both negatively biased but consistent estimators. With the correction, the corrected sample variance is unbiased, while the corrected sample standard deviation is still biased, but less so, and both are still consistent: the correction factor converges to 1 as sample size grows.

Here is another example. Let be a sequence of estimators for .

We can see that , , and the bias does not converge to zero.

See also

[edit]

Notes

[edit]
  1. ^ Amemiya 1985, Definition 3.4.2.
  2. ^ Lehman & Casella 1998, p. 332.
  3. ^ Amemiya 1985, equation (3.2.5).
  4. ^ Amemiya 1985, Theorem 3.2.6.
  5. ^ Amemiya 1985, Theorem 3.2.7.
  6. ^ Newey & McFadden 1994, Chapter 2.

References

[edit]
  • Amemiya, Takeshi (1985). Advanced Econometrics. Harvard University Press. ISBN 0-674-00560-0.
  • Lehmann, E. L.; Casella, G. (1998). Theory of Point Estimation (2nd ed.). Springer. ISBN 0-387-98502-6.
  • Newey, W. K.; McFadden, D. (1994). "Chapter 36: Large sample estimation and hypothesis testing". In Robert F. Engle; Daniel L. McFadden (eds.). Handbook of Econometrics. Vol. 4. Elsevier Science. ISBN 0-444-88766-0. S2CID 29436457.
  • Nikulin, M. S. (2001) [1994], "Consistent estimator", Encyclopedia of Mathematics, EMS Press
  • Sober, E. (1988), "Likelihood and convergence", Philosophy of Science, 55 (2): 228–237, doi:10.1086/289429.
[edit]

Source: Wikipedia. Article content is retrieved live through the MediaWiki API.

Wikipedia

Consistent estimator

In statistics, a consistent estimator or asymptotically consistent estimator is an estimator—a rule for computing estimates of a parameter θ0—having the property that as the number of data points used increases indefinitely, the resulting sequence of estimates converges in probability to θ0. This means that the distributions of the estimates become more and more concentrated near the true value of the parameter being estimated, so that the probability of the estimator being arbitrarily close to θ0 converges to one. In practice one constructs an estimator as a function of an available sample of size n, and then imagines being able to keep collecting data and expanding the sample ad infinitum. In this way one would obtain a sequence of estimates indexed by n, and consistency is a property of what occurs as the sample size “grows to infinity”. If the sequence of estimates can be mathematically shown to converge in probability to the true value θ0, it is called a consistent estimator; otherwise the estimator is said to be inconsistent. Consistency as defined here is sometimes referred to as weak consistency. When we replace convergence in probability with almost sure convergence, then the estimator is said to be strongly consistent. Consistency is related to bias; see bias versus consistency.

MORE →
No preview image
Wikipedia

Bias of an estimator

In statistics, the bias of an estimator (or bias function) is the difference between this estimator's expected value and the true value of the parameter being estimated. An estimator or decision rule with zero bias is called unbiased. In statistics, "bias" is an objective property of an estimator. Bias is a distinct concept from consistency: consistent estimators converge in probability to the true value of the parameter, but may be biased or unbiased (see bias versus consistency for more). All else being equal, an unbiased estimator is preferable to a biased estimator, although in practice, biased estimators (with generally small bias) are frequently used. When a biased estimator is used, bounds of the bias are calculated. A biased estimator may be used for various reasons: because an unbiased estimator does not exist without further assumptions about a population; because an estimator is difficult to compute (as in unbiased estimation of standard deviation); because a biased estimator may be unbiased with respect to different measures of central tendency; because a biased estimator gives a lower value of some loss function (particularly mean squared error) compared with unbiased estimators (notably in shrinkage estimators); or because in some cases being unbiased is too strong a condition, and the only unbiased estimators are not useful. Bias can also be measured with respect to the median, rather than the mean (expected value), in which case one distinguishes median-unbiased from the usual mean-unbiasedness property. Mean-unbiasedness is not preserved under non-linear transformations, though median-unbiasedness is (see § Effect of transformations); for example, the sample variance is a biased estimator for the population variance. These are all illustrated below. An unbiased estimator for a parameter need not always exist. For example, there is no unbiased estimator for the reciprocal of the parameter of a binomial random variable.

MORE →
No preview image
Wikipedia

Newey–West estimator

A Newey–West estimator is used in statistics and econometrics to provide an estimate of the covariance matrix of the parameters of a regression-type model where the standard assumptions of regression analysis do not apply. It was devised by Whitney K. Newey and Kenneth D. West in 1987, although there are a number of later variants. The estimator is used to try to overcome autocorrelation (also called serial correlation), and heteroskedasticity in the error terms in the models, often for regressions applied to time series data. The abbreviation "HAC," sometimes used for the estimator, stands for "heteroskedasticity and autocorrelation consistent." There are a number of HAC estimators described in, and HAC estimator does not refer uniquely to Newey–West. One version of Newey–West Bartlett requires the user to specify the bandwidth and usage of the Bartlett kernel from Kernel density estimation Regression models estimated with time series data often exhibit autocorrelation; that is, the error terms are correlated over time. The heteroscedastic consistent estimator of the error covariance is constructed from a term X T Σ X {\displaystyle X^{\operatorname {T} }\Sigma X} , where X {\displaystyle X} is the design matrix for the regression problem and Σ {\displaystyle \Sigma } is the covariance matrix of the residuals. The least squares estimator b {\displaystyle b} is a consistent estimator of β {\displaystyle \beta } . This implies that the least squares residuals e i {\displaystyle e_{i}} are "point-wise" consistent estimators of their population counterparts E i {\displaystyle E_{i}} . The general approach, then, will be to use X {\displaystyle X} and e {\displaystyle e} to devise an estimator of X T Σ X {\displaystyle X^{\operatorname {T} }\Sigma X} . This means that as the time between error terms increases, the correlation between the error terms decreases. The estimator thus can be used to improve the ordinary least squares (OLS) regression when the residuals are heteroscedastic and/or autocorrelated. X T Σ X = 1 T ∑ t = 1 T e t 2 x t x t T + 1 T ∑ ℓ = 1 L ∑ t = ℓ + 1 T w ℓ e t e t − ℓ ( x t x t − ℓ T + x t − ℓ x t T ) {\displaystyle X^{\operatorname {T} }\Sigma X={\frac {1}{T}}\sum _{t=1}^{T}e_{t}^{2}x_{t}x_{t}^{\operatorname {T} }+{\frac {1}{T}}\sum _{\ell =1}^{L}\sum _{t=\ell +1}^{T}w_{\ell }e_{t}e_{t-\ell }(x_{t}x_{t-\ell }^{\operatorname {T} }+x_{t-\ell }x_{t}^{\operatorname {T} })} w ℓ = 1 − ℓ L + 1 {\displaystyle w_{\ell }=1-{\frac {\ell }{L+1}}} where T is the sample size, e t {\displaystyle e_{t}} is the t th {\displaystyle t^{\text{th}}} residual and x t {\displaystyle x_{t}} is the t th {\displaystyle t^{\text{th}}} row of the design matrix, and w ℓ {\displaystyle w_{\ell }} is the Bartlett kernel and can be thought of as a weight that decreases with increasing separation between samples. Disturbances that are farther apart from each other are given lower weight, while those with equal subscripts are given a weight of 1. This ensures that second term converges (in some appropriate sense) to a finite matrix. This weighting scheme also ensures that the resulting covariance matrix is positive semi-definite. L = 0 reduces the Newey–West estimator to Huber–White standard error. L specifies the "maximum lag considered for the control of autocorrelation. A common choice for L" is T 1 / 4 {\displaystyle T^{1/4}} .

MORE →
No preview image
Wikipedia

Generated regressor

In least squares estimation problems, sometimes one or more regressors specified in the model are not observable. One way to circumvent this issue is to estimate or generate regressors from observable data. This generated regressor method is also applicable to unobserved instrumental variables. Under some regularity conditions, consistency and asymptotic normality of least squares estimator is preserved, but asymptotic variance has a different form in general. Suppose the model of interest is the following: y i = g ( x 1 i , x 2 i , β ) + u i {\displaystyle y_{i}=g(x_{1i},x_{2i},\beta )+u_{i}} where g is a conditional mean function and its form is known up to finite-dimensional parameter β. Here x 2 i {\displaystyle x_{2i}} is not observable, but we know that x 2 i = h ( w i , γ ) {\displaystyle x_{2i}=h(w_{i},\gamma )} for some function h known up to parameter γ {\displaystyle \gamma } , and a random sample y i = g ( x 1 i , x 2 i , β ) + u i {\displaystyle y_{i}=g(x_{1i},x_{2i},\beta )+u_{i}} is available. Suppose we have a consistent estimator γ ^ {\displaystyle {\hat {\gamma }}} of γ {\displaystyle \gamma } that uses the observation w i {\displaystyle w_{i}} 's. Then, β can be estimated by (Non-Linear) Least Squares using x 2 i ^ = h ( w i , γ ^ ) {\displaystyle {\hat {x_{2i}}}=h(w_{i},{\hat {\gamma }})} . Some examples of the above setup include Anderson et al. (1976 and Barro (1977). This problem falls into the framework of two-step M-estimator and thus consistency and asymptotic normality of the estimator can be verified using the general theory of two-step M-estimator. As in general two-step M-estimator problem, asymptotic variance of a generated regressor estimator is usually different from that of the estimator with all regressors observed. Yet, in some special cases, the asymptotic variances of the two estimators are identical. To give one such example, consider the setting in which the regression function is linear in parameter and unobserved regressor is a scalar. Denoting the coefficient of unobserved regressor by δ {\displaystyle \delta } if δ = 0 {\displaystyle \delta =0} and E [ ▽ γ h ( W , γ ) U ] = 0 {\displaystyle E[\triangledown \gamma h(W,\gamma )U]=0} then the asymptotic variance is independent of whether observing the regressor. With minor modifications in the model, the above formulation is also applicable to Instrumental Variable estimation. Suppose the model of interest is linear in parameter. Error term is correlated with some of the regressors, and the model specifies some instrumental variables, which are not observable but have the representation z i = h ( w i , γ ) {\displaystyle z_{i}=h(w_{i},\gamma )} . If a consistent estimator of γ {\displaystyle \gamma } of γ ^ {\displaystyle {\hat {\gamma }}} is available using z ^ i = h ( w i , γ ^ ) {\displaystyle {\hat {z}}_{i}=h(w_{i},{\hat {\gamma }})} as instruments, the parameter of interest can be estimated by IV. Similar to the above case, consistency and asymptotic normality follows under mild conditions, and the asymptotic variance has a different form than observed IV case. Yet, there are cases in which the two estimators have the same asymptotic variance. One such case occurs if E [ ▽ γ h ( W , γ ) ] = 0 [ 4 ] {\displaystyle E[\triangledown \gamma h(W,\gamma )]=0[4]} In this special case, inference on the estimated parameter can be conducted with the usual IV standard error estimator.

MORE →
TOPIC OF THE DAY

Greenwood / Black Wall Street

Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.

MORE →
TRIVIA QUESTION OF THE DAY

Which heavyweight champion was known as the “Brown Bomber”?

Joe Louis.