
Week 0 · A tour of the course
\[ % Number sets \newcommand{\Nat}{\mathbb{N}} \newcommand{\Integer}{\mathbb{Z}} \newcommand{\Real}{\mathbb{R}} \newcommand{\Complex}{\mathbb{C}} % Operators \newcommand{\SNR}{\operatorname{SNR}} \newcommand{\tr}{\operatorname{tr}} \newcommand{\re}{\operatorname{Re}} \newcommand{\im}{\operatorname{Im}} \newcommand{\sign}{\operatorname{sign}} \newcommand{\rect}{\operatorname{rect}} \newcommand{\sinc}{\operatorname{si}} \newcommand{\erf}{\operatorname{erf}} \newcommand{\erfc}{\operatorname{erfc}} \newcommand{\kurt}{\operatorname{kurt}} \newcommand{\diag}{\operatorname{diag}} \newcommand{\MSE}{\operatorname{MSE}} \newcommand{\argmin}{\operatorname*{argmin}} \newcommand{\argmax}{\operatorname*{argmax}} \newcommand{\bias}{\operatorname{bias}} \newcommand{\Bin}{\operatorname{Bin}} % Delimiters \newcommand{\paren}[1]{\left(#1\right)} \newcommand{\bracket}[1]{\left[#1\right]} \newcommand{\set}[1]{\left\{#1\right\}} \newcommand{\abs}[1]{\left\lvert #1 \right\rvert} \newcommand{\norm}[1]{\left\lVert #1 \right\rVert} \newcommand{\ip}[1]{\left\langle #1 \right\rangle} % Notation \newcommand{\dd}{\,\mathrm{d}} \newcommand{\tran}{^{\top}} \newcommand{\conv}{\ast} \newcommand{\conj}{^{*}} \newcommand{\herm}{^{\mathsf{H}}} \newcommand{\opt}{^{\star}} % Expectation and variance % \newcommand{\E}[1]{\mathbb{E}\!\left[#1\right]} \newcommand{\E}[2][]{\mathbb{E}_{#1}\!\left[#2\right]} \newcommand{\Var}[1]{\mathbb{V}\!\left[#1\right]} % Distributions \newcommand{\Gauss}{\mathcal{N}} \newcommand{\Uniform}{\mathcal{U}} \newcommand{\FT}{\mathcal{F}} % Probability \newcommand{\Prob}[1]{\mathbb{P}\!\left(#1\right)} % Misc \newcommand{\bsy}[1]{\boldsymbol{#1}} \newcommand{\calR}{\mathcal{R}} \newcommand{\calC}{\mathcal{C}} \]
For each photo: corgi or bread, and how sure are you? Say a number between 0 and 100 %.






The question of this course How can we know something that we never observe directly? Write down what you expect, what the data say, how to combine them, and how sure you are allowed to be.
Before you reached this room, it had already:
Estimation None of these measures what it wants. Each computes an estimate from data that is mostly something else: how is it made, and how good can it possibly be?

A GPS fix, a microphone signal, an MRI slice, a radar echo: each is the thing we want plus something we do not.
We never get the truth, so we ask for the estimate that is wrong by as little as possible, on average. This course makes that precise, and then solves for it.
Every face is the mean plus a weighted sum of a few eigenfaces, the directions of the data’s covariance matrix. Eight numbers already say whose face it is. (Week 4)

The right half of a face estimated from the left half, with its own error bar per pixel, computed before seeing any face. (Week 5)


The score is the correlation with the template, in units of its standard deviation under noise alone. Radar, sonar, a wake word, a face in a crowd: correlate with what you expect, compare with a threshold. The matched filter is the best linear detector there is. (Week 6)


A microphone array in a video call, a radio telescope, a 5G base station: steer toward one source and null the others. (Week 6)

Deblurring is an inverse problem, and naive inversion amplifies the noise without bound. The optimal filter knows which frequencies to trust. (Week 8)


Navigation, a self-driving car, the Apollo guidance computer: predict, measure, correct, repeat. The Kalman filter is how. (Week 9)

loudspeaker microphone after cancellation

Every phone call on speaker runs an adaptive filter that learns the room while you talk, and keeps learning when you move. (Week 9)

Every one of those systems finds the estimate closest to the truth, among the ones you can build from the data.
“Closest” turns out to be a right angle: the error is orthogonal to everything you observed.
Seven applications, one projection, computed in different spaces.

The course climbs one object at a time: a single random variable, then a random vector, then a random process, a vector indexed by time.
At every level the same questions return: characterize the uncertainty, estimate what cannot be seen, generate data from a model, apply it to a real signal.
A technique one level up is the same idea in the notation of a larger object.
| Week | Leaves behind | |
|---|---|---|
| 1 | Why Noise Is Gaussian | Sums of many small effects are Gaussian, so two moments suffice |
| 2 | Learning a Constant from Data | An estimator is a random variable, with a floor no estimator beats |
| 3 | What an Observation Is Worth | The posterior does the work; the conditional mean is the best estimate |
| 4 | The Shape of a Random Vector | The covariance matrix is a geometry |
| 5 | Estimation Is Projection | The best linear estimate is a right angle |
| 6 | One Formula, Four Instruments | Matched filter, beamformer, regularized inverse, fusion |
| 7 | When the Index Is Time | Stationarity, the spectrum, white noise through a filter |
| 8 | The Wiener Filter | The normal equations become a convolution |
| 9 | Estimation That Keeps Up | Predict, then fuse, recursed: Kalman and adaptive filters |
Bring
Each is revisited where it is needed.
Material
Take away
One idea, estimation is projection, and the confidence to recognize it the next time a problem hands you noisy data.