pypge

Yup, methods and reproducibility as you have also mentioned. My work focused on Symbolic Regression, the problem, which I tried to separate from Genetic Programming, the algorithm. The literature refers to SR as the algorithm, but I think that is incorrect. I wrote a deterministic algorithm Prioritized Grammar Enumeration and put my code & data on github. https://github.com/verdverm/pypge (pdf there too, don't tell ACM)

Super interesting. Sounds like the algo I created Prioritized Grammar Enumeration. https://seminars.math.binghamton.edu/ComboSem/worm-chiu.pge_... PGE is essentially a BFS/DFS traversal of the space of all formulas, by using local enumeration of the AST. The biggest gains where from eliminating duplicate work (commutativity / associativity) and not going down bad branches (too much complexity added for no meaningful change to output). A lot of overlap in ideas here, and a lot of open research questions that could be worked on (like can use use RL to help guide the search like A*). There's definitely an exponential explosion or wall as the AST gets wider / deeper. At one point I wrote the core algorithm in Haskell, which made it so much more concise and beautiful, but eventually landed on python https://github.com/verdverm/pypge In all of

The Science paper launched my PhD topic. I asked a professor what they did for research, they listed a bunch of boring things... saw that and then asked "Did you see that talk about evolving equations? Do you want to work on that?" I was like hell yes! (Hod gave a talk at our uni about all his research topics) I wrote a deterministic algorithm for SymReg that outperforms genetic programming. https://github.com/verdverm/pypge

Code for the curious: https://github.com/verdverm/pypge

SymPy was instrumental to my PhD implementation, mainly for simplifying math expressions. Nothing was even close at the time https://github.com/verdverm/pypge

I'll do you one better https://github.com/verdverm/pypge https://github.com/verdverm/go-pge/blob/master/pge_gecco2013... The reviews had awesome and encouraging comments

Add RL or graph encoders to https://github.com/verdverm/pypge DM (email) me if you want to learn more

generally speaking, yes. I work a lot in DX / dev productivity - https://github.com/verdverm/pypge (algo I wrote, works like dijkstra's) - https://github.com/hofstadter-io/cuetorials.com/blob/main/co... (I hang around Cue online) - https://github.com/hofstadter-io/hof (the main thing I work on)

Have a look at Prioritized Grammar Enumeration. It's a deterministic algo for recovering diffeqs from time series. Or math formulas from data... Or a search across models represented by a trie https://github.com/verdverm/go-pge/raw/master/pge_gecco2013.... https://github.com/verdverm/pypge

really glad for SymPy, used it in my PhD work: https://github.com/verdverm/pypge

Prioritized Grammar Enumeration is a more efficient algo that Evo algo for Symbolic Regression. Code and papers https://github.com/verdverm/go-pge https://github.com/verdverm/pypge

I agree! I spent a few years with Genetic Programming for Symbolic Regression. After understanding the nature of the problem, I came up with a dynamic programming based heuristic that beats the pants off of GP. I called it Prioritized Grammar Enumeration. http://github.com/verdverm/pypge http://www.math.binghamton.edu/dept/ComboSem/worm-chiu.pge_g...