arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.01345cs.LGstat.ML
收藏

多目标优化在贝叶斯网络学习中的性能研究

Investigating the performance of multi-objective optimization when learning Bayesian Networks

University of Milano-Bicocca(米兰比可卡大学);SYSBIO/ISBE.IT Centre for Systems Biology(SYSBIO/ISBE.IT系统生物学中心);Eindhoven University of Technology(埃因霍温理工大学);University of Bergamo(贝加莫大学);Stanford University(斯坦福大学)

Paolo Cazzaniga, Marco S. Nobile, Daniele Ramazzotti

摘要:

贝叶斯网络在过去的几十年中被广泛应用于许多领域,用于描述随机变量之间的统计依赖关系。一般来说,学习这种模型的结构是一个具有相当大的理论兴趣的问题,提出了许多挑战。一方面,这是一个众所周知的NP完全问题,实际上由于可能的解决方案的巨大搜索空间而变得更加困难。另一方面,I-等价现象,即,支持同一组统计依赖性的不同图形结构可能导致多模态适应度景观,进一步阻碍解决该任务的最大似然方法。特别是,我们利用NSGA-II多目标优化程序,以明确占的解决方案的可能性和所选弧的数量,通过设置这些作为该方法的两个目标函数。本工作的目的是研究NSGA-II的行为和分析其解决方案的质量。因此,我们彻底检查了在广泛的模拟数据集上获得的优化结果,通过考虑在所实现的目标函数值方面推断出的解决方案的优度,并通过将检索到的结构与真实情况进行比较,即,用于生成目标数据的网络。我们的研究结果表明,NSGA-II可以收敛到解决方案的特点是更好的可能性和更少的弧比经典的方法,虽然矛盾的特点是在许多情况下,与目标网络的相似性较低。

英文摘要:

Bayesian Networks have been widely used in the last decades in many fields, to describe statistical dependencies among random variables. In general, learning the structure of such models is a problem with considerable theoretical interest that poses many challenges. On the one hand, it is a well-known NP-complete problem, practically hardened by the huge search space of possible solutions. On the other hand, the phenomenon of I-equivalence, i.e., different graphical structures underpinning the same set of statistical dependencies, may lead to multimodal fitness landscapes further hindering maximum likelihood approaches to solve the task. In particular, we exploit the NSGA-II multi-objective optimization procedure in order to explicitly account for both the likelihood of a solution and the number of selected arcs, by setting these as the two objective functions of the method. The aim of this work is to investigate the behavior of NSGA-II and analyse the quality of its solutions. We thus thoroughly examined the optimization results obtained on a wide set of simulated data, by considering both the goodness of the inferred solutions in terms of the objective functions values achieved, and by comparing the retrieved structures with the ground truth, i.e., the networks used to generate the target data. Our results show that NSGA-II can converge to solutions characterized by better likelihood and less arcs than classic approaches, although paradoxically characterized in many cases by a lower similarity with the target network.

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

↑