The original (Cornell University) Eureqa program could be run forever, and the program would keep searching for improved formulas at every level of complexity. I can understand why Data Robot wanted the runtime to be constrained. There is a Data Robot fine tuning parameter, EUREQA_max_generations, that I thought determined how long the program ran. But it appears that that is not the case. Even if I set that to a very large number, the program stops earlier. I'm attaching part of the log for a run that shows that there is some metric that is satisfied (hundred percent of the metric) for a particular complexity level. What is this metric? What determines how long the program runs? And how can I make it so that it will run longer and find more solutions for different levels of complexity?
Thanks, Richard
Solved! Go to Solution.
Hi Richard. This has generated a really interesting conversation internally. Here's what we are thinking...can I ask you to check the value of the timeout setting and increase it manually to something like 1000000. You can find the argument, EUREQA_timeout_sec, in the Advanced Tuning tab. To read up on it, see the in-app model docs (you need to be logged in) here . Then, can you report back whether the searching continues beyond the solution where you’re currently stuck?
Thanks....jen
Hi Richard. This has generated a really interesting conversation internally. Here's what we are thinking...can I ask you to check the value of the timeout setting and increase it manually to something like 1000000. You can find the argument, EUREQA_timeout_sec, in the Advanced Tuning tab. To read up on it, see the in-app model docs (you need to be logged in) here . Then, can you report back whether the searching continues beyond the solution where you’re currently stuck?
Thanks....jen
Yes, that did allow it to run longer and find more solutions. Thanks.