Convergence analysis of the Quickprop method
نویسندگان
چکیده
A mathematical framework for the convergence analysis of the well known Quickprop method is described. The convergence of this method is analyzed. Furthermore, we present modi cations of the algorithm that exhibit improved convergence speed and stability and at the same time, alleviate the use of heuristic learning parameters. Simulations are conducted to compare and evaluate the performance of a proposed modi ed Quickprop algorithms with various popular training algorithms. The results of the experiments indicate that the increased convergence rates, achieved by the proposed algorithm, a ect by no means its generalization capability and stability.
منابع مشابه
Performance Analysis of the Improved Cascade Correlation Neural Network for Time Series Analysis
The cascade correlation neural network structure is used to predict the daily closing price of the particular share item in the stock market. The primary task of any neural network architecture is to reduce the error between the actual outcome of the data and expected value obtained through the network architecture. In conventional cascade correlation neural network (CCNN), modifications of wei...
متن کاملNeither Quick Nor Proper - Evaluation of QuickProp for Learning Deep Neural Networks
Neural networks and especially convolutional neural networks are of great interest in current computer vision research. However, many techniques, extensions, and modifications have been published in the past, which are not yet used by current approaches. In this paper, we study the application of a method called QuickProp for training of deep neural networks. In particular, we apply QuickProp d...
متن کاملNeural Network Architectures and Learning
Abstract Various leaning method of neural networks including supervised and unsupervised methods are presented and illustrated with examples. General learning rule as a function of the incoming signals is discussed. Other learning rules such as Hebbian learning, perceptron learning, LMS Least Mean Square learning, delta learning, WTA – Winner Take All learning, and PCA Principal Component Analy...
متن کاملA practical comparison between Quickprop and back-propagation
A number of studies have questioned the validity of the Quickprop algorithm and the activation function derivative offset as appropriate methods of speeding backpropagation style training. This paper follows on from those results with a practical study using generated data sets. The generation method is briefly presented, along with the results of comparisons which indicate, at least on these d...
متن کاملA Comparative Study of Quickprop and Gpd Optimization Algorithms for Mcelr Adaptation of Cdhmm Parameters
In our previous work, we have presented an approach of minimum classification error linear regression (MCELR) for adaptation of Gaussian mixture continuous density HMM (CDHMM) parameters. It is shown that a stochastic approximation approach known as the GPD (generalized probabilistic descent) can be used to optimize the MCE objective function. However, it is relatively difficult to set an appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999