1999 · 151 citations · 8 references
BusinessComputer ScienceAlgorithmsMarkov Decision ProcessesStochastic ProcessesBayesian Decision TheoryPolicy IterationPolicy LearningReinforcement LearningStochastic ControlStochastic GamesBayesian Dynamic ModelsGraphical InferenceGraphical ModelsReinforcement Learning Theory
We present a provably efficient and near-optimal algorithm for reinforcement learning in Markov decision processes (MDPs) whose transition model can be factored as a dynamic Bayesian network (DBN). Our algorithm generalizes the recent algorithm of Kearns and Singh, and assumes that we are given both an algorithm for approximate planning, and the graphical structure (but not the parameters) of the DBN. Unlike the original algorithm, our new algorithm exploits the DBN structure to achieve a running time that scales polynomially in the number of parameters of the DBN, which may be exponentially smaller than the number of global states. 1
8
Tractable Inference for Complex Stochastic Processes
Xavier Boyen, Daphne Koller · arXiv (Cornell University) · 2013 · 488 citations · Full text
Solving very large weakly coupled Markov decision processes
Nicolas Meuleau, Miloš Hauskrecht, Kee-Eung Kim et al. · 1998 · 176 citations
Management, Decision Sciences, Markov Decision Processes +13