Advertisement

The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm

  • Armand M. Makowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5217)

Abstract

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.

Keywords

Convergence 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M.: The self-organizing exploratory pattern of the Argentine ant. Journal of Insect Behavior 3, 159–168 (1990)CrossRefGoogle Scholar
  2. 2.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems, Santa Fe Institute Studies in the Sciences of Complexity. Oxford University Press, Oxford (1999)zbMATHGoogle Scholar
  3. 3.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)zbMATHGoogle Scholar
  4. 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
  5. 5.
    Kushner, H.J., Yin, G.: Stochastic Approximation Algorithms and Applications. Springer, New York (1997)zbMATHGoogle Scholar
  6. 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
  7. 7.
    Gladyshev, E.G.: On stochastic approximation. Theory of Probabilities and Applications 10, 275–278 (1965)CrossRefGoogle Scholar
  8. 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
  9. 9.
    Pemantle, R.: A survey of random processes with reinforcement. Probability Surveys 4, 1–70 (2007)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Chung, K.L.: A Course in Probability Theory, 2nd edn. Academic Press, New York (1974)zbMATHGoogle Scholar
  11. 11.
    Hall, P., Heyde, C.C.: Martingale Limit Theory and Its Applications, Probability and Mathematical Statistics. Academic Press, New York (1980)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Armand M. Makowski
    • 1
  1. 1.Department of Electrical and Computer Engineering and Institute for Systems ResearchUniversity of MarylandCollege Park, MDUSA

Personalised recommendations