Batch value function approximation via support vectors

Advances in Neural Information Processing Systems

Volumn , Issue , 2002, Pages

  Dietterich, Thomas G ^a   Wang, Xin ^a  

^a OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRADIENT METHODS;

BELLMAN EQUATIONS; FUNCTION APPROXIMATORS; KERNEL METHODS; MAZE PROBLEMS; POLICY GRADIENT METHODS; SUPPORT VECTOR; VALUE FUNCTION APPROXIMATION; VALUE FUNCTIONS;

REINFORCEMENT LEARNING;

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

References (6)

1. Baird, L. C. (1993). Advantage updating. Tech. rep. 93-1146, Wright-Patterson AFB.
2. Moll, R., Barto, A. G., Perkins, T. J., & Sutton, R. S. (1999). Learning instanceindependent value functions to enhance local search. NIPS-II, 1017-1023.
3. Tesauro, G. (1995). Temporal difference learning and TD-Gammon. CACM, 28(3), 58-68.
4. Utgoff, P. E., & Saxena, S. (1987). Learning a preference predicate. In ICML-87, 115-121.
5. Vapnik, V. (2000). The Nature of Statistical Learning Theory, 2nd Ed. Springer.
6. Zhang, W., & Dietterich, T. G. (1995). A reinforcement learning approach to jobshop scheduling. In IJCAI95, 1114-1120.