.png){kind=icon}
返回
Average cost temporal-difference learning
.png){kind=icon}
OA
AI
DOI：10.1016/S0005-1098(99)00099-0.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a variant of temporal-difference learning that approximates average and differential costs of an irreducible aperiodic Markov chain. Approximations are comprised of linear combinations of fixed basis functions whose weights are incrementally updated during a single endless trajectory of the Markov chain. We present a proof of convergence (with probability 1) and a characterization of the limit of convergence. We also provide a bound on the resulting approximation error that exhibits an interesting dependence on the mixing time of the Markov chain. The results parallel previous work by the authors, involving approximations of discounted cost-to-go. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
dynamic programming
learning
average cost
reinforcement learning
neuro-dynamic programming
approximation
temporal differences
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
