<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2507.19457/</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/2507.19457/feed.xml" rel="self" type="application/rss+xml" /><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=48902227</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.19457:48902227</guid><pubDate>Tue, 14 Jul 2026 04:13:02 GMT</pubDate><description>&lt;p&gt;GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — mentioned by LakshyAAAgrawal</title><link>https://news.ycombinator.com/item?id=47108521</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.19457:47108521</guid><pubDate>Sun, 22 Feb 2026 05:37:27 GMT</pubDate><description>&lt;p&gt;We built optimize_anything, an API that optimizes any artifact representable as text — code, prompts, agent architectures, configs, even SVGs. It extends GEPA (our prompt optimizer, discussed here previously: https://arxiv.org/abs/2507.19457) far beyond prompts. The API is deliberately minimal. You provide what to optimize and how to measure it: import gepa.optimize_anything as oa def evaluate(candidate: str) -&amp;gt; tuple[float, dict]: result = run_my_system(candidate) return result.score, {&amp;quot;error&amp;quot;: result.stderr, &amp;quot;runtime&amp;quot;: f&amp;quot;{result.time_ms}ms&amp;quot;} result = oa.optimize_anything…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=47083674</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.19457:47083674</guid><pubDate>Fri, 20 Feb 2026 04:19:04 GMT</pubDate><description>&lt;p&gt;Show HN: Optimize_anything: A Universal API for Optimizing Any Text Parameter&lt;/p&gt;&lt;p&gt;We built optimize_anything, an API that optimizes any artifact representable as text — code, prompts, agent architectures, configs, even SVGs. It extends GEPA (our prompt optimizer, discussed here previously: https://arxiv.org/abs/2507.19457) far beyond prompts. The API is deliberately minimal. You provide what to optimize and how to measure it: import gepa.optimize_anything as oa def evaluate(candidate: str) -&amp;gt; tuple[float, dict]: result = run_my_system(candidate) return result.score, {&amp;quot;error&amp;quot;: result.stderr, &amp;quot;runtime&amp;quot;: f&amp;quot;{result.time_ms}ms&amp;quot;} result = oa.optimize_anything…&lt;/p&gt;&lt;p&gt;8 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — mentioned by JoshPurtell</title><link>https://news.ycombinator.com/item?id=46879951</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.19457:46879951</guid><pubDate>Wed, 04 Feb 2026 01:03:15 GMT</pubDate><description>&lt;p&gt;For devtools cos providing skills - we&amp;#x27;ve found that using GEPA where you optimize the skill content instead of the prompt works really well to make sure the skill actually gets claude code/ codex /opencode to successfully use your service. https://arxiv.org/abs/2507.19457 More here if interesting https://www.usesynth.ai/blog/environment-pools-managed-agent...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — mentioned by deepsquirrelnet</title><link>https://news.ycombinator.com/item?id=45637334</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.19457:45637334</guid><pubDate>Sun, 19 Oct 2025 19:48:45 GMT</pubDate><description>&lt;p&gt;Absolutely the first thing you should try is a prompt optimizer. The GEPA optimizer (implemented in DSPy) often outperforms GRPO training[1]. But I think people are usually building with frameworks that aren&amp;#x27;t machine learning frameworks. [1] https://arxiv.org/abs/2507.19457&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — mentioned by Weaver_zhu</title><link>https://news.ycombinator.com/item?id=45613175</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.19457:45613175</guid><pubDate>Fri, 17 Oct 2025 03:51:54 GMT</pubDate><description>&lt;p&gt;I recall recent work [ACE](https://www.arxiv.org/abs/2510.04618) and [GEPA](https://arxiv.org/abs/2507.19457) where models get improved by adapting and adopting different kinds of prompt. The improvements will be expected to be more generalized than fine-tuning.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — mentioned by tlarkworthy</title><link>https://news.ycombinator.com/item?id=44885139</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.19457:44885139</guid><pubDate>Wed, 13 Aug 2025 06:14:02 GMT</pubDate><description>&lt;p&gt;Recently tried out the new GEPA algorithm for prompt evolution with great results. I think using LLMs to write their own prompt and analyze their trajectories is pretty neat once appropriate guardrails are in place https://arxiv.org/abs/2507.19457 https://observablehq.com/@tomlarkworthy/gepa I guess GEPA is still preprint and before this survey but I recommend taking a look due to it&amp;#x27;s simplicity&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=44707356</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.19457:44707356</guid><pubDate>Mon, 28 Jul 2025 05:02:00 GMT</pubDate><description>&lt;p&gt;GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;8 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.19457/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
