Optimizing average reward using discounted rewards

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

Volumn 2111, Issue , 2001, Pages 605-615

  Kakade, Sham ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; MARKOV PROCESSES; REINFORCEMENT LEARNING;

APPROXIMATE HESSIANS; AVERAGE REWARD; BELLMAN EQUATIONS; BIASED ESTIMATES; DISCOUNT FACTORS; DISCOUNTED REWARD; MIXING TIME; POLICY GRADIENT;

COMPUTATION THEORY;

EID: 84943252297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44581-1_40     Document Type: Conference Paper

References (10)

1. P. Bartlett and J. Baxter. Estimation and approximation bounds for gradientbased reinforcement learning. Technical report, Australian National University, 2000.
2. J. Baxter and P. Bartlett. Direct gradient-based reinforcement learning. Technical report, Australian National University, Research School of Information Sciences and Engineering, July 1999.
3. J. Baxter and P. Bartlett. Algorithms for infinite-horizon policy-gradient estimation. Journal of Artificial Intelligence Research, 2001. (forthcoming).
4. D. P. Bertsekas. Dynamic Programming and Optimal Control, Volumes 1 and 2. Athena Scientific, 1995.
5. P. Marbach and J. Tsitsiklis. Simulation-based optimization of markov reward processes. Technical report, Massachusetts Institute of Technology, 1998.
6. S. Singh, T. Jaakkola, and M. I. Jordan. Learning without state-estimation in partially observable markovian decision processes. Proc.11th International Conference on Machine Learning, 1994.
7. R. Sutton, D. McAllester, S. Singh, and Y. Mansour. Policy gradient methods for reinforcement learningwith function approximation. Neural Information Processing Systems, 13, 2000.
8. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.
9. John N. Tsitsiklis and Benjamin Van Roy. Average cost temporal-difference learning. Automatica, 35:319–349, 1999.
10. John N. Tsitsiklis and Benjamin Van Roy. On average versus discounted reward temporal-difference learning. Machine Learning, 2001. (forthcoming).