A Bayesian interpretation of the particle swarm optimization and its kernel extension

PLoS One. 2012;7(11):e48710. doi: 10.1371/journal.pone.0048710. Epub 2012 Nov 7.

Abstract

Particle swarm optimization is a popular method for solving difficult optimization problems. There have been attempts to formulate the method in formal probabilistic or stochastic terms (e.g. bare bones particle swarm) with the aim to achieve more generality and explain the practical behavior of the method. Here we present a Bayesian interpretation of the particle swarm optimization. This interpretation provides a formal framework for incorporation of prior knowledge about the problem that is being solved. Furthermore, it also allows to extend the particle optimization method through the use of kernel functions that represent the intermediary transformation of the data into a different space where the optimization problem is expected to be easier to be resolved-such transformation can be seen as a form of prior knowledge about the nature of the optimization problem. We derive from the general Bayesian formulation the commonly used particle swarm methods as particular cases.

MeSH terms

  • Algorithms*
  • Bayes Theorem
  • Models, Theoretical
  • Problem Solving

Grants and funding

There was no specific funding provided for this research beyond the support from the School of Computing Science of Newcastle University. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.