Sciweavers

908 search results - page 53 / 182
» Stochastic Finite Learning
Sort
View
NIPS
1996
13 years 10 months ago
Exploiting Model Uncertainty Estimates for Safe Dynamic Control Learning
Model learning combined with dynamic programming has been shown to be e ective for learning control of continuous state dynamic systems. The simplest method assumes the learned mod...
Jeff G. Schneider
ATAL
2004
Springer
14 years 2 months ago
Best-Response Multiagent Learning in Non-Stationary Environments
This paper investigates a relatively new direction in Multiagent Reinforcement Learning. Most multiagent learning techniques focus on Nash equilibria as elements of both the learn...
Michael Weinberg, Jeffrey S. Rosenschein
AAAI
2010
13 years 10 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Estimating the Lengths of Memory Words
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
Gusztáv Morvai, Benjamin Weiss
JMLR
2010
157views more  JMLR 2010»
13 years 3 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell