Fast Online Q(λ)

Machine Learning

Volumn 33, Issue 1, 1998, Pages 105-115

  Wiering, Marco ^a   Schmidhuber, Jürgen ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Lazy learning; Online Q( ); Q learning; Reinforcement learning; TD( )

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERROR ANALYSIS; MARKOV PROCESSES; MATHEMATICAL OPERATORS; ONLINE SYSTEMS; PROBABILITY DISTRIBUTIONS; COMPUTATIONAL COMPLEXITY; LEARNING ALGORITHMS; TABLE LOOKUP;

LAZY LEARNING; Q-LEARNING; REINFORCEMENT LEARNING; STATE/ACTION SPACE;

LEARNING SYSTEMS;

EID: 0032182997     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007562800292     Document Type: Article

References (21)

1. Albus, J.S. (1975). A new approach to manipulator control: The cerebellar model articulation controller (CMAC). Dynamic Systems, Measurement and Control, 97, 220-227.
2. Atkeson, C.G., Schaal, S., & Moore, A.W. (1997). Locally weighted learning. Artificial Intelligence Review, 11, 11-73.
3. Barto, A.G., Sutton, R.S., & AndersOn, C.W. (1983). Neuronlike adaptive elements that can solve difficult learning control problems. IEEE Transactions on Systems, Man, and Cybernetics, SMC-13, 834-846.
4. Bertsekas, O.P., & Tsitsiklis, J.N. (1996). Neuro-dynamic programming. Belmont, MA: Athena Scientific.
5. Caironi, P.V.C., & Dorigo, M. (1994). Training Q-agents (Technical Report IRIDIA-94-14). Université Libre de Bruxelles.
6. Cichosz, P. (1995). Truncating temporal differences: On the efficient implementation of TD(λ) for reinforcement learning. Journal of Artificial Intelligence Research, 2, 287-318.
7. Fritzke, B. (1994). Supervised learning with growing cell structures. In J. Cowan, G. Tesauro, & J. Alspector (Eds.), Advances in neural information processing systems (Vol.6, pp. 255-262). San Mateo, CA: Morgan Kaufmann.
8. Koenig, S., & Simmons, R.G. (1996). The effect of representation and knowledge on goal-directed exploration with reinforcement learning algorithms. Machine Learning, 22, 228-250.
9. Kohonen, T. (1988). Self-organization and associative memory (2nd ed.). Springer.
10. Lin, L.-J. (1993). Reinforcement learning for robots using neural networks. Ph.D. thesis, Carnegie Mellon University, Pittsburgh.
11. Peng, J., & Williams, R. (1996). Incremental multi-step Q-learning. Machine Learning, 22, 283-290.
12. Rummery, G., & Niranjan, M. (1994). On-line Q-learning using connectionist sytems (Technical Report CUED/ F-INFENG-TR 166). UK: Cambridge University.
13. Singh, S., & Sutton, R. (1996). Reinforcement learning with replacing eligibility traces. Machine Learning, 22, 123-158.
14. Sutton, R.S. (1988). Learning to predict by the methods of temporal differences. Machine Learning, 3, 9-44.
15. Sutton, R.S. (1996). Generalization in reinforcement learning: Successful examples using sparse coarse coding. In D.S. Touretzky, M.C. Mozer, & M.E. Hasselmo (Eds.), Advances in neural information processing systems, (Vol. 8, pp. 1033-1045). Cambridge, MA: MIT Press.
16. Tesauro, G. (1992). Practical issues in temporal difference learning. In D.S., Lippman, J.E. Moody, & D.S Touretzky (Eds.), Advances in neural information processing systems (Vol. 4, pp. 259-266). San Mateo, CA: Morgan Kaufmann.
17. Thrun, S. (1992). Efficient exploration in reinforcement learning (Technical Report CMU-CS-92-102). CarnegieMellon University.
18. Watkins, C.J.C.H. (1989). Learning from delayed rewards. Ph.D. thesis, King's College, Cambridge, England.
19. Watkins, C.J.C.H., & Dayan, P. (1992). Technical note: Q-learning. Machine Learning, 8, 279-292.
20. Whitehead, S. (1992). Reinforcement learning for the adaptive control of perception and action. Ph.D. thesis, University of Rochester.
21. Wiering, M.A., & Schmidhuber, J. (1998). Speeding up Q(λ)-learning. In C. Nedellec, & C. Rouveirol (Eds.), Machine Learning: Proceedings of the Tenth European Conference. Berlin: Springer Verlag.