<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Evolving Code with A Large Language Model · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2401.07102/</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/2401.07102/feed.xml" rel="self" type="application/rss+xml" /><item><title>Evolving Code with A Large Language Model — mentioned by _delirium</title><link>https://news.ycombinator.com/item?id=43990561</link><guid isPermaLink="false">urn:hackerpapers:mention:2401.07102:43990561</guid><pubDate>Thu, 15 May 2025 00:19:51 GMT</pubDate><description>&lt;p&gt;Genetic programming systems have periodically made improvements to algorithms (dating back decades). Whether LLM-powered GP, which is effectively what this is, will be a step change or an evolution of that is still an open question I think. I&amp;#x27;m also a little wary of reading too much into the recursive self-improvement idea, because &amp;quot;the GP system can use GP to improve the GP system itself!&amp;quot; is a very old idea that just has never worked, although I realize that isn&amp;#x27;t proof that it won&amp;#x27;t eventually work. Some related work from a different company: https://sakana.ai/ai-cuda-engineer/ And some…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2401.07102/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Evolving Code with A Large Language Model — mentioned by dimatura</title><link>https://news.ycombinator.com/item?id=43608521</link><guid isPermaLink="false">urn:hackerpapers:mention:2401.07102:43608521</guid><pubDate>Mon, 07 Apr 2025 06:46:14 GMT</pubDate><description>&lt;p&gt;Note that genetic programming is a specific subset of genetic algorithms that focuses on searching for &amp;quot;programs&amp;quot; (hence the name), typically encoded in the form of a tree structure similar to an AST, though other representations exist. In theory, you could use GP for almost any situation where you&amp;#x27;d want to synthesize a mathematical expression or piece of code for which you have a criteria to optimize (i.e. &amp;quot;fitness&amp;quot;). In practice, since GPs are basically just semi-randomly searching a huge combinatorial space, they tend to work best in low-dimensional problems, ideally with a fitness…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2401.07102/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
