44 search results - page 4 / 9 » Approximate inference for planning in stochastic relational ... |
AGI
2008
13 years 10 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
DAGSTUHL
2007
13 years 10 months ago
2007
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
NECO
2007
13 years 8 months ago
2007
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
JMLR
2010
13 years 3 months ago
2010
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
ISRR
2005
Springer
14 years 2 months ago
2005
Springer
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...