Knows what it knows: A framework for self-aware learning

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 568-575

  Li, Hong ^a   Littman, Michael L ^a   Walsh, Thomas J ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS; REINFORCEMENT; ROBOT LEARNING;

LEARNING FRAMEWORKS; LEARNING PROBLEMS; LEARNING SETTINGS; OPEN PROBLEMS; TRAINING EXAMPLES; REINFORCEMENT-LEARNING;

EDUCATION;

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

References (21)

1. Angluin, D. (2004). Queries revisited. Theoretical Computer Science, 313, :175-194.
2. Bagnell, J., Ng, A. Y., & Schneider, J. (2001). Solving uncertain Markov decision problems (Technical Report CMU-RI-TR-01-25). Robotics Institute, Carnegie Mellon University, Pittsburgh, PA.
3. Blum, A. (1994). Separating distribution-free and mistake-bound learning models over the Boolean domain. SIAM Journal on Computing, 23, 990-1000.
4. 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.
5. Cesa-Bianchi, N., Gentile, C., & Zaniboni, L. (2006). Worst-case analysis of selective sampling for linear classification. Journal of Machine Learning Research, 7, 1205-1230.
6. Cesa-Bianchi, N., Lugosi, G., & Stoltz, G. (2005). Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory, 51, 2152-2162.
7. Cohn, D. A., Atlas, L., & Ladner, R. E. (1994). Improving generalization with active learning. Machine Learning, 15, 201-221.
8. Fong, P. W. L. (1995). A quantitative study of hypothesis selection. Proceedings of the Twelfth International Conference on Machine Learning (ICML-95) (pp. 226-234).
9. Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997). Using and combining predictors that specialize. STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (pp. 334-343).
10. Helmbold, D. P., Littlestone, N., & Long, P. M. (2000). Apple tasting. Information and Computation, 161, 85-139.
11. Kakade, S., Kearns, M., & Langford, J. (2003). Exploration in metric state spaces. Proceedings of the 20th International Conference on Machine Learning.
12. Kakade, S. M. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, Gatsby Computational Neuroscience Unit, University College London.
13. Kearns, M. J., & Koller, D. (1999). Efficient reinforcement learning in factored MDPs. Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI) (pp. 740-747).
14. Kearns, M. J., & Singh, S. P. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49, 209-232.
15. Lane, T., & Brodley, C. E. (2003). An empirical study of two approaches to sequence learning for anomaly detection. Machine Learning, 51, 73-107.
16. Littlestone, N. (1987). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.
17. Strehl, A. L., Diuk, C., & Littman, M. L. (2007). Efficient structure learning in factored-state MDPs. Proceedings of the Twenty-Second National Conference on Artificial Intelligence (AAAI-07).
18. Strehl, A. L., & Littman, M. L. (2008). Online linear regression and its application to model-based reinforcement learning. Advances in Neural Information Processing Systems 20.
19. Strehl, A. L., Mesterharm, C., Littman, M. L., & Hirsh, H. (2006). Experience-efficient learning in associative bandit problems. Proceedings of the Twenty-third International Conference on Machine Learning (ICML-06).
20. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
21. Weiss, G. M., & Tian, Y. (2006). Maximizing classifier utility when training data is costly. SIGKDD Explorations, 8, 31-38.