Time Varying Learning Algorithms

S. Lakshmivarahan
Additional contact information
S. Lakshmivarahan: University of Oklahoma, School of Electrical Engineering and Computer Science

Chapter Chapter 4 in Learning Algorithms Theory and Applications, 1981, pp 109-135 from Springer

Abstract: Abstract In this chapter we analyze the time varying analogues of the Ergodic learning algorithms presented in Chapter 2. These algorithms are obtained from algorithm (2.1) by letting the step length parameter θ to vary with time. The time-varying algorithms generate non-stationary Markov processes over the simplex SM. Our aim is to present different methods of asymptotic analysis of these time varying learning algorithms. In the interest of brevity we will only consider the case of M = 2, leaving the obvious extensions as exercises.

Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-5975-6_4

Ordering information: This item can be ordered from
http://www.springer.com/9781461259756

DOI: 10.1007/978-1-4612-5975-6_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().