✦ LIBER ✦

Approximation of Markov chains defined by recursion relations

✍ Scribed by S. A. Anichkin

Publisher: Springer US
Year: 1986
Tongue: English
Weight: 835 KB
Volume: 32
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01085153

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation of Markov chains

✍ S. A. Anichkin; V. V. Kalashnikov 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 522 KB

Geometry of recursion for arithmetic and

Geometry of recursion for arithmetic and existentially defined relations

✍ A. I. Provotar 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 421 KB

Linear stochastic approximation driven b

Linear stochastic approximation driven by slowly varying Markov chains

✍ Vijay R. Konda; John N. Tsitsiklis 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

We study a linear stochastic approximation algorithm that arises in the context of reinforcement learning. The algorithm employs a decreasing step-size, and is driven by Markov noise with time-varying statistics. We show that under suitable conditions, the algorithm can track the changes in the stat

Recursive estimation of a discrete-time

Recursive estimation of a discrete-time Markov chain

✍ Y. Yavin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 548 KB

Nonhomogeneous, continuous-time Markov c

Nonhomogeneous, continuous-time Markov chains defined by series of proportional intensity matrices

✍ Jean T. Johnson; Glenn R. Luecke 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 559 KB

On the approximation of one Markov chain

On the approximation of one Markov chain by another

✍ Mark Jerrum 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 161 KB