Stabilizing competitive learning during on-line training with an anti-Hebbian weight modulation

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

Abstract

Competitive learning algorithms are statistically driven schemes requiring that the training samples are both representative and randomly ordered. Within the frame of self-organization, the latter condition appears as a paradoxical unrealistic assumption about the temporal structure of the environment. In this paper, the resulting vulnerability to continuously changing inputs is illustrated in the case of a simple space discretization task. A biologically motivated local anti-Hebbian modulation of the Hebbian weights is introduced, and successfully used to stabilize this network under real-time-like conditions.

Cite

CITATION STYLE

APA

Tavitian, S., Fomin, T., & Lörincz, A. (1996). Stabilizing competitive learning during on-line training with an anti-Hebbian weight modulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1112 LNCS, pp. 697–702). Springer Verlag. https://doi.org/10.1007/3-540-61510-5_118

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