# Lab 3: Parameter Estimation

- Page ID
- 9029

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\id}{\mathrm{id}}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\kernel}{\mathrm{null}\,}\)

\( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\)

\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\)

\( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)

\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)

\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vectorC}[1]{\textbf{#1}} \)

\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)#### Objective

Explore properties of estimators and understand what makes an estimator preferred.

#### Definitions

- estimator vs. estimate
- maximum likelihood estimation: likelihood function, log-likelihood
- method of moments estimation
- bias, unbiased estimator
- efficiency of estimators
- mean square error (MSE)
- bias-variance trade-off

#### Introduction

In class this week, we went over two procedures for estimating parameters: ** maximum likelihood estimation** and

**. There are other methods of estimation that may exist in a given context, including using "plug-in" estimators. This begs the question of which method is best. In this lab, you will explore properties of estimators and using these properties learn what criteria we think good estimators should satisfy. Each property provides a "sniff test": an estimator that fails these just doesn't smell right.**

*method of moments*#### Activities

**Getting Started:** Navigate to your class folder structure. Within your "Labs" folder make a subfolder called "Lab3". Next, download the lab notebook .Rmd file for this lab from Blackboard and save it in your "Lab3" folder. There are no datasets used in this lab.

Within RStudio, navigate to your "Lab3" folder via the file browser in the lower right pane and then click "More > Set as working directory". Get set to write your observations and R commands in an R Markdown file by opening the "lab3_notebook.Rmd" file in RStudio. Remember to add your name as the author in line 3 of the document. For this lab, enter all of your commands into code chunks in the lab notebook. You can still experiment with code in an R script, if you want. To set up an R Script in RStudio, in the upper left corner click “File > New File > R script”. A new tab should open up in the upper left pane of RStudio.

**Maximum Likelihood Estimation:** Before we get into the properties, let's revisit maximum likelihood estimation.

**Likelihood Function, Maximum Likelihood Estimate**

Suppose \( X_1, ..., X_n\) represent a random sample from a probability distribution with associated parameter \( \theta \) and pmf/pdf given by \( f(x; \theta) \). The *l ikelihood function* \( L(\theta) = L(\theta | x_1, ..., x_n) \) gives the likelihood of \( \theta \), given the observed sample values \( x_1, ..., x_n \), and is calculated as follows:

\( L(\theta) =\displaystyle \prod_{i =1}^{n} f(x_i; \theta) = f(x_1; \theta)\cdot f(x_2; \theta)\cdots f(x_n; \theta) \)

The * maximum likelihood estimate *(MLE) \(\hat{\theta}_{MLE} \) is a value of \( \theta \) that maximizes the likelihood function, or equivalently that maximizes the log-likelihood function: ln\(L(\theta) \).

So, the likelihood function \(L(\theta)\) is a function of the unknown parameter \(\theta\), and we estimate \(\theta\) by maximizing \(L(\theta)\). Remember that we can use calculus to find the value of \(\theta\) that maximizes the likelihood by setting the derivative equal to 0, \(L'(\theta)=0\), and then solving for \(\theta\) to find the MLE.

In practice, we usually maximize the ** log-likelihood**, because taking the logarithm of a product results in a sum:

ln\(L(\theta)) =\) ln [\(f(x_1; \theta)f(x_2; \theta) ... f(x_n; \theta)] \)

=ln\(f(x_1;\theta)) +\) ln\((f(x_2; \theta) + ... + \) ln\(f(x_n; \theta)) = \displaystyle\sum_{i = 1}^{n}\) ln\((f(x_i; \theta)) \)

In most cases, we are able to find a closed-form expression for the MLE. However, this is not always possible, as the following example demonstrates.

**Example: **Suppose \(X_1, . . ., X_n\) are a random sample from the Cauchy distribution, which has pdf given by \(\displaystyle{f(x; \theta) = \frac{1}{\pi(1 + (x - \theta)^2}}\), for \(x\), \(\theta \in \mathbb{R} \). The likelihood function for \( \theta \) is

\( L(\theta) = \displaystyle \frac{1}{\pi^n \displaystyle \prod_{i = 1}^{n} [1 + (X_i - \theta)^2]} \). (1)

Thus, \( L(\theta) \) will be maximized when \( \prod_{i = 1}^{n} [1 + (X_i - \theta)^2] \) is minimized, or equivalently when \( \sum_{i = 1}^{n}\) ln\((1 + (X_i - \theta)^2) \) is minimized. The value of \( \theta \) that minimizes this expression must be determined by numerical methods.

_____________________________________________________

#### Pause for Reflection #1:

- On a separate piece of paper, write out the details for deriving the likelihood function \(L(\theta)\) in Equation (1).
- Next, explain why \(L(\theta)\) will be maximized when the expression \( \sum_{i = 1}^{n}\) ln(\(1 + (X_i - \theta)^2)\) is minimized. Type your response directly into your lab notebook in RStudio.
- Finally, on the same piece of paper you worked out step 1, take the derivative (with respect to \(\theta\)) of the sum expression given in step 2 to see why the mathematical approach of setting the derivative equal to 0 will not work in this example.

Take a picture of your written work for steps 1 and 3 and upload it to your Lab3 folder in order to include in your lab notebook.

_____________________________________________________

Continuing with the Cauchy distribution, suppose you make the following observations for a random sample of size four: \(x_1 = 1, x_2 = 2, x_3 = 2,\) and \(x_4 = 3\). Then, to maximize \(L(\theta)\), you need to minimize

ln\((1 + (1-\theta)^2) + \ln(1 + (2-\theta)^2) + \ln(1 + (2-\theta)^2) + \ln(1 + (3-\theta)^2)\).

Since we cannot find the minimum of the above analytically, you will use the optimize() function in R. Type the following in a code chunk in your Lab 3 notebook and run each line:

x = c(1, 2, 2, 3) g = function(theta) sum(log(1 + (x-theta)^2)) optimize(g, interval = c(0,4))

_____________________________________________________

#### Pause for Reflection #2

- In your lab notebook, describe what each of the three lines of code above are doing. You may find it helpful to type ?c, help("function"), and ?optimize one at a time in the console window to pull up info in the Help window (lower right pane) for each of these commands.
- Based on the results of this code, what is the maximum likelihood estimate of \(\theta\) based on the given data?

_____________________________________________________

**Unbiasedness:** The first property of estimators that we will consider is *bias*. An estimator \(\hat{\theta}\) is biased if, on average, it tends to be too high or too low, relative to the true value of \(\theta\). Formally, this is defined using expected values:

Definition 3.1

The * bias *of an estimator \( \hat{\theta} \) is given by

Bias(\(\hat{\theta}) =\) E\([\hat{\theta}] - \theta\).

In other words, Definition 3.1 states that a statistic used to estimate a parameter is ** biased **when the mean of its sampling distribution is not equal to the true value of the parameter. We will explore sampling distributions more in depth in next week. For now, we will use R to

*approximate*sampling distributions.

We like an estimator to be, on average, equal to the parameter it is estimating. That is, we like estimators that are ** unbiased**, or equivalently, Bias(\(\hat{\theta}\)) = 0. You will show in the homework that the sample mean is always an unbiased estimator of the population mean \(\mu\). It can also be shown that the sample proportion is also an unbiased estimator of the population proportion.

The case of the sample variance is less straightforward. Given a sample of values \(x_1, x_2, \ldots, x_n\), the "plug-in" estimator of the population variance \(\sigma^2\) is

\(\hat{\sigma}^2 = \frac{1}{n}\displaystyle\sum^n_{i=1}(x_i-\bar{x})^2.\)

However, in Lab 1, we defined the sample variance as

\(s^2 = \frac{1}{n-1}\displaystyle \sum^n_{i=1}(x_i-\bar{x})^2,\)

which is computed in R using the function var(). Notice the difference between the two estimators, namely, the division by "\(n\)" versus "\(n-1\)". It turns out that the plug-in estimator \(\hat{\sigma}^2\) is biased, but the sample variance \(s^2\) is unbiased.

Let's explore this in the context of the standard normal distribution: \(N(\mu=0, \sigma=1)\). In this context, we know the value of the parameter we are estimating, namely \(\sigma^2 = 1\). So we know that in order for an estimator of \(\sigma^2\) to be unbiased, its expected value needs to equal 1. You will run a simulation in R to see how the two estimators, \(\hat{\sigma}^2\) and \(s^2\), perform. With the following code (already added to the lab notebook for you), you will draw random samples of size 15 from \(N(0,1)\). For each sample, you will compute \(\hat{\sigma}^2\) and \(s^2\) and record the values. You will repeat this 1000 times.

sample.var = numeric(1000) # object to store sample variances plugin = numeric(1000) # object to store plug-in estimates n = 15 # set sample size for (i in 1:1000) { x = rnorm(n) # draw a random sample of size n from N(0,1) population sample.var[i] = var(x) # compute and store sample variance of ith sample plugin[i] = ((n-1)/n)*var(x) # compute and store plug-in estimate from ith sample }

We can now investigate the results of the simulation by finding the mean for the estimates of \(\sigma^2 \) based on the two estimators \(\hat{\sigma}^2\) (plugin.var) and \(s^2\) (sample.var). We can also visualize the results using histograms.

_____________________________________________________

#### Pause for Reflection #3

- In your lab notebook, calculate the respective means for the 1000 samples of \(\hat{\sigma}^2\) and \(s^2\) you found with the simulation.
- Code has been provided in your lab notebook to create histograms of the simulated values for \(\hat{\sigma}^2\) and \(s^2\). Run the code chunk and answer the following: Do the results you found support the claim that \(\hat{\sigma}^2\) is a biased estimator of \(\sigma^2\) and \(s^2\) is unbiased? Why or why not?

_____________________________________________________

**Efficiency:** What happens when you have two estimators that are both unbiased? Which one should you use? The next property we consider, *efficiency*, provides a criterion for comparing unbiased estimators that depends on their variance.

Definition 3.2

If \(\hat{\theta}_1\) and \(\hat{\theta}_2\) are both unbiased estimators of \(\theta\) and \(\text{Var}(\hat{\theta}_1) < \text{Var}(\hat{\theta}_2)\), then \(\hat{\theta}_1\) is said to be more ** efficient** than \(\hat{\theta}_2\).

We will again explore this property with a simulation, this time in the context of the uniform distribution on the closed interval [0,\(\beta\)].

At the start of lab, we will find the ** method of moments estimator** for \(\beta\) to be \(\hat{\beta}_1 = 2\bar{X}\), i.e., twice the mean of a given sample. It can be shown that this estimator is unbiased (a fact we will prove later). Using maximum likelihood estimation, we can find another unbiased estimator of \(\beta\) given by \(\hat{\beta}_2 = ((n+1)/n)X_{\text{max}}\), where \(X_{\text{max}}\) denotes the largest value in a random sample (it is referred to as the

*largest order statistic*).

Use the following code (already provided in your lab notebook) to run a simulation to see how these two estimators perform in the specific context of drawing random samples of size 25 from uniform [0,12].

beta.1hat = numeric(1000) beta.2hat = numeric(1000) for (i in 1:1000) { x = runif(25, 0, 12) # draw a random sample of size 25 from uniform[0,12] beta.1hat[i] = 2 * mean(x) beta.2hat[i] = ((25 + 1)/25) * max(x) } # descriptive statistics mean(beta.1hat) sd(beta.1hat) mean(beta.2hat) sd(beta.2hat) # graphical comparison hist(beta.1hat, xlim = c(8,16), ylim = c(0,650), xlab = "2*mean") hist(beta.2hat, xlim = c(8,16), ylim = c(0,650), xlab = "((25+1)/25)*max")

_____________________________________________________

#### Pause for Reflection #4

- Do the results support the claim that both \(\hat{\beta}_1\) (beta.1hat) and \(\hat{\beta}_2\) (beta.2hat) are unbiased estimators for \(\beta\)? Why or why not?
- Which estimator is more efficient, i.e., which estimator exhibits a smaller amount of variability?
- Given these results, which estimator do you think you should use?

_____________________________________________________

**Mean Square Error:** The final criterion we consider combines both bias and variance. This is useful for comparing estimators that are not both unbiased. We may prefer an estimator with small bias and small variance over one that is unbiased but with large variance. The following definition provides a way to quantify the preference.

Definition 3.3

The * mean square error *(MSE) of an estimator is MSE(\(\hat{\theta}) =\) E\([(\hat{\theta} - \theta)^2]\).

MSE measures the average squared difference between the estimator and the parameter; it takes both the variability and bias of the estimator into account, as the following proposition shows.

Proposition 3.1

MSE(\( \hat{\theta}) =\) Var(\(\hat{\theta}) +\) [Bias(\(\hat{\theta})]^2 \)

It follows from Proposition 3.1 that if \(\hat{\theta}\) is unbiased, then MSE\((\hat{\theta})\) = Var\((\hat{\theta})\). So, for unbiased estimators, one is more efficient than a second if and only if its MSE is smaller. But, in general, when comparing two estimators \(\hat{\theta}_1\) and \(\hat{\theta}_2\) of \(\theta\), we are faced with a trade-off between variability and bias.

**Example: **Let's explore this ** bias-variance trade-off** in the context of the binomial distribution, where the number of trials $n$ is known but the probability of "success" \(p\) is unknown. Let \(X\sim\text{binomial}(n,p)\). The sample proportion \(X/n\) (the proportion of "successes" in \(n\) observed trials) is an unbiased estimator of \(p\). Denote this estimator as \(\hat{p}_1\), then

E\([\hat{p}_1]\) = E\(\left[\displaystyle \frac{X}{n}\right] = \displaystyle \frac{np}{n} = p.\)

Furthermore, the mean square error of the sample proportion is

MSE[\(\hat{p}_1\)] = Var\((\hat{p}_1)\) = Var\(\left(\displaystyle \frac{X}{n}\right) = \displaystyle \frac{np(1-p)}{n^2} = \displaystyle \frac{p(1-p)}{n}\).

Consider the alternative estimator of \(p\) given by

\(\hat{p}_2 = \displaystyle \frac{X+1}{n+2}\),

which adds one artificial success and one failure to the real data.

_____________________________________________________

#### Pause for Reflection #5

- On a piece of paper, write out the details to derive the following:
E\([\hat{p}_2] = \displaystyle \frac{np + 1}{n+2}\) and Var\((\hat{p}_2) = \displaystyle \frac{np(1-p)}{(n+2)^2}\).

- Then, using Proposition 3.1, show that the mean square error for \(\hat{p}_2\) is given by
MSE\((\hat{p}_2) = \displaystyle \frac{np(1-p) + (1-2p)^2}{(n+2)^2}\).

Take a picture of your written work for steps 1 and 2 and upload it to your Lab3 folder to include in your lab notebook. Refer to the code provided in the lab notebook for Reflection #1.

_____________________________________________________

We can compare the two estimators \(\hat{p}_1\) and \(\hat{p}_2\) for \(p\) by comparing their mean squared errors. Note that we have the MSE for both estimators as a function of \(p\). Thus, we can graphically compare the MSE for \(\hat{p}_1\) and \(\hat{p}_2\) by plotting curves in R using the following code. Note that we use \(n=16\) just to have a specific example to work with.

n = 16 curve(x*(1-x)/n, from=0, to=1, xlab="p", ylab="MSE") curve((n*x*(1-x)+(1-2*x)^2)/(n+2)^2, add=TRUE, col="blue", lty=2)

The MSE for \(\hat{p}_1\) is in solid black, and the MSE for \(\hat{p}_2\) is the dashed blue curve.

_____________________________________________________

#### Pause for Reflection #6

Inspect the graphs of the MSE curves and answer the following:

- For approximately what values of \(p\) does \(\hat{p}_2\) have smaller MSE than \(\hat{p}_1\)?
- For the values identified in step 1, even though \(\hat{p}_2\) is biased, it has a smaller MSE than \(\hat{p}_1\). Comment on why \(\hat{p}_2\) may be preferred over \(\hat{p}_1\) as an estimator of \(p\) for these values.
- Now alter the code above to recreate the MSE graphs for the following sample sizes: \(n=30, n=50, n=100, n=200\). What do you see is the effect of increasing the sample size?

_____________________________________________________

#### *Optional* Reflection #7

Prove Proposition 3.1.

_____________________________________________________