Sciweavers

511 search results - page 6 / 103
» Lower bounds for distributed markov chain problems
Sort
View
QEST
2006
IEEE
14 years 1 months ago
Limiting Behavior of Markov Chains with Eager Attractors
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...

Publication
151views
12 years 6 months ago
Robust Bayesian reinforcement learning through tight lower bounds
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
Christos Dimitrakakis
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
14 years 28 days ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
ICML
2004
IEEE
14 years 8 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
DSN
2006
IEEE
14 years 1 months ago
Automatic Recovery Using Bounded Partially Observable Markov Decision Processes
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
Kaustubh R. Joshi, William H. Sanders, Matti A. Hi...