Open theoretical questions in reinforcement learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1572, Issue , 1999, Pages 11-17

  Sutton, Richard S ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947807317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49097-3_2     Document Type: Conference Paper

References (18)

1. Baird, L. C. (1995). Residual algorithms: Reinforcement learning with function approximation. In Proceedings of the Twelfth International Conference on Machine Learning, pp. 30-37. Morgan Kaufmann, San Francisco.
2. Bertsekas, D. P., and Tsitsiklis, J. N. (1996). Neuro-Dynamic Programming. Athena Scientific, Belmont, MA.
3. Crites, R. H., and Barto, A. G. (1996). Improving elevator performance using reinforcement learning. In Advances in Neural Information Processing Systems: Proceedings of the 1995 Conference, pp. 1017-1023. MIT Press, Cambridge, MA.
4. Kearns, M., Mansour, Y., Ng, A. Y. (in prep.). Sparse sampling methods for planning and learning in large and partially observable Markov decision processes.
5. Loch J., and Singh S. (1998). Using eligibility traces to find the best memoryless policy in partially observable Markov decision processes. In Proceedings of the Fifteenth International Conference on Machine Learning. Morgan Kaufmann, San Francisco.
6. Mahadevan, S. (1996). Average reward reinforcement learning: Foundations, algorithms, and empirical results. Machine Learning, 22: 159-196.
7. Moore, A. W., and Atkeson, C. G. (1993). Prioritized sweeping: Reinforcement learning with less data and less real time. Machine Learning, 13: 103-130.
8. Singh, S. P. (1993). Learning to Solve Markovian Decision Processes. Ph. D. thesis, University of Massachusetts, Amherst. Appeared as CMPSCI Technical Report 93-77.
9. Singh, S. P., and Bertsekas, D. (1997). Reinforcement learning for dynamic channel allocation in cellular telephone systems. In Advances in Neural Information Processing Systems: Proceedings of the 1996 Conference, pp. 974-980. MIT Press, Cambridge, MA.
10. Singh S., and Dayan P. (1998). Analytical mean squared error curves for temporal difference learning. Machine Learning.
11. Singh, S. P., and Sutton, R. S. (1996). Reinforcement learning with replacing eligibility traces. Machine Learning, 22: 123-158.
12. Sutton, R. S. (1984). Temporal Credit Assignment in Reinforcement Learning. Ph. D. thesis, University of Massachusetts, Amherst.
13. Sutton, R. S. (1996). Generalization in reinforcement learning: Successful examples using sparse coarse coding. In Advances in Neural Information Processing Systems: Proceedings of the 1995 Conference, pp. 1038-1044. MIT Press, Cambridge, MA.
14. Sutton, R. S., and Barto, A. G. (1998). Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
15. Tesauro, G. J. (1995). Temporal difference learning and TD-Gammon. Communications of the ACM, 38: 58-68.
16. Tsitsiklis, J. N., and Van Roy, B. (1997). An analysis of temporal-difference learning with function approximation. IEEE Transactions on Automatic Control, 42: 674-690.
17. Watkins, C. J. C. H. (1989). Learning from Delayed Rewards. Ph. D. thesis, Cambridge University.
18. Watkins, C. J. C. H., and Dayan, P. (1992). Q-learning. Machine Learning, 8: 279-292.