On the last page of the paper Roweis discusses the Marquardt improvement to Levenberg's algorithm. The goal of the improvement is that "we should move further in the directions in which the gradient is smaller in order to get around the classic 'error valley' problem." I understand the goal, but I am not completely clear on how introducing diag(H) achieves it(?).