283 search results - page 8 / 57 » Abstracting Reusable Cases from Reinforcement Learning |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We consider the problem of multi-task reinforcement learning where the learner is provided with a set of tasks, for which only a small number of samples can be generated for any g...
AAAI
1997
13 years 10 months ago
1997
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
ISOLA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Developing systems through the composition of reusable software services is not straightforward in most situations since different kinds of mismatch may occur among their...
Publication
We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous w...
Publication
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...