Julien Amblard
ABSTRACT
GPStar4 is a flexible workbench for experimenting with population algorithms. It is a framework that defines a genetic cycle, with inflection points for implementing an algorithm's specific behaviors; it also provides a variety of implementations for these inflection points. A user of the system can select from the provided implementations and customize the places where alternative behavior is desired, or even create their own implementations. Components interact through a context mechanism that enables both mutable and immutable information sharing, type checking, computed defaults and event listeners.
Interesting predefined components included in GPStar4 are implementations for classical tree-based expression structures; acyclic multigraphs with named ports, type systems for flat, hierarchical and attribute types, recursively defined populations using both subpopulation and build-from-parts semantics, and numeric and multi-objective fitnesses. Key enabling technologies for this flexibility include context mechanisms, choosers, and a variety of caches.
GPStar4 can be run as an API library for other applications, as a command-line application, or as a stand-alone application with its own GUI.
- 2023. MLStar: A System for Synthesis of Machine-Learning Programs. Presented at GECCO --- Workshop Evolutionary Computation for the Automated Design of Algorithms. Google Scholar
Digital Library
- Edmund Burke, Steven Gustafson, Graham Kendall, and Natalio Krasnogor. 2002. Advanced population diversity measures in genetic programming. In Parallel Problem Solving from Nature---PPSN VII: 7th International Conference Granada, Spain, September 7--11, 2002 Proceedings 7. Springer, 341--350.Google ScholarCross Ref
- Edmund K Burke, Steven Gustafson, and Graham Kendall. 2004. Diversity in genetic programming: An analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation 8, 1 (2004), 47--62.Google ScholarDigital Library
- Garett Dworman, Steven O Kimbrough, and James D Laing. 1995. On automated discovery of models using genetic programming in game-theoretic contexts. In Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, Vol. 3. IEEE, 428--438.Google Scholar
- John Ellson, Emden R Gansner, Eleftherios Koutsofios, Stephen C North, and Gordon Woodhull. 2004. Graphviz and dynagraph---static and dynamic graph drawing tools. Graph drawing software (2004), 127--148.Google Scholar
- Félix-Antoine Fortin, François-Michel De Rainville, Marc-André Gardner Gardner, Marc Parizeau, and Christian Gagné. 2012. DEAP: Evolutionary algorithms made easy. The Journal of Machine Learning Research 13, 1 (2012), 2171--2175.Google ScholarDigital Library
- Wojciech Jaśkowski, Krzysztof Krawiec, and Bartosz Wieloch. 2008. Fitness-less coevolution. In Proceedings of the 10th annual conference on Genetic and evolutionary computation. 355--362.Google ScholarDigital Library
- Sourabh Katoch, Sumit Singh Chauhan, and Vijay Kumar. 2021. A review on genetic algorithm: past, present, and future. Multimedia Tools and Applications 80 (2021), 8091--8126.Google ScholarDigital Library
- Sean Luke. 2017. ECJ then and now. In Proceedings of the genetic and evolutionary computation conference companion. 1223--1230.Google ScholarDigital Library
- Robert I McKay, Nguyen Xuan Hoai, Peter Alexander Whigham, Yin Shan, and Michael O'neill. 2010. Grammar-based genetic programming: a survey. Genetic Programming and Evolvable Machines 11 (2010), 365--396.Google ScholarDigital Library
- David J. Montana. 1995. Strongly Typed Genetic Programming. Evolutionary Computation 3, 2 (06 1995), 199--230. arXiv:https://direct.mit.edu/evco/article-pdf/3/2/199/1492842/evco.1995.3.2.199.pdf Google ScholarDigital Library
- Michael O'Neill. 2009. Riccardo Poli, William B. Langdon, Nicholas F. McPhee: A Field Guide to Genetic Programming: Lulu. com, 2008, 250 pp, ISBN 978-1-4092-0073-4.Google Scholar
- Alan J Perlis. 1982. Special feature: Epigrams on programming. ACM Sigplan Notices 17, 9 (1982), 7--13.Google ScholarDigital Library
- Moshe Sipper, Tomer Halperin, Itai Tzruia, and Achiya Elyasaf. 2023. EC-KitY: Evolutionary computation tool kit in Python with seamless machine learning integration. SoftwareX 22 (2023), 101381.Google ScholarCross Ref
- Léo Françoso DP Sotto, Paul Kaufmann, Timothy Atkinson, Roman Kalkreuth, and Márcio Porto Basgalupp. 2020. A study on graph representations for genetic programming. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference. 931--939.Google ScholarDigital Library
- Hisashi Tamaki, Hajime Kita, and Shigenobu Kobayashi. 1996. Multi-objective optimization by genetic algorithms: A review. In Proceedings of IEEE international conference on evolutionary computation. IEEE, 517--522.Google ScholarCross Ref
- Andrew James Turner and Julian Francis Miller. 2014. Recurrent cartesian genetic programming. In Parallel Problem Solving from Nature-PPSN XIII: 13th International Conference, Ljubljana, Slovenia, September 13--17, 2014. Proceedings 13. Springer, 476--486.Google Scholar
- Franz Wilhelmstötter. 2021. Jenetics. URL: http://jenetics.io (2021).Google Scholar
- William Wulf and Mary Shaw. 1973. Global variable considered harmful. ACM Sigplan notices 8, 2 (1973), 28--34.Google Scholar
Index Terms
- GPStar4: A flexible framework for experimenting with genetic programming
Recommendations
An Efficient Structural Diversity Technique for Genetic Programming
GECCO '15: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary ComputationGenetic diversity plays an important role in avoiding premature convergence, which is a phenomenon that stifles the search effectiveness of evolutionary algorithms. However, approaches that avoid premature convergence by maintaining genetic diversity ...
Inclusive Genetic Programming
Genetic ProgrammingAbstractThe promotion and maintenance of the population diversity in a Genetic Programming (GP) algorithm was proved to be an important part of the evolutionary process. Such diversity maintenance improves the exploration capabilities of the GP algorithm, ...
Fitness landscapes and problem hardness in genetic programming
GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking PapersThe performance of searching agents, or metaheuristics, like evolutionary algorithms (genetics algorithms, genetic programming, etc.) or local search algorithms (simulated annealing, tabu search, etc.) depend on some properties of the search space ...
Comments