Running programs backwards: instruction inversion for effective search in semantic spaces

Authors:
Bartosz Wieloch;Krzysztof Krawiec
Affiliations:
Poznan University of Technology, Poznan, Poland;Poznan University of Technology, Poznan, Poland
Venue:
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 8
Cited 1

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Investigating the performance of module acquisition in cartesian genetic programming

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Solving the symbolic regression problem with tree-adjunct grammar guided genetic programming: the comparative results

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Genetic Programming Crossover: Does It Cross over?

EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Semantic Aware Crossover for Genetic Programming: The Case for Real-Valued Function Regression

EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Improving symbolic regression with interval arithmetic and linear scaling

EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Approximating geometric crossover by semantic backpropagation

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Approximating geometric crossover by semantic backpropagation

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The instructions used for solving typical genetic programming tasks have strong mathematical properties. In this study, we leverage one of such properties: invertibility. A search operator is proposed that performs an approximate reverse execution of program fragments, trying to determine in this way the desired semantics (partial outcome) at intermediate stages of program execution. The desired semantics determined in this way guides the choice of a subprogram that replaces the old program fragment. An extensive computational experiment on 20 symbolic regression and Boolean domain problems leads to statistically significant evidence that the proposed Random Desired Operator outperforms all typical combinations of conventional mutation and crossover operators.