Global convergence of feedforward networks of learning automata

Author

Phansalkar, V.V. ; Thathachar, M. A L

Author_Institution

Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India

Volume

3

fYear

1992

fDate

7-11 Jun 1992

Firstpage

875

Abstract

A feedforward network composed of units of teams of parameterized learning automata is considered as a model of a reinforcement learning system. The parameters of each learning automaton are updated using an algorithm consisting of a gradient following term and a random perturbation term. The algorithm is approximated by the Langevin equation. It is shown that it converges to the global maximum. The algorithm is decentralized and the units do not have any information exchange during updating. Simulation results on a pattern recognition problem show that reasonable rates of convergence can be obtained

Keywords

automata theory; feedforward neural nets; learning (artificial intelligence); pattern recognition; Langevin equation; feedforward networks; global convergence; learning automata; pattern recognition; random perturbation term; reinforcement learning; simulation results; Convergence; Equations; Labeling; Learning automata; Learning systems; Pattern recognition; Probability; Programmable logic arrays; Telephony; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Neural Networks, 1992. IJCNN., International Joint Conference on

Conference_Location

Baltimore, MD

Print_ISBN

0-7803-0559-0

Type

conf

DOI

10.1109/IJCNN.1992.227089

Filename

227089