VanillaGP: Genetic Algorithm for Inductive Program Synthesis

Bachelor thesis (2022)

Authors

F. Azimzade Electrical Engineering, Mathematics and Computer Science

Contributors

S. Dumančić Algorithmics - EEMCS (supervisor 1)
C.B. Poulsen Programming Languages - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Farhad Azimzade
More Info
expand_more

Published Date

28-01-2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Inductive Program Synthesis is the problem of generating programs from
a set of input-output examples. Since it can be reduced to the search problem in the space of programs, many search algorithms have been successfully
applied to it over the years. This paper proposes, develops, and analyses
a novel algorithm in the family of Genetic Algorithms, called VanillaGP.
While generally not showing superior performance compared to a recent
best-first Brute method on the subset of program synthesis tasks used in
the paper, VanillaGP does appear to reach a comparable relative improvement of the errors in the training data.

Files

VanillaGP.pdf
(.pdf | 0.556 Mb)