Learning basis functions in hybrid domains

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1161-1166

  Kveton, Branislav ^a   Hauskrecht, Milos ^b  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HYBRID APPROXIMATE LINEAR PROGRAMMING (HALF); MARKOV DECISION PROCESSES (MDP); OPTIMIZATION PROBLEMS; PARAMETRIC BASIS FUNCTION MODELS;

APPROXIMATION THEORY; DECISION THEORY; FUNCTION EVALUATION; LEARNING SYSTEMS; LINEAR PROGRAMMING; MARKOV PROCESSES; OPTIMIZATION;

FUNCTIONS;

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

References (16)

1. Bellman, R.; Kalaba, R.; and Kotkin, B. 1963. Polynomial approximation - a new computational technique in dynamic programming: Allocation processes. Mathematics of Computation 17(82):155-161.
2. Bellman, R. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
3. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting structure in policy construction. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1104-1111.
4. Bresina, J.; Dearden, R.; Meuleau, N.; Ramakrishnan, S.; Smith, D.; and Washington, R. 2002. Planning under continuous time and resource uncertainty: A challenge for AI. In Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, 77-84.
5. de Fanas, D. P., and Van Roy, B. 2003. The linear programming approach to approximate dynamic programming. Operations Research 51(6):850-856.
6. Guestrin, C.; Hauskrecht, M.; and Kveton, B. 2004. Solving factored MDPs with continuous and discrete variables. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, 235-242.
7. Hauskrecht, M., and Kveton, B. 2004. Linear program approximations for factored continuous-state Markov decision processes. In Advances in Neural Information Processing Systems 16, 895-902.
8. Koller, D., and Parr, R. 1999. Computing factored value functions for policies in structured MDPs. In Proceedings of the I6th International Joint Conference on Artificial Intelligence, 1332-1339.
9. Kveton, B., and Hauskrecht, M. 2005. An MCMC approach to solving hybrid factored MDPs. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, 1346-1351.
10. Kveton, B., and Hauskrecht, M. 2006. Solving factored MDPs with exponential-family transition models. In Proceedings of the 16th International Conference on Automated Planning and Scheduling.
11. Mahadevan, S., and Maggioni, M. 2006. Value function approximation with diffusion wavelets and Laplacian eigenfunctions. In Advances in Neural Information Processing Systems 18, 843-850.
12. Mahadevan, S. 2005. Samuel meets Amarel: Automating value function approximation using global state space analysis. In Proceedings of the 20th National Conference on Artificial Intelligence, 1000-1005.
13. Patrascu, R.; Poupart, P.; Schuurmans, D.; Boutilier, C.; and Guestrin, C. 2002, Greedy linear value-approximation for factored Markov decision processes. In Proceedings of the 18th National Conference on Artificial Intelligence, 285-291.
14. Puterman, M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York, NY: John Wiley & Sons.
15. Schweitzer, P., and Seidmann, A. 1985. Generalized polynomial approximations in Markovian decision processes. Journal of Mathematical Analysis and Applications 110:568-582.
16. Van Roy, B. 1998. Planning Under Uncertainty in Complex Structured Environments. Ph.D. Dissertation, Massachusetts Institute of Technology.