She draws another curve. Not the data, but the estimator . A sampling distribution. We learn that our single lonely estimate is just one random draw from a Gaussian cloud of possibilities. We learn about (the width of our ignorance) and consistency (the promise that if we collect infinite data, we will finally drag μ out of its cave).
Pure math is useless without computation. A modern lecture translates the theorem into a small code block (R or Python) or a manual calculation to show that the abstract math produces concrete numbers.
:
is the random error term, assumed to be normally distributed with a mean of zero. Ordinary Least Squares (OLS)
Characterized by a Probability Mass Function (PMF), . Examples include the Binomial and Poisson distributions. mathematical statistics lecture
“You are learning the grammar of rational belief. The universe is noisy. Your job is to listen for the signal.”
Open YouTube, search for "MIT 18.650 Lecture 1," grab a notebook, and start your journey. She draws another curve
The professor applies the theorem to a specific distribution.
A fundamental challenge in statistics is data reduction. We must compress a large dataset into a smaller set of values without losing information about the parameter . This compressed value is called a statistic, The Fisher-Neyman Factorization Theorem A statistic is sufficient for We learn that our single lonely estimate is
The Method of Moments equates sample moments to theoretical population moments. Calculate the -th population moment: Calculate the -th sample moment: for enough values of to solve for the unknown parameters. Maximum Likelihood Estimation (MLE)