Finite time analysis of the pursuit algorithm for learning automata

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 26, Issue 4, 1996, Pages 590-598

  Rajaraman, K ^a   Sastry, P S ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; DECISION MAKING; DECISION THEORY; LEARNING ALGORITHMS; LEARNING SYSTEMS;

FINITE TIME ANALYSIS; LEARNING AUTOMATA; PROBABLY APPROXIMATELY CORRECT LEARNING; PURSUIT ALGORITHM;

FINITE AUTOMATA;

EID: 0030212543     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.517033     Document Type: Article

References (16)

1. M. L. Tsetlin, Automata Theory and Modeling of Biological Systems. New York: Academic, 1973.
2. K. S. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction. Englewood Cliffs, NJ: Prentice Hall, 1989.
3. K. S. Narendra, E. Wright, and L. G. Mason, "Applications of learning automata to telephone traffic routing," IEEE Trans. Syst., Man, Cybern., vol. 7, pp. 785-792, 1977.
4. M. A. L. Thathachar and P. S. Sastry, "Learning optimal discriminant functions through a cooperative game of automata," IEEE Trans. Syst., Man, Cybern., vol. 17, no. 1, pp. 73-85, 1987.
5. _, "Relaxation labeling with learning automata," IEEE Trans. Pattern Anal. Machine Intell., vol. 8, pp. 256-268, Mar. 1986.
6. P. S. Sastry and K. Rajaraman, and S. R. Ranjan, "Learning optimal conjunctive concepts through a team of stochastic automata," to appear in IEEE Trans. Syst., Man, Cybern..
7. P. S. Sastry, Systems of Learning Automata - Estimator Algorithms and Applications, Dept. of Electrical Engineering, Indian Institute of Science, Bangalore, June 1985.
8. L. G. Valiant, "A theory of the learnable," Comm. ACM, vol. 27, pp. 1134-1142, 1984.
9. A. Blumer, A. Ehrenfeucht, D. Haussler, and H. Warmuth, "Learnability and Vapnik-Chervonenkis dimension," J. ACM, vol. 36, no. 3, pp. 939-965, 1989.
10. S. R. Kulkarni, Problems of Computational and Information Complexity in Machine Vision and Learning, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, 1992.
11. D. Haussler, "Quantifying inductive bias: AI Learning algorithms and Valiant's learning framework," Artif. Intell., vol. 36, pp. 177-221, 1988.
12. B. J. Oommen and J. K. Lanctot, "Discretized pursuit learning automata," IEEE Trans. Syst., Man, Cybern., vol. 20, pp. 931-938, 1990.
13. M. A. L. Thathachar and P. S. Sastry, "A class of rapidly converging algorithms for learning automata," IEEE Trans. Syst., Man, Cybern., vol. 15, pp. 168-175, 1985.
14. J. K. Lanctot and B. J. Oommen, "Discretized estimator learning automata," IEEE Trans. Syst., Man, Cybern., vol. 22, no. 6, pp. 1473-1483, 1992.
15. W. Hoeffding, "Probability inequalities for sums of bounded random variables," J. Amer. Stat. Assoc., vol. 58, pp. 13-30, 1963.
16. M. A. L. Thathachar and B. J. Oommen, "Discretized reward-inaction learning automata," J. Cybern. Inform. Sci., pp. 24-29, 1979.