48 search results - page 8 / 10 » An Analysis of Case-Based Value Function Approximation by Ap... |
127
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
106
Voted
AAAI
2010
15 years 4 months ago
2010
Automatically constructing novel representations of tasks from analysis of state spaces is a longstanding fundamental challenge in AI. I review recent progress on this problem for...
143
click to vote
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
141
Voted
AI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
134
Voted
NIPS
1998
15 years 4 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...