arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1212.2500cs.LGcs.AIstat.ML
收藏

贝叶斯网络学习中的局部最优问题

On Local Optima in Learning Bayesian Networks

Aalborg University(奥尔堡大学)

Jens D. Nielsen, Tomas Kocka, Jose M. Pena

摘要:

本文提出并评估了k-贪婪等价搜索算法(KES)学习贝叶斯网络(BN)从完整的数据。KES的主要特点是它允许贪婪和随机性之间的权衡,从而探索不同的好的局部最优。当贪婪被设置为最大值时,KES对应于贪婪等价搜索算法(GES)。当贪婪保持在最低限度,我们证明了在温和的假设下,KES渐近返回任何包含最优BN与非零概率。合成和真实数据的实验结果表明,KES往往发现一个更好的局部最优比GES。此外,我们使用KES实验证实,不同的局部最优的数量往往是巨大的。

英文摘要:

This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). When greediness is kept at minimum, we prove that under mild assumptions KES asymptotically returns any inclusion optimal BN with nonzero probability. Experimental results for both synthetic and real data are reported showing that KES often finds a better local optima than GES. Moreover, we use KES to experimentally confirm that the number of different local optima is often huge.

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

↑