Sciweavers

312 search results - page 22 / 63
» Learning Partially Observable Deterministic Action Models
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling
ICMLA
2009
13 years 5 months ago
Multiagent Transfer Learning via Assignment-Based Decomposition
We describe a system that successfully transfers value function knowledge across multiple subdomains of realtime strategy games in the context of multiagent reinforcement learning....
Scott Proper, Prasad Tadepalli
PEPM
2011
ACM
12 years 10 months ago
Adaptation-based programming in java
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
Tim Bauer, Martin Erwig, Alan Fern, Jervis Pinto
SAC
2005
ACM
14 years 1 months ago
Reinforcement learning agents with primary knowledge designed by analytic hierarchy process
This paper presents a novel model of reinforcement learning agents. A feature of our learning agent model is to integrate analytic hierarchy process (AHP) into a standard reinforc...
Kengo Katayama, Takahiro Koshiishi, Hiroyuki Narih...
IJCAI
2007
13 years 9 months ago
Analogical Learning in a Turn-Based Strategy Game
A key problem in playing strategy games is learning how to allocate resources effectively. This can be a difficult task for machine learning when the connections between actions a...
Thomas R. Hinrichs, Kenneth D. Forbus