Part of the Lecture Notes in Computer Science book series (LNCS, volume 5217)
The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm
We consider an ant-based algorithm for binary bridge selection, and analyze its convergence properties with the help of techniques from the theory of stochastic approximations.
KeywordsConvergence Property Accumulation Point Summability Condition Stochastic Approximation Stochastic Approximation Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 4.Pasteels, J.M., Deneubourg, J.L., Goss, S.: Self-organization mechanisms in ant societies (I): Trail recruitment to newly discovered food sources. Experientia Suppl. 54, 155–175 (1987)Google Scholar
- 6.Makowski, A.M.: The bridge selection problem and the convergence properties of a learning algorithm – Stochastic approximations to the rescue (in preparation, 2008)Google Scholar
- 8.Robbins, H., Siegmund, D.: A convergence theorem for non-negative almost supermartingales and some applications. In: Rustagi, J.S. (ed.) Optimizing Methods in Statistics, pp. 233–257. Academic Press, New York (1972)Google Scholar
- 11.Hall, P., Heyde, C.C.: Martingale Limit Theory and Its Applications, Probability and Mathematical Statistics. Academic Press, New York (1980)Google Scholar
© Springer-Verlag Berlin Heidelberg 2008