Ensemble Learning of Linear Perceptrons: On-Line Learning Theory
From MaRDI portal
Abstract: Within the framework of on-line learning, we study the generalization error of an ensemble learning machine learning from a linear teacher perceptron. The generalization error achieved by an ensemble of linear perceptrons having homogeneous or inhomogeneous initial weight vectors is precisely calculated at the thermodynamic limit of a large number of input elements and shows rich behavior. Our main findings are as follows. For learning with homogeneous initial weight vectors, the generalization error using an infinite number of linear student perceptrons is equal to only half that of a single linear perceptron, and converges with that of the infinite case with O(1/K) for a finite number of K linear perceptrons. For learning with inhomogeneous initial weight vectors, it is advantageous to use an approach of weighted averaging over the output of the linear perceptrons, and we show the conditions under which the optimal weights are constant during the learning process. The optimal weights depend on only correlation of the initial weight vectors.
Recommendations
- scientific article; zbMATH DE number 2226649
- On-line learning and generalization in coupled perceptrons
- Generalization in a linear perceptron in the presence of noise
- On-line learning in the committee machine
- Generalization performance of Bayes optimal classification algorithm for learning a perceptron
Cited in
(2)
This page was built for publication: Ensemble Learning of Linear Perceptrons: On-Line Learning Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3371810)
