4 ms·
The main point of the paper is that you should account for the structure of the solution space, and take advantage of that. For SR, one example is a+b = b+a. Fo
by verdverm 7y ago
The main point of the paper is that you should account for the structure of the solution space, and take advantage of that. For SR, one example is a+b = b+a. For physical objects, like antenna, that would be symmetries along axes. PGE can be generalized to any problem which can represent their solution space as a trie representation and a grammar for local modifications or movements in the search space.
With regard to PRNG, GP can only produce statistically significant results if run a minimum number of times, because it is a probabilistic algorithm. My stats professor said that was at least 29 times. If you fix the random seed, you lose the power of the GP algo.
It's hard to trust results from GP research as the vast majority is not reproducible. There is one guy who publishes the world best results to Springer anytime someone out performs his results. Totally bogus work. The GP field needs to adopt the publishing and open code / data that we find in the DL/RL community.
- nestorD 7y agoGP can take the structure of the space into account (you just need to take it into account into your mutation and crossover functions) and algorithms are typically compared on enough runs to provide statistically significant results (29 runs might be far from enough if you have high variance...) but you don't need reproducibility when solving an optimisation problem in the real world, you just want to get a good result in a reasonable time. The fact that you can use GP to optimize about anything (both parameters and structures) makes it a good first approach (where it fails is that it tends to be slow and have way too much parameters for a casual user). (I did think that your paper is interesting in that it invites us to think about non-GP based approach to symbolic regression)