Incorporation family competition into Gaussian and Cauchy mutations to training neural networks using an evolutionary algorithm

Jinn-Moon Yang, Jorng Tzong Horng, Cheng Yen Kao

Research output: Contribution to conferencePaperpeer-review

Abstract

The paper presents an evolutionary technique to train neural networks in tasks requiring learning behavior. Based on family competition principles and adaptive rules, the proposed approach integrates decreasing-based mutations and self-adaptive mutations. Different mutations act global and local strategies separately to balance the trade-off between solution quality and convergence speed. The algorithm proposed herein is applied to two different task domains: Boolean functions and artificial ant problem. Experimental results indicate that in all tested problems, the proposed algorithm performs better than other canonical evolutionary algorithms, such as genetic algorithms, evolution strategies, and evolutionary programming. Moreover, essential components such as mutation operators and adaptive rules in the proposed algorithm are thoroughly analyzed.

Original languageEnglish
Pages1994-2001
Number of pages8
DOIs
StatePublished - 1 Jan 1999
Event1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States
Duration: 6 Jul 19999 Jul 1999

Conference

Conference1999 Congress on Evolutionary Computation, CEC 1999
CountryUnited States
CityWashington, DC
Period6/07/999/07/99

Fingerprint Dive into the research topics of 'Incorporation family competition into Gaussian and Cauchy mutations to training neural networks using an evolutionary algorithm'. Together they form a unique fingerprint.

Cite this