<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Symbolic Regression with Fast Function Extraction and Nonlinear Least Squares Optimization · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2209.09675/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2209.09675/feed.xml" rel="self" type="application/rss+xml" /><item><title>Symbolic Regression with Fast Function Extraction and Nonlinear Least Squares Optimization — mentioned by verdverm</title><link>https://news.ycombinator.com/item?id=40570480</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.09675:40570480</guid><pubDate>Tue, 04 Jun 2024 03:45:42 GMT</pubDate><description>&lt;p&gt;Some more recent alternatives to Koza&amp;#x27;s GP use some very different search mechanisms. FFX &amp;amp; PGE are both very fast. https://seminars.math.binghamton.edu/ComboSem/worm-chiu.pge_... https://arxiv.org/pdf/2209.09675 I authored PGE and have thought that RL, and more recently diffusion techniques, might help these algos. All of the algos need better ways to guide the search, or help it get unstuck from local optima, which happens surprisingly fast. Most work in GP / EVO is about avoiding premature convergence.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.09675/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
