<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>schristoph.online</title><link>https://schristoph.online/tags/evolutionaryalgorithms/</link><description>Personal homepage and blog of Stefan Christoph</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><copyright>Stefan Christoph. All rights reserved.</copyright><lastBuildDate>Thu, 22 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://schristoph.online/tags/evolutionaryalgorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>Your Agent Needs to Remember What Passed</title><link>https://schristoph.online/blog/your-agent-needs-to-remember/?utm=rss-feed</link><pubDate>Thu, 22 Oct 2026 00:00:00 +0000</pubDate><guid>https://schristoph.online/blog/your-agent-needs-to-remember/</guid><description>&lt;div class="tldr" data-pagefind-weight="5" data-pagefind-meta="tldr" style="display:block;font-size:.875em;margin:2rem 0;border-left:4px solid #ccc;padding-left:1rem;line-height:1.5;"&gt;&lt;strong&gt;TL;DR:&lt;/strong&gt; Ten pieces, 1% odds each. Guess all ten at once and you need about 10^20 tries. Keep each piece a check confirms and you need about 1,000. In agent loops, the model raises the odds that a change is useful, and a verifier plus a memory of accepted changes turns those odds into progress. The numbers come from a toy model with independent pieces, fixed odds, a check that spots every real improvement, and kept pieces that later changes don&amp;rsquo;t break. Real tasks bend those assumptions, so build the verifier first.&lt;/div&gt;
&lt;p&gt;The two previous posts in this series looked at the checking side of an agent loop. Generate-and-Verify [2] paired an expensive guess with a cheap, trustworthy check. Self-Consistency [3] repeated a guess and took a vote. Neither post looked closely at what the loop keeps between attempts. This post does.&lt;/p&gt;</description></item></channel></rss>