Search

For multilayer perceptron (MLP), the initial weights will significantly influence its performance. Based on the enhanced fractional derivative extend from convex optimization, this paper proposes a fractional gradient descent (RFGD) algorithm robust to the initial weights of MLP. We analyze the effectiveness of the RFGD algorithm. The convergence of the RFGD algorithm is also analyzed. The computational complexity of the RFGD algorithm is generally larger than that of the gradient descent (GD) algorithm but smaller than that of the Adam, Padam, AdaBelief, and AdaDiff algorithms. Numerical experiments show that the RFGD algorithm has strong robustness to the order of fractional calculus which is the only added parameter compared to the GD algorithm. More importantly, compared to the GD, Adam, Padam, AdaBelief, and AdaDiff algorithms, the experimental results show that the RFGD algorithm has the best robust performance for the initial weights of MLP. Meanwhile, the correctness of the theoretical analysis is verified. [ABSTRACT FROM AUTHOR]

It is valuable and meaningful to suppress impulsive noise in system identification. Existing algorithms usually only consider impulsive noise with small frequency and amplitude. Furthermore, few researchers pay attention to the tracking performance of these algorithms. This paper builds a framework based on the deep deterministic policy gradient (DDPG) algorithm with the ability to explore and correct. The enhanced fractional derivative is introduced to further improve the performance of this reinforcement learning-based framework. Thus a fractional least mean square filter algorithm based on reinforcement learning (FrlMS) is proposed. The stability of the FrlMS algorithm is analyzed. Compared with the competing algorithms, the simulation experiments in system identification show that the FrlMS algorithm has satisfactory tracking performance in the face of impulsive noise, especially when the frequency and (or) amplitude are (is) large. [ABSTRACT FROM AUTHOR]

This brief proposes an enhanced fractional derivative that can prevent the tap weight coefficients from destroying the gradient information, solve the problem caused by the fractional extreme point, and improve the convergence speed with the help of error estimation information and Sign function. Based on this fractional derivative, an enhanced fractional least mean square (EFLMS) filter algorithm is proposed. We analyze the influence of unknown system vector on the convergence performance of the EFLMS algorithm. The computational complexity of the proposed algorithm is also analyzed. Simulation experiments show that the EFLMS algorithm achieves better performance in system identification than the classic least mean square (LMS) algorithm and the existing algorithms based on fractional calculus. [ABSTRACT FROM AUTHOR]

Find the global optimal solution of the model is one promising research topic in computational intelligent community. Dependent on analogies to natural processes, the evolutionary swarm intelligent algorithms are widely used for solving global optimization problems which directed by the fitness values. In this paper, we propose one efficient fractional global learning machine (Fragmachine) which includes two stages (descending and ascending) to determine the optimal search path. The neural network model is used to approach the given fitness value. Specifically, for the descending stage, the integer gradient of the network output with respect the current location is employed to find the next descending point, while for the ascending stage, the fractional gradient is implemented to climb and escape from the local optimal point. We further propose one adaptive learning rate during training which relies on both the current gradient (integer or fractional) information and the fitness value. Finally, a series of numerical experiments verify the effectiveness of the proposed algorithm, Fragmachine. [ABSTRACT FROM AUTHOR]