When Do Heavy-Tail Distributions Help?
We examine the evidence for the widespread belief that heavy tail distributions enhance the search for minima on multimodal objective functions. We analyze isotropic and anisotropic heavy-tail Cauchy distributions and investigate the probability to sample a better solution, depending on the step length and the dimensionality of the search space. The probability decreases fast with increasing step length for isotropic Cauchy distributions and moderate search space dimension. The anisotropic Cauchy distribution maintains a large probability for sampling large steps along the coordinate axes, resulting in an exceptionally good performance on the separable multimodal Rastrigin function. In contrast, on a non-separable rotated Rastrigin function or for the isotropic Cauchy distribution the performance difference to a Gaussian search distribution is negligible.
KeywordsEvolutionary Algorithm Success Probability Heavy Tail Cauchy Distribution Separable Function
Unable to display preview. Download preview PDF.
- 1.Frahm, G., Junker, M.: Generalized elliptical distributions: Models and estimation. Caesar preprint, IDL 0037 (2003)Google Scholar
- 3.Rechenberg, I.: Evolutionsstrategie 1994, Frommann-Holzboog, Stuttgart, Germany (1994)Google Scholar
- 7.Yao, X., Liu, Y.: Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 3, 82–102 (1997)Google Scholar