Constant Stepsize Algorithms
Publisher
Hindustan Book Agency
Reference22 articles.
1. Benveniste, A., & Ruget, G. (1982). A measure of the tracking capability of recursive stochastic algorithms with constant gains. IEEE Transactions on Automatic Control, 27(3), 639–649.
2. Billingsley, P. (1968). Convergence of probability measures. New York: John Wiley and Sons.
3. Borkar, V. S. (1995). Probability theory: An advanced course. New York: Springer Verlag.
4. Borkar, V. S., & Meyn, S. P. (2000). The O.D.E. method for convergence of stochastic approximation and reinforcement learning. SIAM Journal on Control and Optimization, 38(2), 447–469.
5. Bucklew, J. A., & Kurtz, T. G. (1993). Weak convergence and local stability properties of fixed step size recursive algorithms. IEEE Transactions on Information Theory, 39(3), 966–978.