VanillaGP: Genetic Algorithm for Inductive Program Synthesis

Title

VanillaGP: Genetic Algorithm for Inductive Program Synthesis

 Author

Azimzade, Farhad (TU Delft Electrical Engineering, Mathematics and Computer Science)

Contributor

Dumančić, S. (mentor)
Poulsen, C.B. (graduation committee) ORCID 0000-0003-0622-7639

 Degree granting institution

Delft University of Technology

 Programme

Computer Science and Engineering

 Project

CSE3000 Research Project

 Date

2022-01-28

 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.

 Subject

Genetic Algorithm
Inductive Program Synthesis
Genetic programming

 To reference this document use:

http://resolver.tudelft.nl/uuid:ec996cab-aac4-4314-b291-8883965172d2

 Part of collection

Student theses

 Document type

bachelor thesis

 Rights

© 2022 Farhad Azimzade
Files
PDF VanillaGP.pdf 569.27 KB
Close viewer