The invalidation of pysr under some constraint conditions #743
Unanswered
jackeuylov
asked this question in
Q&A
Replies: 1 comment 2 replies
-
|
This is going to be so so so easy once 1.0 drops. This kind of feature is built-in! 1.0.0 should drop this or next week. but until then, what is your current approach? Is it a custom loss function? |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Hi Miles @MilesCranmer


In my work, I need to lock the equation y1 = f( k1, k2,... ) * x1 + g( k1, k2,... ) * x2, (x, y, k are all variables) , and need to balance the dimension, and limit the appearance of constants. Under these constraints, pysr unexpectedly fails : it cannot grow a reliable expression tree, but stays at the root node.
I have tried to increase randomness and increase the number of populations, but all failed. As shown in the picture, the final result has only a very simple expression.
But miraculously, when I reverse the problem, that is, x1 = f ( k1, k2,... ) * y1 + g ( k1, k2,... ) * y2, pysr can grow normally and evolve a binary tree.
Do you have any clue about this ? I guess it is because the amount of information contained in x and y is different ?
Thanks!
Beta Was this translation helpful? Give feedback.
All reactions