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

混合网络中的推理:理论极限与实用算法

Inference in Hybrid Networks: Theoretical Limits and Practical Algorithms

Stanford University(斯坦福大学);Duke University(杜克大学)

Uri Lerner, Ron Parr

摘要:

混合贝叶斯网络的一个重要子类是那些表示条件线性高斯(CLG)分布的网络--对于离散变量的每个实例,具有多变量高斯分量的分布。在本文中,我们将探讨CLG中的推理问题。我们发现,CLG中的推理可能比贝叶斯网中的推理要困难得多。特别是,我们证明了,即使CLG被限制到一个非常简单的结构,其中每个连续的节点有最多一个离散的祖先,推理任务是NP-hard的CLG的精确推理算法的计算成本往往令人望而却步,我们探索了几个近似推理算法。这些算法试图找到一个小的高斯子集,这是一个很好的近似完整的混合分布。我们考虑两个蒙特卡罗方法和一种新的方法,枚举混合物成分的先验概率的顺序。我们比较这些方法在各种问题上,并表明我们的新算法是非常有前途的大型,混合诊断问题。

英文摘要:

An important subclass of hybrid Bayesian networks are those that represent Conditional Linear Gaussian (CLG) distributions --- a distribution with a multivariate Gaussian component for each instantiation of the discrete variables. In this paper we explore the problem of inference in CLGs. We show that inference in CLGs can be significantly harder than inference in Bayes Nets. In particular, we prove that even if the CLG is restricted to an extremely simple structure of a polytree in which every continuous node has at most one discrete ancestor, the inference task is NP-hard.To deal with the often prohibitive computational cost of the exact inference algorithm for CLGs, we explore several approximate inference algorithms. These algorithms try to find a small subset of Gaussians which are a good approximation to the full mixture distribution. We consider two Monte Carlo approaches and a novel approach that enumerates mixture components in order of prior probability. We compare these methods on a variety of problems and show that our novel algorithm is very promising for large, hybrid diagnosis problems.

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

↑