Learning Automaton Computing of Function Optimization Problems
Takashi KUSUNOKI, Shigeya Ikebou, Jijun Wu, Yue ZHAO, Fei Qian · Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications · 2000
Learning Automaton (LA) is a representative model with the properties of outstanding learning ability, autonomy and theoretically guaranteed convergence in learning process[1]. But for function optimization problems, the problematic point is with the increase of solution space, the output number of stochastic automaton also increases, therefore convergence is possibly very time-consuming.