arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.7326cs.AI
收藏

基于q-高斯群量子粒子智能方法的数据交换

Replica Exchange using q-Gaussian Swarm Quantum Particle Intelligence Method

International Balkan University(国际巴尔干大学)

Hiqmet Kamberaj

摘要:

本文提出了一种新的基于q -高斯群量子粒子优化算法(REX@q-GSQPO)的粒子交换算法来解决求解全局最优解的问题。该算法的基础是运行多个副本的独立群体在不同的q参数值。基于能量标准,选择以满足详细的平衡,我们在规则的迭代间隔交换相邻群的粒子坐标。具有高Q值的群副本的特征在于高多样性的粒子,允许更快地逃离局部极小值,而低Q副本,其特征在于低多样性的粒子,用于更有效地采样的局部盆地。将该算法与标准高斯群量子粒子优化算法(GSQPO)和q-高斯群量子粒子优化算法(q-GSQPO)进行了比较,发现新算法在适应度函数调用次数方面具有更强的鲁棒性,在收敛到全局最小值的能力方面具有更高的效率.此外,我们还提供了一种在不同q值之间优化分配群副本的方法。我们的算法进行了测试的三个基准函数,这是已知的多峰问题,在不同的维度。此外,我们考虑了一个聚丙氨酸肽的12个残基建模使用Gōcoarse-graining势能函数。

英文摘要:

We present a newly developed Replica Exchange algorithm using q -Gaussian Swarm Quantum Particle Optimization (REX@q-GSQPO) method for solving the problem of finding the global optimum. The basis of the algorithm is to run multiple copies of independent swarms at different values of q parameter. Based on an energy criterion, chosen to satisfy the detailed balance, we are swapping the particle coordinates of neighboring swarms at regular iteration intervals. The swarm replicas with high q values are characterized by high diversity of particles allowing escaping local minima faster, while the low q replicas, characterized by low diversity of particles, are used to sample more efficiently the local basins. We compare the new algorithm with the standard Gaussian Swarm Quantum Particle Optimization (GSQPO) and q-Gaussian Swarm Quantum Particle Optimization (q-GSQPO) algorithms, and we found that the new algorithm is more robust in terms of the number of fitness function calls, and more efficient in terms ability convergence to the global minimum. In additional, we also provide a method of optimally allocating the swarm replicas among different q values. Our algorithm is tested for three benchmark functions, which are known to be multimodal problems, at different dimensionalities. In addition, we considered a polyalanine peptide of 12 residues modeled using a Gō coarse-graining potential energy function.

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

↑