Performance of the Bayesian online algorithm for the perceptron

5Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this letter, we derive continuum equations for the generalization error of the Bayesian online algorithm (BOnA) for the one-layer perceptron with a spherical covariance matrix using the Rosenblatt potential and show, by numerical calculations, that the asymptotic performance of the algorithm is the same as the one for the optimal algorithm found by means of variational methods with the added advantage that the BOnA does not use any inaccessible information during learning. © 2007 IEEE.

Cite

CITATION STYLE

APA

de Oliveira, E. A., & Alamino, R. C. (2007). Performance of the Bayesian online algorithm for the perceptron. IEEE Transactions on Neural Networks, 18(3), 902–905. https://doi.org/10.1109/TNN.2007.891189

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free