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

概率规划协方差的推断

Inferring Covariances for Probabilistic Programs

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

摘要:

我们研究了带有条件的概率程序的结果方差和运行时间方差的最弱前提推理。对于结果,我们表明,近似(协)方差是计算上更困难的近似期望值。特别是,我们证明,计算(协)方差的下限和上限是$Σ^{0}_{2}$ -完成。因此,下界和上界都不是可计算的。因此,我们提出了基于不变量的技术,使枚举的上限和下限,一旦适当的不变量被发现。最后,我们扩展这种方法来推理运行时的差异。

英文摘要:

We study weakest precondition reasoning about the (co)variance of outcomes and the variance of run-times of probabilistic programs with conditioning. For outcomes, we show that approximating (co)variances is computationally more difficult than approximating expected values. In particular, we prove that computing both lower and upper bounds for (co)variances is $Σ^{0}_{2}$-complete. As a consequence, neither lower nor upper bounds are computably enumerable. We therefore present invariant-based techniques that do enable enumeration of both upper and lower bounds, once appropriate invariants are found. Finally, we extend this approach to reasoning about run-time variances.

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

↑