| 
View
 

RL = Q-learning or perhaps TD

Page history last edited by Satinder Singh 15 years, 10 months ago

The ambition of this page is to discuss and (hopefully dispel) the myth that RL is Q-learning (or perhaps TD).


Fortunately, this myth may well by dying a natural death. The most damaging form of this myth restricts RL to the simplest of RL methods: Q-learning and TD(lambda) with lookup tables or at most linear function approximators.

A casual perusal of the Algorithms of RL page will remind the viewer that there are a variety of different RL algorithms that explore the rich and multidimensional space of algorithm dimensions.

 

Comments (0)

You don't have permission to comment on this page.