Sciweavers

682 search results - page 92 / 137
» One-Counter Markov Decision Processes
Sort
View
ICML
2007
IEEE
16 years 1 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
86
Voted
ICML
2008
IEEE
16 years 1 months ago
Apprenticeship learning using linear programming
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
Umar Syed, Michael H. Bowling, Robert E. Schapire
89
Voted
ICML
2008
IEEE
16 years 1 months ago
Manifold alignment using Procrustes analysis
In this paper we introduce a novel approach to manifold alignment, based on Procrustes analysis. Our approach differs from "semisupervised alignment" in that it results ...
Chang Wang, Sridhar Mahadevan
100
Voted
ICML
2003
IEEE
16 years 1 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
97
Voted
EVOW
2009
Springer
15 years 7 months ago
Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go
This paper presents a successful application of parallel (grid) coevolution applied to the building of an opening book (OB) in 9x9 Go. Known sayings around the game of Go are refou...
Pierre Audouard, Guillaume Chaslot, Jean-Baptiste ...