Reinforced Linear Genetic Programming
Not on the map. Why?
Abstract (arXiv)
Linear Genetic Programming (LGP) is a powerful technique that allows for a variety of problems to be solved using a linear representation of programs. However, there still exists some limitations to the technique, such as the need for humans to explicitly map registers to actions. This thesis proposes a novel approach that uses Q-Learning on top of LGP, Reinforced Linear Genetic Programming (RLGP) to learn the optimal register-action assignments. In doing so, we introduce a new framework "linear-gp" written in memory-safe Rust that allows for extensive experimentation for future works.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 10 references that are in the map. First posted on arXiv 7 Jan 2026.
Builds on
2 of 10 references.
References · 2
Built on by
Not cited yet.