TinyverseGP: Towards a Modular Cross-domain Benchmarking Framework for Genetic Programming

April 14, 2025 ยท Declared Dead ยท ๐Ÿ› GECCO Companion

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Roman Kalkreuth, Fabricio Olivetti de Franรงa, Julian Dierkes, Marie Anastacio, Anja Jankovic, Zdenek Vasicek, Holger Hoos arXiv ID 2504.10253 Category cs.NE: Neural & Evolutionary Cross-listed cs.LG, cs.SC Citations 0 Venue GECCO Companion Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Neural & Evolutionary

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

LSTM: A Search Space Odyssey

Klaus Greff, Rupesh Kumar Srivastava, ... (+3 more)

cs.NE ๐Ÿ› IEEE TNNLS ๐Ÿ“š 6.0K cites 11 years ago

Died the same way โ€” ๐Ÿ‘ป Ghosted