P-Tree programming

We propose a novel method for automatic program synthesis. P-Tree Programming represents the program search space through a single probabilistic prototype tree. From this prototype tree we form program instances which we evaluate on a given problem. The error values from the evaluations are propagat...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SSCI : 2017 IEEE Symposium Series on Computational Intelligence : November 27, 2017-December 1, 2017 s. 1 - 7
Hlavní autor: Oesch, Christian
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2017
Témata:
Benchmark testing
Open area test sites
Probability distribution
Programming
Prototypes
Sociology
Statistics
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a novel method for automatic program synthesis. P-Tree Programming represents the program search space through a single probabilistic prototype tree. From this prototype tree we form program instances which we evaluate on a given problem. The error values from the evaluations are propagated through the prototype tree. We use them to update the probability distributions that determine the symbol choices of further instances. The iterative method is applied to several symbolic regression benchmarks from the literature. It outperforms standard Genetic Programming to a large extent. Furthermore, it relies on a concise set of parameters which are held constant for all problems. The algorithm can be employed for most of the typical computational intelligence tasks such as classification, automatic program induction, and symbolic regression.
DOI:10.1109/SSCI.2017.8280849