Comment by saithound

5 days ago

PySR itself is still alright, mostly because of previous development. But not for long. Quality control has collapsed, and e.g. the examples in the repo are now embarrassing vibeslop.

Pangram reports 100% AI on most comment blurbs in the examples directory. That in itself is not the problem, AI-generated code could still be valid. But in this case, the AI-generated examples have the characteristic shape of slop: plausible sounding technical jargon, combined with zero actual understanding of either the target domain, or even evolutionary search (loss function design). They were vibed by people who had no idea what they were doing.

I suggest taking a look at the "evolved PRNG" example [1].

First, its loss function is basically designed to reward discovering linear feedback shift registers (LFSRs) only. It deliberately gives a massively lower loss to LFSRs than most other functions.

The AI slop phrased this in terms of "certifying the period", but the period certificate used only identifies LFSRs of max period, is unsound on the rest of the search space, and gives a meaningless very high loss to most non-LFSRs. So the regression will almost always just return an LFSR.

Whoever designed the example (Codex I suppose) also knew that most LFSRs are defective, and make poor random number generators. Thus, they included a "shear" penalty to detect such defective LFSRs, but of course they slopped it together.

The 360 correlations they measure should have been added together (having just one strong correlation is bad, and having two strong correlations is twice as bad as havin one). Instead, they take the MEAN of the correlations, so a perfect correlation contributes only 1/360=0.00278 to the loss.

And indeed, the result of their example run, reported in the docs [2] has such a perfect correlation: bit 29 is copied to bit 31 every two iterations.

[1] https://github.com/astroautomata/PySR/blob/master/examples/p...

[2] https://pysr.ai/v2.7.0/examples/objectives#inventing-a-pseud...

> by people who had no idea what they were doing.

I would personally hold this opinion of anyone still using genetic/evolutionary inspired algorithms for symbolic regression. There are multiple deterministic algorithms that do not have the same inherent drawbacks and are generally quite good.

Before I wrote my algo, and was trying to scale out GP, I hit the limits of RNG and had to go find some with seriously huge cycle properties. (howany calls before they reached the end and started over producing the same sequence)

  • Can you share more? I've only heard of genetic-based symbolic regression

    • I believe I wrote the second deterministic algorithm for SR

      - FFX (Fast Function eXtraction) was the year before or so.

      - PGE (Prioritized Grammar Enumeration) won best paper at GECCO 2013

      I go into the problems and causes in my paper: https://github.com/verdverm/go-pge/blob/master/pge_gecco2013...

      And took a stab at vibe coding with a tiny LLM to port it to JAX: https://github.com/verdverm/pge-jax I'll put some more effort (tokens) into this and get it added to SRBench.

      Fundamentally, most of GP based SR research fights issues with the algorithm (loss of diversity, equation bloat, premature convergence). I have not seen the field really adopt a new mentality in the 13 years since, not that I have been paying close attention, but I do look at the papers in GECCO GP track from time to time.

      2 replies →