3694 search results - page 112 / 739 » Stochastic complexity in learning |
135
click to vote
ICTAI
2005
IEEE
15 years 11 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
161
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
131
click to vote
ICONIP
2009
15 years 3 months ago
2009
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
163
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
152
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
RVRL (Rule Value Reinforcement Learning) is a new algorithm which extends an existing learning framework that models the environment of a situated agent using a probabilistic rule...