Using LLVM-based JIT Compilation in Genetic Programming
Michal Gregor, Juraj Spalek
TL;DR
This paper presents a novel approach to genetic programming by leveraging LLVM-based JIT compilation to improve execution speed of evolved programs, using a custom parser for C-like syntax trees.
Contribution
It introduces an LLVM-based JIT compilation method for genetic programming, enhancing execution efficiency over traditional interpretation methods.
Findings
LLVM JIT improves execution speed of evolved programs
Parser supports C-like syntax for tree construction
Comparison shows faster performance than previous implementation
Abstract
The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed.
Click any figure to enlarge with its caption.
Figure 1Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
See pages 1-last of jit_gp_paper.pdf