Co-evolutionary modular neural networks for automatic problem decomposition

33Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to the full problem, can efficiently lead to compact and general solutions. Modular neural networks represent one of the ways in which this divide-and-conquer strategy can be implemented. Here we present a co-evolutionary model which is used to design and optimize modular neural networks with task-specific modules. The model consists of two populations. The first population consists of a pool of modules and the second population synthesizes complete systems by drawing elements from the pool of modules. Modules represent a part of the solution, which co-operates with others in the module population to form a complete solution. With the help of two artificial supervised learning tasks created by mixing two sub-tasks we demonstrate that if a particular task decomposition is better in terms of performance on the overall task, it can be evolved using this co-evolutionary model. © 2005 IEEE.

Cite

CITATION STYLE

APA

Khare, V. R., Yao, X., Sendhoff, B., Jin, Y., & Wersing, H. (2005). Co-evolutionary modular neural networks for automatic problem decomposition. In 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings (Vol. 3, pp. 2691–2698). https://doi.org/10.1109/cec.2005.1555032

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free