For a Gaussian , the set of points at a fixed probability density is
an ellipse in 2D and an ellipsoid in 3D. Diagonalise and the picture becomes concrete: the eigenvectors are the axis directions, and the semi-axis lengths are scaled by however many sigmas you chose to draw.
So and — the diagonal entries' square roots — are the bounding box of the ellipse, not the ellipse. A strongly correlated estimate has a long thin ellipse tilted away from the axes, and reporting only the diagonal describes a large box containing a thin sliver. That is a very different claim.
Two operations on Gaussians look similar and behave oppositely, and confusing them is common:
- Marginalisation — integrating a variable out. In covariance form: delete the rows and columns. Cheap. In information form: a Schur complement, which creates fill-in.
- Conditioning — fixing a variable to an observed value. In information form: delete rows and columns. Cheap. In covariance form: an expensive update.
Each form makes one operation trivial and the other awkward. Which representation a system uses is therefore a statement about which operation it performs most.
A 2D position estimate has m and correlation . Sketch the ellipse.
Show answer
A very long, very thin ellipse along the diagonal. The eigenvalues are and , so the semi-axes are and — a fourteen-to-one ratio. The estimate knows the difference to cm and the sum to m. Reporting "1 m in each axis" describes a square that is almost entirely empty.