By Topic

Adaptive particle swarm optimisation for high-dimensional highly convex search spaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tsou, D. ; Sch. of Comput. Sci. & Software Eng., Western Australia Univ., Crawley, WA, Australia ; MacNish, C.

The particle swarm optimisation (PSO) algorithm has been established as a useful global optimisation algorithm for multidimensional search spaces. A practical example is its success in training feed-forward neural networks. Such successes, however, must be judged relative to the complexity of the search space. We show that the effectiveness of the PSO algorithm breaks down when extended to high-dimensional "highly convex" search spaces, such as those found in training recurrent neural networks. A comparative study of backpropagation methods reveals the importance of an adaptive learning rate to their success. We briefly review the physics of the particle swarm optimiser, and use this view to introduce an analogous adaptive time step. Finally we demonstrate that the new adaptive algorithm shows improved performance on the recurrent network training problem.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:2 )

Date of Conference:

8-12 Dec. 2003