(1B.18)
We can rewrite the performance surface in terms of its minimum value and w* as
Figure 1-16 Contour plots of the performance surface with two weights
The eigenvectors and eigenvalues of the input autocorrelation matrix are all
that matters to understand convergence of the gradient descent in multiple
dimensions. The eigenvectors represent the natural (orthogonal) coordinate system to
study the properties of R. In fact, along these coordinates the convergence of the algorithm can be
studied as a joint adaptation of several (one for each dimension of the space)
unidimensional algorithms. Along each eigenvector direction (the axes of the
ellipsoids) the algorithm behaves just like the one-variable case that we studied in
the beginning of this chapter. The eigenvalue becomes the projection of the
data onto that direction, just as Use your browser's back button to return to text.