Bounding performance loss in approximate MDP homomorphisms

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 1649-1656

  Taylor, Jonathan J ^a   Precup, Doina ^b   Panangaden, Prakash ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

BISIMULATIONS; CONTINUOUS ACTIONS; MARKOV DECISION PROCESSES; OPTIMAL VALUE FUNCTIONS; PERFORMANCE LOSS;

MARKOV PROCESSES;

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

References (15)

1. Arun-Kumar, S. (2006). On bisimilarities induced by relations on actions. SEFM'06: Proceedings of the Fourth IEEE International Conference on Software Engineering and FormalMethods (pp. 41-49). Washington, DC, USA: IEEE Computer Society.
2. Ferns, N., Castro, P. S., Precup, D., & Panangaden, P. (2006). Methods for computing state similarity inMarkov Decision Processes. Proceedings of the 22nd UAI.
3. Ferns, N., Panangaden, P., & Precup, D. (2004). Metrics for finite markov decision processes. Proceedings of the 20th UAI (pp. 162-169).
4. Ferns, N., Panangaden, P., & Precup, D. (2005). Metrics for markov decision processes with infinite state spaces. Proceedings of the 21th UAI (pp. 201-209).
5. Gibbs, A., & Su, F. (2002). On choosing and bounding probability metrics.
6. Givan, R., Dean, T., & Greig, M. (2003). Equivalence notions and model minimization in Markov Decision Processes. Artificial Intelligence, 147, 163-223.
7. Larsen, K. G., & Skou, A. (1991). Bisimulation through probabilistic testing. Inf. Comput., 94, 1-28. (Pubitemid 21694897)
8. Li, L.,Walsh, T. J., & Littman, M. L. (2006). Towards a unified theory of state abstraction for MDPs. Proceedings of the International Symposium on Artificial Intelligence and Mathematics.
9. Milner, R. (1995). Communication and concurrency. Prentice Hall International (UK) Ltd.
10. Munkres, J. (1999). Topology. Prentice Hall.
11. Puterman, M. L. (1994). Markov decision processes: discrete stochastic dynamic programming. Wiley.
12. Ravindran, B., & Barto, A. G. (2003). Relativized options: Choosing the right transformation. Proceedings of 20th ICML (pp. 608-615).
13. Ravindran, B., &Barto, A. G. (2004). Approximate homomorphisms: A framework for non-exact minimization inn Markov Decision Processes. Proceedings of the Fifth International Conference on Knowledge Based Computer Systems.
14. Whitt, W. (1978). Approximations of dynamic programs i. Mathematics of Operations Research, 3, 231-243.
15. Wolfe, A. P., & Barto, A. G. (2006). Decision tree methods for finding reusable MDP homomorphisms. Proceedings of AAAI.