Paulo Santos
Alcides Fonseca
ABSTRACT
Evolutionary algorithms often have to balance local search with the evolutionary search. Restricting the language of individuals acts as local search inside a Genetic Programming (GP) approach. We propose the use of Refined Typed Genetic Programming, an enhanced hybrid of Strongly Typed Genetic Programming (STGP) and Grammar-Guided Genetic Programming (GGGP) that features an advanced type system with polymorphism and dependent refinements. This approach allows the end-user to express the restrictions on the search problem in the same language as the solution.
- Henning Christiansen. 1990. A survey of adaptable grammars. ACM SIGPLAN Notices 25, 11 (1990), 35--44.Google Scholar
Digital Library
- Tayfun Elmas, Serdar Tasiran, and Shaz Qadeer. 2005. Vyrd: verifying concurrent programs by runtime refinement-violation detection. ACM SIGPLAN Notices 40, 6 (2005), 27--37.Google ScholarDigital Library
- Ivo Gonçalves, Sara Silva, Joana B. Melo, and João M. B. Carreiras. 2012. Random Sampling Technique for Overfitting Control in Genetic Programming. In Proceedings of the 15th European Conference on Genetic Programming (EuroGP'12). Springer-Verlag, Berlin, Heidelberg, 218--229. Google ScholarDigital Library
- Krzysztof Krawiec. 2016. Behavioral Program Synthesis with Genetic Programming. Studies in Computational Intelligence, Vol. 618. Springer. Google ScholarCross Ref
- 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, 3-4 (2010), 365--396.Google ScholarDigital Library
- David J Montana. 1995. Strongly typed genetic programming. Evolutionary computation 3, 2 (1995), 199--230.Google Scholar
- Cyrus Omar, Ian Voysey, Ravi Chugh, and Matthew A Hammer. 2019. Live functional programming with typed holes. Proceedings of the ACM on Programming Languages 3, POPL (2019), 1--32.Google ScholarDigital Library
- Riccardo Poli, William B. Langdon, and Nicholas Freitag McPhee. 2008. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk. (With contributions by J. R. Koza).Google Scholar
- Conor Ryan, Miguel Nicolau, and Michael O'Neill. 2002. Genetic algorithms using grammatical evolution. In European Conference on Genetic Programming. Springer, 278--287.Google ScholarCross Ref
- John N Shutt. 1999. Recursive adaptable grammars. (1999).Google Scholar
- Niki Vazou, Eric L Seidel, Ranjit Jhala, Dimitrios Vytiniotis, and Simon Peyton-Jones. 2014. Refinement types for Haskell. In ACM SIGPLAN Notices, Vol. 49. ACM, 269--282.Google ScholarDigital Library
Index Terms
- Refined typed genetic programming as a user interface for genetic programming
Recommendations
The Usability Argument for Refinement Typed Genetic Programming
Parallel Problem Solving from Nature – PPSN XVIAbstractThe performance of Evolutionary Algorithms is frequently hindered by arbitrarily large search spaces. In order to overcome this challenge, domain-specific knowledge is often used to restrict the representation or evaluation of candidate solutions ...
Neural network crossover in genetic algorithms using genetic programming
AbstractThe use of genetic algorithms (GAs) to evolve neural network (NN) weights has risen in popularity in recent years, particularly when used together with gradient descent as a mutation operator. However, crossover operators are often omitted from ...
Genetic programming: a tutorial introduction
GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computationGenetic programming emerged in the early 1990's as one of the most exciting new evolutionary algorithm paradigms. It has rapidly grown into a thriving area of research and application. While sharing the evolutionary inspired algorithm principles of a ...
Comments