Convergence analysis of a novel high order networks model based on entropy error function

Abstract

It is generally known that the error function is one of the key factors that determine the convergence, stability and generalization ability of neural networks. For most feedforward neural networks, the squared error function is usually chosen as the error function to train the network. However, networks based on the squared error function can lead to slow convergence and easily fall into local optimum in the actual training process. Recent studies have found that, compared to the squared error function, the gradient method based on the entropy error function measures the difference between the probability distribution of the model output and the probability distribution of the true labels during the iterative process, which can be more able to handle the uncertainty in the classification problem, less likely to fall into a local optimum and can learn to converge more rapidly. In this paper, we propose a batch gradient method for Sigma-Pi-Sigma neural networks based on the entropy error function and rigorously demonstrate the weak and strong convergence of the new algorithm in the batch input mode. Finally, the theoretical results and effectiveness of the algorithm are verified by simulation.