<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>GAAPO: Genetic Algorithmic Applied to Prompt Optimization · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2504.07157/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2504.07157/feed.xml" rel="self" type="application/rss+xml" /><item><title>GAAPO: Genetic Algorithmic Applied to Prompt Optimization — HN submission</title><link>https://news.ycombinator.com/item?id=44674067</link><guid isPermaLink="false">urn:hackerpapers:submission:2504.07157:44674067</guid><pubDate>Thu, 24 Jul 2025 18:11:20 GMT</pubDate><description>&lt;p&gt;GA and RL and prompt-driven agents&lt;/p&gt;&lt;p&gt;Hi HN, I’ve been thinking about a new idea and would love to hear your thoughts. I’m exploring the concept of an AI agent that improves itself using reinforcement learning (RL) policies. The goal is to create an agent that can assist with programming, requirements engineering, or similar tasks that can be driven by LLMs. One of the main challenges is that RL typically requires a finite set of actions, whereas prompts for LLMs can be arbitrarily complex or open-ended. To address this, I’m considering using a genetic algorithm (GA)-based approach, where a prompt is represented as a set of…&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2504.07157/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
