Introduction
Recruitment learning is prone to instability when a chain of concepts is recruited in cascade as seen in Figure 8.1. The statistical variance inherent in the recruitment method causes increasing perturbations to the recruited set size, and thus instability (Valiant, 1994). We previously proposed a boost-and-limit algorithm to improve recruitment stability, and verified the applicability of this method with a software model in a spiking neuroidal net simulator (Günay and Maida, 2001, 2006b), which was overviewed in Chapter 7. In that model, excess recruitment candidates were rejected to enforce a stable recruitment level. This chapter describes the improvements of the previous boost-and-limit method to use a more biologically realistic neural mechanism (Günay and Maida, 2006a).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Diederich, J., Günay, C., Hogan, J.M. (2010). The Stability of Recruited Concepts. In: Recruitment Learning. Studies in Computational Intelligence, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14028-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14028-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14027-3
Online ISBN: 978-3-642-14028-0
eBook Packages: EngineeringEngineering (R0)