TinyverseGP: Towards a Modular Cross-domain Benchmarking Framework for Genetic Programming
TinyverseGP: Towards a Modular Cross-domain Benchmarking Framework for Genetic Programming
Over the years, genetic programming (GP) has evolved, with many proposed variations, especially in how they represent a solution. Being essentially a program synthesis algorithm, it is capable of tackling multiple problem domains. Current benchmarking initiatives are fragmented, as the different representations are not compared with each other and their performance is not measured across the different domains. In this work, we propose a unified framework, dubbed TinyverseGP (inspired by tinyGP), which provides support to multiple representations and problem domains, including symbolic regression, logic synthesis and policy search.
Roman Kalkreuth、Fabricio Olivetti de Fran?a、Julian Dierkes、Marie Anastacio、Anja Jankovic、Zdenek Vasicek、Holger Hoos
计算技术、计算机技术
Roman Kalkreuth,Fabricio Olivetti de Fran?a,Julian Dierkes,Marie Anastacio,Anja Jankovic,Zdenek Vasicek,Holger Hoos.TinyverseGP: Towards a Modular Cross-domain Benchmarking Framework for Genetic Programming[EB/OL].(2025-04-14)[2025-05-09].https://arxiv.org/abs/2504.10253.点此复制
评论