arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.04541stat.ML
收藏

卡尔曼滤波器什么时候可以索引不安分的强盗?

When are Kalman-filter restless bandits indexable?

Christopher R. Dance, Tomi Silander

摘要:

本文研究了离散时间中与一个极其简单的标量卡尔曼滤波模型相关联的不安分强盗。在一定的假设下,我们证明了这个问题是索引的意义上说,惠特尔指数是一个非减函数的相关信念状态。尽管这个问题的历史很长,但这似乎是第一个这样的证据。我们使用Schur凸性和机械的话,这是特别的二进制字符串密切相关的回文结果。

英文摘要:

We study the restless bandit associated with an extremely simple scalar Kalman filter model in discrete time. Under certain assumptions, we prove that the problem is indexable in the sense that the Whittle index is a non-decreasing function of the relevant belief state. In spite of the long history of this problem, this appears to be the first such proof. We use results about Schur-convexity and mechanical words, which are particular binary strings intimately related to palindromes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑