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

奇摄动连续时间贝叶斯网络的降维

Dimension Reduction in Singularly Perturbed Continuous-Time Bayesian Networks

Nir Friedman, Raz Kupferman

摘要:

连续时间贝叶斯网络(Continuous-time Bayesian Networks,CTBN)是多分量连续时间马尔可夫过程的有向图表示。网络中的边表示组件之间的直接影响。多组分过程的联合速率矩阵由每个组分的条件速率矩阵分别指定。本文讨论的情况下,一些组件的时间尺度上的演变,这是短得多的时间尺度相比,其他组件。在本文中,我们证明了在极限的分离的尺度是无限的,马尔可夫过程收敛(分布,或弱)到一个减少,或有效的马尔可夫过程,只涉及慢组件。我们还证明,对于合理的分离规模(数量级)的减少过程是一个很好的近似的边缘过程的缓慢的组件。我们提供了一个简单的过程,建立一个减少CTBN这个有效的过程,条件率矩阵,可以直接从原始的CTBN计算,并讨论了在大型系统中的近似推理的影响。

英文摘要:

Continuous-time Bayesian networks (CTBNs) are graphical representations of multi-component continuous-time Markov processes as directed graphs. The edges in the network represent direct influences among components. The joint rate matrix of the multi-component process is specified by means of conditional rate matrices for each component separately. This paper addresses the situation where some of the components evolve on a time scale that is much shorter compared to the time scale of the other components. In this paper, we prove that in the limit where the separation of scales is infinite, the Markov process converges (in distribution, or weakly) to a reduced, or effective Markov process that only involves the slow components. We also demonstrate that for reasonable separation of scale (an order of magnitude) the reduced process is a good approximation of the marginal process over the slow components. We provide a simple procedure for building a reduced CTBN for this effective process, with conditional rate matrices that can be directly calculated from the original CTBN, and discuss the implications for approximate reasoning in large systems.

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

↑