使用修正式粒子群聚最佳化演算法訓練類神經網路之研究

Research on Artificial Neural Network Training Using Modified Particle Swarm Optimization

唐家麒(Jia-Ci Tang)

指導教授 ： 謝哲光

共同指導教授 ： 郭英勝(Ying-Sheng Kuo)

義守大學/電機資訊學院/電機工程學系/碩士(2017年)

摘要

本研究是以修正式粒子群聚最佳化演算法 (modified Particle Swarm Optimization) 訓練類神經網路進行機器學習。此修正式演算法將標準的粒子群聚最佳化演算法 (Particle Swarm Optimization, PSO) 與 Lévy Flight (常用於布穀鳥演算法, Cuckoo Search algorithm) 做適度的結合，透過修正粒子群聚最佳化演算法中的更新公式，使粒子在搜尋最佳解時不易陷入區域最佳解 (local minima) 而無法跳脫的缺陷，並且避免候選解有過早收斂 (premature convergence) 的問題。我們將以三個例題示範如何使用本研究所提出的演算法，並將比較所提出的演算法與標準的粒子群聚最佳化演算法之表現。本研究使用 Python 程式語言撰寫程式。

關鍵字

none

並列摘要

In this research, the modified particle swarm optimization algorithm will be applied to the training of artificial neural networks for machine learning problems. This modified algorithm appropriately combines the standard particle swarm optimization and Lévy flight (very often used in cuckoo search algorithm) in order to escape from the local minima of the cost surface and to avoid the premature convergence of the candidate solutions. Three numerical examples will be used to illustrate the use of our proposed algorithm. Some comparisons of the performances using proposed algorithm and the standard particle swarm optimization will be made. Our programs were written in Python language.

並列關鍵字

none

參考文獻

[1] https://www.cs.ccu.edu.tw/~ckting/ec.html

[2] https://zh.wikipedia.org/wiki/%E6%9C%BA%E5%99%A8%E5%AD%A6%E4

%B9%A0

[3] X.S. Yang and S. Deb., "Cuckoo search via Levy flights," in Proceedings of World Congress on Nature & Biologically Inspired Computing, India, IEEE publications, pp. 210-214, 2009.

[4] X.S. Yang and S. Deb., "Engineering optimization by cuckoo search," International Journal of Mathematical Modeling and Numerical Optimization, vol. 1, no. 4, pp. 330-343, 2010.