44 search results - page 4 / 9 » Approximate inference for planning in stochastic relational ... |
177
click to vote
AGI
2008
15 years 7 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...
169
click to vote
DAGSTUHL
2007
15 years 7 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 ...
174
click to vote
NECO
2007
15 years 5 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...
197
click to vote
JMLR
2010
15 years 25 days 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...
167
click to vote
ISRR
2005
Springer
15 years 11 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...