Active reinforcement learning

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 296-303

  Epshteyn, Arkady ^a   Vogel, Adam ^b   Dejong, Gerald ^b  

^a GOOGLE INC   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; MACHINE LEARNING; MARKOV PROCESSES; LEARNING SYSTEMS; REINFORCEMENT; ROBOT LEARNING;

ACTIVE REINFORCEMENT; EXPLORATION STRATEGIES; MARKOV DECISION PROCESSES; OPTIMAL POLICIES; PLANNING PROBLEM; TRANSITION PROBABILITIES;

REINFORCEMENT LEARNING; OPTIMIZATION;

ACTIVE REINFORCEMENTS; EXPLORATION STRATEGIES; MARKOV DECISION PROCESS; OPTIMAL POLICIES; PLANNING PROBLEMS; TRANSITION PROBABILITIES;

EID: 56449114181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390194     Document Type: Conference Paper

References (14)

1. Abbeel, P., & Ng, A. Y. (2005). Exploration and apprenticeship learning in reinforcement learning. ICML.
2. Abbeel, P., Quigley, M., & Ng, A. (2006). Using inaccurate models in reinforcement learning. ICML.
3. Brafman, R. I., & Tennenholtz, M. (2002). R-MAX- A general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3, 213-231.
4. Cao, X. (2003). From perturbation analysis to markov decision processes and reinforcement learning. Discrete Event Dynamic Systems: Theory and Applications, 13, 9-39.
5. Dearden, R., Friedman, N., & Andre, D. (1999). Model based bayesian exploration. Uncertainty in Artificial Intelligence.
6. Devroye, L. (1986). Non-uniform random variate generation. New York, NY: Springer-Verlag.
7. Givan, R., Leach, S., & Dean, T. (2000). Bounded-parameter markov decision processes. Artificial Intelligence, 122, 71-109.
8. Kearns, M., & Singh, S. (2002). Near optimal reinforcement learning in polynomial time. Machine Learning, 49, 209-232.
9. Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998). Applications of second-order cone programming. Linear Algebra and its Applications, 284, 193-228.
10. Madani, O. (2000). Complexity results for infinite-horizon markov decision processes. Doctoral dissertation, University of Washington.
11. Nilim, A., & Ghaoui, L. E. (2003). Robustness in markov decision problems with uncertain transition matrices. NIPS.
12. Puterman, M. (1994). Markov decision processes -discrete stochastic dynamic programming. New York, NY: John Wiley & Sons, Inc.
13. Strehl, A. L., & Littman, M. L. (2005). A theoretical analysis of model-based interval estimation. ICML.
14. Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. Cambridge, MA: MIT Press.