.png){kind=icon}
.png){kind=icon}
Return
Adaptive orthogonal gradient descent algorithm for fully complex-valued neural networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2023.126358.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For optimization algorithms of fully complex-valued neural networks, complex-valued stepsize is helpful to make the training escape from saddle points. In this paper, an adaptive orthogonal gradient descent algorithm with complex-valued stepsize is proposed for the efficient training of fully complex-valued neural networks. The basic idea is that, at each iteration, the search direction is constructed as a combi-nation of two orthogonal gradient directions by using the algebraic representation of complex-valued stepsize. It is then shown that the determination of suitable complex-valued stepsize is facilitated by a decoupling method such that the computational complexity involved in the training process is greatly reduced. The experiments are finally conducted on pattern classification, nonlinear channel equalization and signal prediction to confirm the advantages of the proposed algorithm.CO 2023 Elsevier B.V. All rights reserved.
Keywords:
Fully complex -valued neural networks
Adaptive complex -valued stepsize
Orthogonal directions
Decoupling design
Gradient descent