Sciweavers

340 search results - page 17 / 68
» Kernelized value function approximation for reinforcement le...
Sort
View
132
Voted
AIIDE
2006
15 years 3 months ago
The Self Organization of Context for Learning in MultiAgent Games
Reinforcement learning is an effective machine learning paradigm in domains represented by compact and discrete state-action spaces. In high-dimensional and continuous domains, ti...
Christopher D. White, Dave Brogan
120
Voted
ICML
1998
IEEE
16 years 3 months ago
The MAXQ Method for Hierarchical Reinforcement Learning
This paper presents a new approach to hierarchical reinforcement learning based on the MAXQ decomposition of the value function. The MAXQ decomposition has both a procedural seman...
Thomas G. Dietterich
CIG
2005
IEEE
15 years 8 months ago
Nannon: A Nano Backgammon for Machine Learning Research
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
Jordan B. Pollack
125
Voted
ATAL
2008
Springer
15 years 4 months ago
Sigma point policy iteration
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
Michael H. Bowling, Alborz Geramifard, David Winga...
126
Voted
AAAI
2010
15 years 3 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie