Learning to solve problems from exercises

Computational Intelligence

Volumn 24, Issue 4, 2008, Pages 257-291

  Tadepalli, Prasad ^a  

^a Oregon State University   (United States)

Author keywords

Control rule learning; Learning from exercises; Macro operator learning; PAC learning; Speedup learning

Indexed keywords

EDUCATION; TEACHING;

CONTROL RULE LEARNING; CONTROL RULES; DECISION LISTS; EFFICIENT LEARNINGS; LEARNING FROM EXERCISES; LEARNING RATES; PAC LEARNING; PLANNING DOMAINS; PROBLEM REDUCTIONS; SIMULATED ROBOTS; SPEEDUP LEARNING; SYMBOLIC INTEGRATIONS;

PROBLEM SOLVING;

EID: 55149107173     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2008.00330.x     Document Type: Article

References (38)

1. Barto, A. G., and S. Mahadevan. 2003. Recent advances in hierarchical reinforcement learning. Discrete Event Systems Journal, 13 : 41 77. Special Issue on Reinforcement Learning.
2. DeJong, G., and R. Mooney. 1986. Explanation based learning: An alternative view. Machine Learning, 1 : 145 176.
3. Dietterich, T. G. 2000. Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research, 13 : 227 303.
4. Earley, J. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13 (2 94 102.
5. Erol, K. 1995. Hierarchical task network planning: Formalization, analysis, and implementation. Ph. D. Thesis, University of Maryland, College Park.
6. Fern, A., S. Yoon, and R. Givan. 2006. Approximate policy iteration with a policy language bias: Solving relational markov decision processes. Journal of Artificial Intelligence, 25 : 75 118.
7. Fikes, R., P. Hart, and N. Nilsson. 1972. Learning and executing generalized robot plans. Artificial Intelligence, 3 : 251 288.
8. Finkelstein, L., and S. Markovitch. 1998. A selective macro-learning algorithm and its application to the N × N sliding-tile puzzle. Journal of AI Research, 8 : 223 263.
9. Gratch, J., and G. DeJong. 1992. Composer: A probabilistic solution to the utility problem in speedup-learning. In Proceedings of the 10th National Conference on Artificial Intelligence, pp. 235 240.
10. Iba, G. A. 1989. A heuristic approach to the discovery of macro-operators. Machine Learning, 3 : 285 317.
11. Kearns, M. J., and U. V. Vazirani. 1994. An Introduction to Computational Learning Theory. The M.I.T. Press, Cambridge, MA.
12. Khardon, R. 1996. Learning to take actions. In Proceedings of the 13th National Conference on Artificial Intelligence, pp. 787 792.
13. Khardon, R. 1999. Learning to take actions. Machine Learning, 35 : 57 90.
14. Korf, R. 1985. Macro-operators: A weak method for learning. Artificial Intelligence, 26 : 35 77.
15. Laird, J., P. Rosenbloom, and A. Newell. 1986. Chunking in SOAR: The anatomy of a general learning mechanism. Machine Learning, 1 (1 11 46.
16. Langley, P. 1983. Learning effective search heuristics. In Proceedings of the 8th International Joint Conference on Artificial Intelligence, pp. 94 96.
17. Laud, D., and G. DeJong. 2003. The influence of reward on the speed of reinforcement learning: An analysis of shaping. In Proceedings of the 20th International Conference on Machine Learning, pp. 440 447.
18. Marthi, B., S. Russell, and J. Wolfe. 2007. Angelic semantics for high-level actions. In Proceedings of the 17th International Conference on AI Planning and Scheduling, pp. 232 239.
19. Minton, S. 1990. Quantitative results concerning the utility of explanation-based learning. Artificial Intelligence, 42 (2-3 363 391.
20. Minton, S., J. Carbonell, C. Knoblock, D. Kuokka, O. Etzioni, and Y. Gil. 1989. Explanation-based learning: A problem solving perspective. Artificial Intelligence, 40 : 63 118.
21. Mitchell, T., R. Keller, and S. Kedar-Cabelli. 1986. Explanation based generalization: A unifying view. Machine Learning, 1 : 47 80.
22. Mitchell, T., P. Utgoff, and R. Banerji. 1983. Learning by experimentation: Acquiring and refining problem solving heuristics. In Machine Learning. Edited by R. Michalski, J. Carbonell, and T. Mitchell. Tioga, Palo Alto, CA, pp. 163 190.
23. Natarajan, B. 1989. On learning from exercises. In Proceedings of the 2nd Annual Workshop on Computational Learning Theory, pp. 72 87.
24. Natarajan, B. 1991. Machine Learning: A Theoretical Approach. Morgan Kaufmann, San Francisco, CA.
25. Natarajan, B., and P. Tadepalli. 1988. Two new frameworks for learning. In Proceedings of the 5th International Machine Learning Conference, pp. 402 415.
26. Ng, A. Y., D. Harada, and S. Russell. 1999. Policy invariance under reward transformations: Theory and application to reward shaping. In Proceedings of the 16th International Conference on Machine Learning, pp, 278 287.
27. Parr, R., and S. Russell. 1998. Reinforcement learning with hierarchies of machines. Advances in Neural Information Processing Systems, 10 : 1043 1049.
28. Reddy, C., and P. Tadepalli. 1997. Learning goal-decomposition rules using exercises. In Proceedings of the 14th International Conference on Machine Learning, pp. 278 286.
29. Reddy, C., and P. Tadepalli. 1998. Learning Horn definitions: Theory and an application to planning. New Generation Computing, 17 : 77 98.
30. Rivest, R. 1987. Learning decision lists. Machine Learning, 2 (3 229 246.
31. Seri, S., and P. Tadepalli. 2002. Model-based hierarchical average-reward reinforcement learning. In Proceedings of 19th International Machine Learning Conference, pp. 562 569.
32. Shavlik, J. 1990. Acquiring recursive and iterative concepts with explanation-based learning. Machine Learning, 5 : 39 70.
33. Sutton, R., and A. Barto. 1998. Reinforcement Learning: An Introduction. The MIT Press, Cambridge, MA.
34. Sutton, R. S., D. Precup, and S. Singh. 1999. Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112 (1-2 181 211.
35. Tadepalli, P. 1991. A formalization of explanation-based macro-operator learning. In Proceedings of the 12th International Joint conference on Artificial Intelligence, pp. 616 622.
36. Tadepalli, P. 1992. A theory of unsupervised speedup learning. In Proceedings of the 10th National Conference on Artificial Intelligence, pp. 229 234.
37. Tadepalli, P., and B. Natarajan. 1996. A formal framework for speedup learning from problems and solutions. Journal of Aritificial Intelligence Research, 4 : 445 475.
38. Valiant, L. 1984. A theory of the learnable. Communications of the ACM, 27 (11 1134 1142.