Multitask Evolution with Cartesian Genetic Programming

2017/02/07 by Eric O. Scott, Scott, Eric O., Kenneth De Jong +1
Computer Science · #Advanced Multi-Objective Optimization Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE)

paper · pdf · doi:10.48550/arxiv.1702.02217

openalex publication_date 2017/02/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce a genetic programming method for solving multiple Boolean circuit synthesis tasks simultaneously. This allows us to solve a set of elementary logic functions twice as easily as with a direct, single-task approach.

Citations

• PathNet: Evolution Channels Gradient Descent in Super Neural Networks

Related

• Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming
• Retaining Experience and Growing Solutions
• Evolving Constructions for Balanced, Highly Nonlinear Boolean Functions
• Obtaining Basic Algebra Formulas with Genetic Programming and Functional Rewriting
• Using Genetic Algorithm in the Evolutionary Design of Sequential Logic Circuits