Policy search via density estimation

Advances in Neural Information Processing Systems

Volumn , Issue , 2000, Pages 1022-1028

  Ng, Andrew Y ^a   Parr, Ronald ^b   Roller, Daphne ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

COMPLEX PROBLEMS; DENSITY PROPAGATION; GRADIENT DESCENT; MARKOV DECISION PROCESSES; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PROBABILITY DENSITIES; SOLUTION QUALITY; STOCHASTIC PROPAGATION;

STOCHASTIC MODELS;

EID: 84898967780     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. L. Baird and A.W. Moore. Gradient descent for general Reinforcement Learning. In NIPS 11, 1999.
2. C. Boutilier. T. Dean, and S. Hanks. Decision theoretic planning: Structural assumptions and computational leverage. J. Artificial Intelligence Research, 1999.
3. X. Boyen and D. Koller. Tractable inference for complex stochastic processes. In Proc. UAI, pages 33-42, 1998.
4. J. Forbes, T. Huang, K. Kanazawa, and S.J. Russell. The BATmobile: Towards a Bayesian automated taxi. In Proc. IJCAI, 1995.
5. D. Koller and R. Fratkina. Using learning for approximation in stochastic processes. In Proc. ICML, pages 287-295, 1998.
6. N. Meuleau, L. Peshkin, K-E. Kim, and L.P. Kaelbling. Learning finite-state controllers for partially observable environments. In Proc. UAI 15, 1999.
7. J. Randløv and P. Alstrøm. Learning to drive a bicycle using reinforcement learning and shaping. In Proc. ICML, 1998.
8. J.K. Williams and S. Singh. Experiments with an algorithm which learns stochastic memoryless policies for POMDPs. In NIPS 11, 1999.
9. R.J. Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8:229-256, 1992.