DocumentCode :
353275
Title :
Online connectionist Q-learning produces unreliable performance with a synonym finding task
Author :
Johnson, Ian ; Plumbley, Mark
Author_Institution :
Dept. of Electron. Eng., King´´s Coll., London, UK
Volume :
3
fYear :
2000
fDate :
2000
Firstpage :
451
Abstract :
Neural networks (NNs) trained with reinforcement learning (RL) have the ability to produce complex, and robust behaviour which may be beneficial to language processing tasks. A method is proposed using RL to train NNs so that they might find synonyms that exist within a regular language. The learning algorithm and exploration strategy produces agents which yield consistently sub-optimal policies for expressions containing one operator, and unreliable performance over all expressions. This is surprising since previous work with lookup tables produced synonyms using a larger set of expressions for a wide range of learning rates and very little exploration
Keywords :
formal languages; learning (artificial intelligence); multi-agent systems; natural languages; neural nets; consistently sub-optimal policies; exploration strategy; language processing tasks; learning algorithm; online connectionist Q-learning; regular language; reinforcement learning; robust behaviour; synonym finding task; Arithmetic; Delay; Educational institutions; Humans; Neural networks; Robots; Robustness; Supervised learning; Table lookup; Training data;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2000. IJCNN 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on
Conference_Location :
Como
ISSN :
1098-7576
Print_ISBN :
0-7695-0619-4
Type :
conf
DOI :
10.1109/IJCNN.2000.861349
Filename :
861349
Link To Document :
بازگشت