Monotonicity and convergence of asynchronous update gradient method for ridge polynomial neural network

Authors:
Xin Yu;Lixia Tang;Qingfeng Chen;Chenhua Xu
Affiliations:
-;-;-;-
Venue:
Neurocomputing
Year:
2014

Citing 11
Cited 0

Parallel distributed processing: explorations in the microstructure of cognition, vol. 2: psychological and biological models

Parallel distributed processing: explorations in the microstructure of cognition, vol. 2: psychological and biological models
Product units: a computationally powerful and biologically plausible extension to backpropagation networks

Neural Computation
A Sigma-Pi-Sigma Neural Network (SPSNN)

Neural Processing Letters
Convergence of an online gradient method for feedforward neural networks with stochastic inputs

Journal of Computational and Applied Mathematics - Special issue on proceedings of the international symposium on computational mathematics and applications
Convergence of BP algorithm for product unit neural networks with exponential weights

Neurocomputing
Non-stationary and stationary prediction of financial time series using dynamic ridge polynomial neural network

Neurocomputing
Boundedness and Convergence of Online Gradient Method with Penalty for Linear Output Feedforward Neural Networks

Neural Processing Letters
Convergence analysis of online gradient method for BP neural networks

Neural Networks
Dynamic Ridge Polynomial Neural Network: Forecasting the univariate non-stationary and stationary trading signals

Expert Systems with Applications: An International Journal
Deterministic convergence of an online gradient method for BP neural networks

IEEE Transactions on Neural Networks
Ridge polynomial networks

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

The ridge polynomial neural network is a special type of higher-order neural networks. It not only provides a more efficient and regular architecture compared to ordinary higher-order feedforward networks, but also maintains the fast learning property and powerful nonlinear mapping capability while avoiding the combinatorial increase in the number of required weights. In this paper, a monotonicity theorem and two convergence theorems of the asynchronous gradient method for training the ridge polynomial neural network are proved. They are important to choosing appropriate learning rate and initial weights to perform effective training. To illustrate the theoretical finding, numerical experiments are carried out for 4-dimensional parity problem and function approximation problem. It is shown that the experimental results are in agreement with the proposed theorems.