Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Let \(X\) be \(N(0, \theta), 0<\theta<\infty\). (a) Find the Fisher information \(I(\theta)\). (b) If \(X_{1}, X_{2}, \ldots, X_{n}\) is a random sample from this distribution, show that the mle of \(\theta\) is an efficient estimator of \(\theta\). (c) What is the asymptotic distribution of \(\sqrt{n}(\widehat{\theta}-\theta) ?\)

Short Answer

Expert verified
The Fisher information \(I(\theta)\) is \(\frac{1}{2\theta^2}\), the MLE estimator of \(\theta\) is efficient, and the asymptotic distribution of \(\sqrt{n}(\widehat{\theta}-\theta)\) is \(N\left(0,2\theta^2\right)\).

Step by step solution

01

Fisher Information

First, let's find out the Fisher information. Note that the probability density function of \(X\), a normal distribution is given by \(f(x; \theta) = \frac{1}{\sqrt{2 \pi \theta}} e^{-\frac{x^2}{2\theta}}\). The derivative of the log-likelihood with respect to \( \theta \) is \(\frac{d}{d\theta} \log f(x;\theta) = -\frac{1}{2\theta} + \frac{x^2}{2\theta^2}\). The Fisher information \(I(\theta)\) is the variance of the derivative of the log-likelihood, which is \(I(\theta) = E\left[\left(\frac{d}{d\theta} \log f(X; \theta)\right)^2\right] = \frac{1}{2\theta^2}\).
02

Efficiency of the MLE

Let's denote the sample mean of \(n\) observations by \(\overline{X}\). We know from the theory, the MLE of \( \theta \) is \( \widehat{\theta} = \overline{X}^2 \). The variance of \(\overline{X}\) is \( \theta/n \). Therefore, the variance of \( \widehat{\theta} \) is \(4 \cdot \theta^2/n \), which is exactly the Cramér-Rao lower bound. Thus, the MLE \( \widehat{\theta} \) is an efficient estimator of \( \theta \).
03

Asymptotic Distribution

Because the MLE \( \widehat{\theta} \) is efficient, we can use the Fisher Information to find the asymptotic distribution of \( \sqrt{n}(\widehat{\theta} - \theta) \). By the Central Limit Theorem, we know that \(\sqrt{n}(\widehat{\theta} - \theta)\) converges in distribution to \(N(0, I(\theta)^{-1})\). Substituting \(I(\theta) = \frac{1}{2\theta^2}\), the asymptotic distribution of \(\sqrt{n}(\widehat{\theta}-\theta)\) is \(N\left(0,2\theta^2\right)\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Let \(X_{1}, X_{2}, \ldots, X_{n}\) be a random sample from the Poisson distribution with \(0<\theta \leq 2\). Show that the mle of \(\theta\) is \(\widehat{\theta}=\min \\{\bar{X}, 2\\}\).

Let \(Y_{1}

Suppose \(X_{1}, \ldots, X_{n}\) are iid with pdf \(f(x ; \theta)=2 x / \theta^{2}, \quad 0

Rao (page 368,1973 ) considers a problem in the estimation of linkages in genetics. McLachlan and Krishnan (1997) also discuss this problem and we present their model. For our purposes, it can be described as a multinomial model with the four categories \(C_{1}, C_{2}, C_{3}\), and \(C_{4}\). For a sample of size \(n\), let \(\mathbf{X}=\left(X_{1}, X_{2}, X_{3}, X_{4}\right)^{\prime}\) denote the observed frequencies of the four categories. Hence, \(n=\sum_{i=1}^{4} X_{i} .\) The probability model is $$ \begin{array}{|c|c|c|c|} \hline C_{1} & C_{2} & C_{3} & C_{4} \\ \hline \frac{1}{2}+\frac{1}{4} \theta & \frac{1}{4}-\frac{1}{4} \theta & \frac{1}{4}-\frac{1}{4} \theta & \frac{1}{4} \theta \\ \hline \end{array} $$ where the parameter \(\theta\) satisfies \(0 \leq \theta \leq 1\). In this exercise, we obtain the mle of \(\theta\). (a) Show that likelihood function is given by $$ L(\theta \mid \mathbf{x})=\frac{n !}{x_{1} ! x_{2} ! x_{3} ! x_{4} !}\left[\frac{1}{2}+\frac{1}{4} \theta\right]^{x_{1}}\left[\frac{1}{4}-\frac{1}{4} \theta\right]^{x_{2}+x_{3}}\left[\frac{1}{4} \theta\right]^{x_{4}} $$ (b) Show that the log of the likelihood function can be expressed as a constant (not involving parameters) plus the term $$ x_{1} \log [2+\theta]+\left[x_{2}+x_{3}\right] \log [1-\theta]+x_{4} \log \theta $$ (c) Obtain the partial derivative with respect to \(\theta\) of the last expression, set the result to 0 , and solve for the mle. (This will result in a quadratic equation that has one positive and one negative root.)

Consider a location model $$ X_{i}=\theta+e_{i}, \quad i=1, \ldots, n $$ where \(e_{1}, e_{2}, \ldots, e_{n}\) are iid with pdf \(f(z)\). There is a nice geometric interpretation for estimating \(\theta\). Let \(\mathbf{X}=\left(X_{1}, \ldots, X_{n}\right)^{\prime}\) and \(\mathbf{e}=\left(e_{1}, \ldots, e_{n}\right)^{\prime}\) be the vectors of observations and random error, respectively, and let \(\boldsymbol{\mu}=\theta \mathbf{1}\), where \(\mathbf{1}\) is a vector with all components equal to 1 . Let \(V\) be the subspace of vectors of the form \(\mu\); i.e., \(V=\\{\mathbf{v}: \mathbf{v}=a \mathbf{1}\), for some \(a \in R\\}\). Then in vector notation we can write the model as $$ \mathbf{X}=\boldsymbol{\mu}+\mathbf{e}, \quad \boldsymbol{\mu} \in V $$ Then we can summarize the model by saying, "Except for the random error vector e, X would reside in \(V\)." Hence, it makes sense intuitively to estimate \(\boldsymbol{\mu}\) by a vector in \(V\) that is "closest" to \(\mathbf{X}\). That is, given a norm \(\|\cdot\|\) in \(R^{n}\), choose $$ \widehat{\boldsymbol{\mu}}=\operatorname{Argmin}\|\mathbf{X}-\mathbf{v}\|, \quad \mathbf{v} \in V $$ (a) If the error pdf is the Laplace, \((2.2 .4)\), show that the minimization in \((6.3 .27)\) is equivalent to maximizing the likelihood when the norm is the \(l_{1}\) norm given by $$ \|\mathbf{v}\|_{1}=\sum_{i=1}^{n}\left|v_{i}\right| $$ (b) If the error pdf is the \(N(0,1)\), show that the minimization in \((6.3 .27)\) is equivalent to maximizing the likelihood when the norm is given by the square of the \(l_{2}\) norm $$ \|\mathbf{v}\|_{2}^{2}=\sum_{i=1}^{n} v_{i}^{2} $$

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free