Reinforcement learning in continuous time and space: interference and not ill conditioning is the main problem when using distributed function approximators.
Many interesting problems in reinforcement learning (RL) are continuous and/or high dimensional, and in this instance, RL techniques require the use of function approximators for learning value functions and policies. Often, local linear models have been preferred over distributed nonlinear models for function approximation in RL. We suggest that one reason for the difficulties encountered when using distributed architectures in RL is the problem of negative interference, whereby learning of new data disrupts previously learned mappings. The continuous temporal difference (TD) learning algorithm TD(lambda) was used to learn a value function in a limited-torque pendulum swing-up task using a multilayer perceptron (MLP) network. Three different approaches were examined for learning in the MLP networks; 1) simple gradient descent; 2) vario-eta; and 3) a pseudopattern rehearsal strategy that attempts to reduce the effects of interference. Our results show that MLP networks can be used for value function approximation in this task but require long training times. We also found that vario-eta destabilized learning and resulted in a failure of the learning process to converge. Finally, we showed that the pseudopattern rehearsal strategy drastically improved the speed of learning. The results indicate that interference is a greater problem than ill conditioning for this task.
Baddeley
Bart
B
Centre for Computational Neuroscience and Robotics, Department of Informatics, University of Sussex, Brighton, UK.
D000465:Algorithms; D003198:Computer Simulation; D005246:Feedback; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D011382:Programming, Linear; D012054:Reinforcement, Psychology; D013598:Systems Theory