Orthogonality principle explained

In statistics and signal processing, the orthogonality principle is a necessary and sufficient condition for the optimality of a Bayesian estimator. Loosely stated, the orthogonality principle says that the error vector of the optimal estimator (in a mean square error sense) is orthogonal to any possible estimator. The orthogonality principle is most commonly stated for linear estimators, but more general formulations are possible. Since the principle is a necessary and sufficient condition for optimality, it can be used to find the minimum mean square error estimator.

Orthogonality principle for linear estimators

The orthogonality principle is most commonly used in the setting of linear estimation.^[1] In this context, let x be an unknown random vector which is to be estimated based on the observation vector y. One wishes to construct a linear estimator

\hat{x} = Hy + c for some matrix H and vector c. Then, the orthogonality principle states that an estimator \hat{x} achieves minimum mean square error if and only if\operatorname{E} \{ (\hat{x} - x ) y ^{T} \} = 0 , and\operatorname{E} \{ \hat{x} - x \} = 0 . If x and y have zero mean, then it suffices to require the first condition.

Example

Suppose x is a Gaussian random variable with mean m and variance

\sigma ^{2 .} _{x} Also suppose we observe a value y = x + w, where w is Gaussian noise which is independent of x and has mean 0 and variance \sigma ^{2 .} _{w} We wish to find a linear estimator \hat{x} = hy + c minimizing the MSE. Substituting the expression \hat{x} = hy + c into the two requirements of the orthogonality principle, we obtain0 = \operatorname{E} \{ (\hat{x} - x ) y \} 0 = \operatorname{E} \{ (hx + hw + c - x)(x + w) \} 0 = h (\sigma ^{2 )} _{w} + hm ^{2} + cm - \sigma ^{2} _{x} - m ^{2} and0 = \operatorname{E} \{ \hat{x} - x \} 0 = \operatorname{E} \{ hx + hw + c - x \} 0 = (h -1 )m + c . Solving these two linear equations for h and c results inh = (\sigma ^{2} _{x})/(\sigma ^{2} _{x} + \sigma ^{2} _{w}) , c = (\sigma ^{2} _{w})/(\sigma ^{2} _{w}) m , so that the linear minimum mean square error estimator is given by\hat{x} = (\sigma ^{2} _{x})/(\sigma ^{2} _{x} + \sigma ^{2} _{w}) y + (\sigma ^{2} _{w})/(\sigma ^{2} _{x} + \sigma ^{2} _{w}) m.

This estimator can be interpreted as a weighted average between the noisy measurements y and the prior expected value m. If the noise variance

\sigma ^{2} _{w} is low compared with the variance of the prior \sigma ^{2} _{x} (corresponding to a high SNR), then most of the weight is given to the measurements y, which are deemed more reliable than the prior information. Conversely, if the noise variance is relatively higher, then the estimate will be close to m, as the measurements are not reliable enough to outweigh the prior information.

Finally, note that because the variables x and y are jointly Gaussian, the minimum MSE estimator is linear.^[2] Therefore, in this case, the estimator above minimizes the MSE among all estimators, not only linear estimators.

General formulation

Let

V be a Hilbert space of random variables with an inner product defined by \langle x,y \rangle = \operatorname{E} \{ x ^{H} y \} . Suppose W is a closed subspace of V , representing the space of all possible estimators. One wishes to find a vector \hat{x} \in W which will approximate a vector x \in V . More accurately, one would like to minimize the mean squared error (MSE) \operatorname{E} \| x - \hat{x} \| ^{2} between \hat{x} and x .

In the special case of linear estimators described above, the space

V is the set of all functions of x and y , while W is the set of linear estimators, i.e., linear functions of y only. Other settings which can be formulated in this way include the subspace of causal linear filters and the subspace of all (possibly nonlinear) estimators.

Geometrically, we can see this problem by the following simple case where

W is a one-dimensional subspace:

We want to find the closest approximation to the vector

x by a vector \hat{x} in the space W . From the geometric interpretation, it is intuitive that the best approximation, or smallest error, occurs when the error vector, e , is orthogonal to vectors in the space W .

More accurately, the general orthogonality principle states the following: Given a closed subspace

W of estimators within a Hilbert space V and an element x in V , an element \hat{x} \in W achieves minimum MSE among all elements in W if and only if \operatorname{E} \{ (x - \hat{x}) y ^{T} \} = 0 for all y \in W.

Stated in such a manner, this principle is simply a statement of the Hilbert projection theorem. Nevertheless, the extensive use of this result in signal processing has resulted in the name "orthogonality principle."

A solution to error minimization problems

The following is one way to find the minimum mean square error estimator by using the orthogonality principle.

We want to be able to approximate a vector

x by x = \hat{x} + e

where

\hat{x} = \sum _{i} c _{i} p _{i}

is the approximation of

x as a linear combination of vectors in the subspace W spanned by p _{1} ,p _{2} ,\ldots. Therefore, we want to be able to solve for the coefficients, c _{i} , so that we may write our approximation in known terms.

By the orthogonality theorem, the square norm of the error vector,

\left\Vert e\right\Vert ^{2} , is minimized when, for all j,\left\langle x - \sum _{i} c _{i} p _{i} ,p _{j} \right\rangle =0 .

Developing this equation, we obtain

\left\langle x,p _{j} \right\rangle = \left\langle \sum _{i} c _{i} p _{i} ,p _{j} \right\rangle = \sum _{i} c _{i} \left\langle p _{i} ,p _{j} \right\rangle.

If there is a finite number

n of vectors p _{i} , one can write this equation in matrix form as\begin{bmatrix} \left\langle x,p _{1} \right\rangle \\ \left\langle x,p _{2} \right\rangle \\ \vdots\\ \left\langle x,p _{n} \right\rangle \end{bmatrix} = \begin{bmatrix} \left\langle p _{1} ,p _{1} \right\rangle & \left\langle p _{2} ,p _{1} \right\rangle & … & \left\langle p _{n} ,p _{1} \right\rangle \\ \left\langle p _{1} ,p _{2} \right\rangle & \left\langle p _{2} ,p _{2} \right\rangle & … & \left\langle p _{n} ,p _{2} \right\rangle \\ \vdots & \vdots & \ddots & \vdots\\ \left\langle p _{1} ,p _{n} \right\rangle & \left\langle p _{2} ,p _{n} \right\rangle & … & \left\langle p _{n} ,p _{n} \right\rangle \end{bmatrix} \begin{bmatrix} c _{1} \\ c _{2} \\ \vdots\\ c _{n} \end{bmatrix}.

Assuming the

p _{i} are linearly independent, the Gramian matrix can be inverted to obtain\begin{bmatrix} c _{1} \\ c _{2} \\ \vdots\\ c _{n} \end{bmatrix} = \begin{bmatrix} \left\langle p _{1} ,p _{1} \right\rangle & \left\langle p _{2} ,p _{1} \right\rangle & … & \left\langle p _{n} ,p _{1} \right\rangle \\ \left\langle p _{1} ,p _{2} \right\rangle & \left\langle p _{2} ,p _{2} \right\rangle & … & \left\langle p _{n} ,p _{2} \right\rangle \\ \vdots & \vdots & \ddots & \vdots\\ \left\langle p _{1} ,p _{n} \right\rangle & \left\langle p _{2} ,p _{n} \right\rangle & … & \left\langle p _{n} ,p _{n} \right\rangle \end{bmatrix} ^{-1} \begin{bmatrix} \left\langle x,p _{1} \right\rangle \\ \left\langle x,p _{2} \right\rangle \\ \vdots\\ \left\langle x,p _{n} \right\rangle \end{bmatrix},

thus providing an expression for the coefficients

c _{i} of the minimum mean square error estimator.

See also

• Minimum mean square error
• Hilbert projection theorem

References

• Book: Kay , S. M. . Fundamentals of Statistical Signal Processing: Estimation Theory . 1993 . Prentice Hall . 0-13-042268-1 .
• Book: Moon, Todd K. . Mathematical Methods and Algorithms for Signal Processing . 2000 . Prentice-Hall . 0-201-36186-8.

Notes and References

1. Kay, p.386
2. See the article minimum mean square error.