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

动态概率网络的随机模拟算法

Stochastic Simulation Algorithms for Dynamic Probabilistic Networks

Keiji Kanazawa, Daphne Koller, Stuart Russell

摘要:

随机模拟算法(如似然加权)通常可以快速、准确地近似概率网络中的后验概率,并且是非常大型网络的首选方法。不幸的是,用于表示随机时间过程的动态概率网络(DPN)的特殊特性意味着标准模拟算法的性能非常差。从本质上讲,随着时间的推移,模拟试验越来越偏离现实。在本文中,我们提出了模拟算法,使用在每个时间步观察到的证据,推动一组审判回到现实。第一个算法,“证据反转”(ER)重构DPN的每个时间片,使得该时间片的证据节点成为状态变量的祖先。第二种算法称为“适者生存”抽样(SOF),在每个时间步使用随机复制率(由每个试验的证据可能性加权)“重新填充”试验集。我们比较了每种算法的性能与原始网络的似然加权,并研究了ER和SOF方法相结合的好处。ER/SOF组合似乎保持有界误差独立于模拟中的时间步长的数量。

英文摘要:

Stochastic simulation algorithms such as likelihood weighting often give fast, accurate approximations to posterior probabilities in probabilistic networks, and are the methods of choice for very large networks. Unfortunately, the special characteristics of dynamic probabilistic networks (DPNs), which are used to represent stochastic temporal processes, mean that standard simulation algorithms perform very poorly. In essence, the simulation trials diverge further and further from reality as the process is observed over time. In this paper, we present simulation algorithms that use the evidence observed at each time step to push the set of trials back towards reality. The first algorithm, "evidence reversal" (ER) restructures each time slice of the DPN so that the evidence nodes for the slice become ancestors of the state variables. The second algorithm, called "survival of the fittest" sampling (SOF), "repopulates" the set of trials at each time step using a stochastic reproduction rate weighted by the likelihood of the evidence according to each trial. We compare the performance of each algorithm with likelihood weighting on the original network, and also investigate the benefits of combining the ER and SOF methods. The ER/SOF combination appears to maintain bounded error independent of the number of time steps in the simulation.

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

↑