Logistic regression model is defined as

$$\mathbb{P}\left\{ Y = 1\mid X\right\}=\frac{e^{\beta^T X}}{1 + e^{\beta^T X}}$$

where $Y$ is a random variable in $\left\{0,1\right\}$, and $X$ is a random vector in $\mathbb{R}^d$. Consider the MLE of this model. Under what conditions is the MLE estimator $\hat{\beta}_n$ consistent (i.e. $\hat{\beta}_n \overset{p}\to \beta_0$), and $\sqrt{n}\left(\hat{\beta}_n - \beta_0\right)$ is asymptotically normally distributed?

The theorem I am looking at (which is provided in the lecture but without proof) is

enter image description here

Following this theorem, the conditions I came up with were

  1. Identifiability
  2. $\mathbb{E}\left[ \left| X_i\right|^2\right]$ is finite for $i=1,\cdots,d$.
  3. The matrix $\mathbb{E}\left[XX^T\right]$ is non-singular.

I am wondering if there is any reference on the conditions. I don't know if I'm right or not, partly because I can't find this theorem somewhere else.

  • $\begingroup$ @Xi'an I have read them, but seems like none of them match the theorem I am looking at. For example, I don't understand why the first reference requires something on eigenvalue. $\endgroup$ – 3x89g2 Feb 27 '18 at 15:00
  • $\begingroup$ @Xi'an I have also read the paper by Shifa, but I don't understand why they use a theorem with so many assumptions, instead of the one we covered in the lecture? $\endgroup$ – 3x89g2 Feb 27 '18 at 16:23
  • $\begingroup$ What about asking the lecturer if it comes from a lecture! $\endgroup$ – Xi'an Feb 27 '18 at 17:45
  • $\begingroup$ @Xi'an Good point... She seems reluctant to answer questions, but I guess I will try again... $\endgroup$ – 3x89g2 Feb 27 '18 at 17:57
  • 1
    $\begingroup$ You may want to check out Theorem 4.2.1 and 4.2.2 of Herman Bierens' book "Topics in advanced econometrics". They are standard M estimator results. $\endgroup$ – semibruin Mar 7 '18 at 11:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.