Skip to main content

A New Continuous Action-Set Learning Automaton for Function Optimization

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2869))

Abstract

In this paper, we study an adaptive random search method based on learning automaton for solving stochastic optimization problems in which only the noise-corrupted value of objective function at any chosen point in the parameter space is available. We first introduce a new continuous action-set learning automaton (CALA) and theoretically study its convergence properties, which implies the convergence to the optimal action. Then we give an algorithm, which needs only one function evaluation in each stage, for optimizing an unknown function.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kushner, H.J., Yin, G.G.: Stochastic Approximation Algorithms and Applications. Applications of Mathematics. Springer, New York (1997)

    MATH  Google Scholar 

  2. Narendra, K.S., Thathachar, K.S.: Learning Automata: An Introduction. Printice-Hall, New York (1989)

    Google Scholar 

  3. Thathachar, M.A.L., Sastry, P.S.: Varieties of Learning Automata: An Overview. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 32, 711–722 (2002)

    Article  Google Scholar 

  4. Najim, K., Pozyak, A.S.: Multimodal Searching technique Based on Learning Automata with Continuous Input and Changing Number of Actions. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 26, 666–673 (1996)

    Article  Google Scholar 

  5. Gullapalli, V.: Reinforcement learning And Its Application on Control. PhD thesis, Deparqement of Computer and Information Sciences, University of Massachusetts, Amherst, MA, USA (February 1992)

    Google Scholar 

  6. Santharam, G., Sastry, P.S., Thathachar, M.A.L.: Continuous Action set Learning Automata for Stochastic Optimization. Journal of Franklin Institute 331B(5), 607–628 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Rajaraman, K., Sastry, P.S.: Stochastic Optimization Over Continuous and Discrete Variables with Applications to Concept Learning Under Noise. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans 29, 542–553 (1999)

    Article  Google Scholar 

  8. Frost, G.P.: Stochastic Optimization of Vehicle Suspension Control Systems Via Learning Auiomata. PhD thesis, Department of Aeronautical and Automotive Engineering, Loughborough University, Loughborough, Leicestershire, LE81 3TU, UI (October 1998)

    Google Scholar 

  9. Beigy, H., Meybodi, M.R.: A New Continuous Action-set Learning Automaton for Function Optimization, Tech. Rep. TR-CE-2003-002, Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beigy, H., Meybodi, M.R. (2003). A New Continuous Action-Set Learning Automaton for Function Optimization. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_119

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39737-3_119

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20409-1

  • Online ISBN: 978-3-540-39737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics