90 search results - page 2 / 18 » On the hardness of finding symmetries in Markov decision pro... |
NIPS
2004
13 years 8 months ago
2004
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
COLING
2010
13 years 2 months ago
2010
This paper investigates how to automatically create a dialogue control component of a listening agent to reduce the current high cost of manually creating such components. We coll...
AAAI
1997
13 years 8 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
IJCAI
2007
13 years 8 months ago
2007
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...