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

概率图模型在分布估计算法中的恢复与调整

On resampling vs. adjusting probabilistic graphical models in estimation of distribution algorithms

Federal University of Technology - Paraná (UTFPR)(联邦理工大学-巴拉那州(UTFPR));The University of Adelaide(阿德莱德大学);Aalborg University(奥尔堡大学)

Mohamed El Yafrani, Marcella S. R. Martins, Myriam R. B. S. Delgado, Inkyung Sung, Ricardo Lüders, Markus Wagner

摘要:

贝叶斯优化算法(BOA)是一种使用贝叶斯网络作为概率图模型(PGM)的分布估计算法(EDA)。在给定解样本的情况下,确定最优贝叶斯网络结构是一个NP难问题。这个步骤应该在BOA的每次迭代中完成,这是一个非常耗时的过程。出于这个原因,大多数实现使用贪婪估计算法,如K2。然而,我们在本文中表明,PGM结构的显着变化并不经常发生,并且在进化结束时可能特别稀疏。因此,BOA的统计研究提出了一种模式的PGM调整,可以作为一个指导,以减少在进化过程中的PGM更新的频率。这是通过提出一种新的基于BOA的优化方法(FBOA),其PGM在每次迭代时都不更新来实现的。这种新方法避免了标准BOA中通常存在的计算负担。结果比较两种算法的性能NK景观优化问题使用的耐用性和预期的运行时间之间的相关性枚举的实例。实验表明,FBOA提出了竞争力的结果,同时显着节省计算时间。

英文摘要:

The Bayesian Optimisation Algorithm (BOA) is an Estimation of Distribution Algorithm (EDA) that uses a Bayesian network as probabilistic graphical model (PGM). Determining the optimal Bayesian network structure given a solution sample is an NP-hard problem. This step should be completed at each iteration of BOA, resulting in a very time-consuming process. For this reason most implementations use greedy estimation algorithms such as K2. However, we show in this paper that significant changes in PGM structure do not occur so frequently, and can be particularly sparse at the end of evolution. A statistical study of BOA is thus presented to characterise a pattern of PGM adjustments that can be used as a guide to reduce the frequency of PGM updates during the evolutionary process. This is accomplished by proposing a new BOA-based optimisation approach (FBOA) whose PGM is not updated at each iteration. This new approach avoids the computational burden usually found in the standard BOA. The results compare the performances of both algorithms on an NK-landscape optimisation problem using the correlation between the ruggedness and the expected runtime over enumerated instances. The experiments show that FBOA presents competitive results while significantly saving computational time.

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

↑