Convergence models for Rosenblatt´s perceptron learning algorithm

Presents a stochastic analysis of the steady-state and transient convergence properties of a single-layer perceptron for fast learning (large step-size, input-power product). The training data are modeled using a system identification formulation with zero-mean Gaussian inputs. The perceptron weights are adjusted by a learning algorithm equivalent to Rosenblatt´s perceptron convergence procedure. It is shown that the convergence points of the algorithm depend on the step size μ and the input signal power (variance) σ_x² , and that the algorithm is stable essentially for μ>0. Two coupled nonlinear recursions are derived that accurately model the transient behavior of the algorithm. The authors also examine how these convergence results are affected by noisy perceptron input vectors. Computer simulations are presented to verify the analytical models