Blackwell空间中目标问题的逼近
Approximation of target problems in Blackwell spaces
摘要:
在弱Blackwell空间上,我们展示了如何定义一个马尔可夫链逼近问题,为目标问题。在不同的伪度量下,证明了逼近问题收敛于最优约化问题。讨论了信息压缩的一个计算实例。
英文摘要:
On a weakly Blackwell space we show how to define a Markov chain approximating problem, for the target problem. The approximating problem is proved to converge to the optimal reduced problem under different pseudometrics. A computational example of compression of information is discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。