Optimization in Quaternion Dynamic Systems: Gradient, Hessian, and Learning Algorithms

Dongpo Xu

doi:10.1109/TNNLS.2015.2440473

2016-02-01

Dongpo Xu *

Yili Xia *

Danilo P. Mandic *

DOI：10.1109/TNNLS.2015.2440473

原文链接

查看原文

摘要

En 中文

The optimization of real scalar functions of quaternion variables, such as the mean square error or array output power, underpins many practical applications. Solutions typically require the calculation of the gradient and Hessian. However, real functions of quaternion variables are essentially nonanalytic, which are prohibitive to the development of quaternion-valued learning systems. To address this issue, we propose new definitions of quaternion gradient and Hessian, based on the novel generalized Hamilton-real (GHR) calculus, thus making a possible efficient derivation of general optimization algorithms directly in the quaternion field, rather than using the isomorphism with the real domain, as is current practice. In addition, unlike the existing quaternion gradients, the GHR calculus allows for the product and chain rule, and for a one-to-one correspondence of the novel quaternion gradient and Hessian with their real counterparts. Properties of the quaternion gradient and Hessian relevant to numerical applications are also introduced, opening a new avenue of research in quaternion optimization and greatly simplified the derivations of learning algorithms. The proposed GHR calculus is shown to yield the same generic algorithm forms as the corresponding real-and complex-valued algorithms. Advantages of the proposed framework are illuminated over illustrative simulations in quaternion signal processing and neural networks.

Keyword:

Backpropagation

generalized Hamiltonreal (GHR) calculus

nonlinear adaptive filtering

quaternion gradient

quaternion least mean square (QLMS)

quaternion optimization

real-time recurrent learning