<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Mixture of Agents on Programmer.ie: Modern AI programming</title>
    <link>http://programmer.ie/tags/mixture-of-agents/</link>
    <description>Recent content in Mixture of Agents on Programmer.ie: Modern AI programming</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 09 Aug 2026 10:53:00 +0100</lastBuildDate>
    <atom:link href="http://programmer.ie/tags/mixture-of-agents/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Advanced Agents From First Principles 16: Where Should an Agent Spend Its Compute? Build a Dynamic Budget Scheduler</title>
      <link>http://programmer.ie/post/advanced-agents-from-first-principles-16/</link>
      <pubDate>Sun, 09 Aug 2026 10:53:00 +0100</pubDate>
      <guid>http://programmer.ie/post/advanced-agents-from-first-principles-16/</guid>
      <description>&lt;h1 id=&#34;where-should-an-agent-spend-its-compute&#34;&gt;Where Should an Agent Spend Its Compute?&lt;/h1&gt;&#xA;&lt;p&gt;A production agent has a budget whether you designed one or not.&lt;/p&gt;&#xA;&lt;p&gt;Every model call costs something.&lt;/p&gt;&#xA;&lt;p&gt;Every search node costs something.&lt;/p&gt;&#xA;&lt;p&gt;Every tool invocation costs something.&lt;/p&gt;&#xA;&lt;p&gt;Every verifier costs something.&lt;/p&gt;&#xA;&lt;p&gt;Every retry adds latency.&lt;/p&gt;&#xA;&lt;p&gt;Every escalation to a stronger model spends money and time that could have been used somewhere else.&lt;/p&gt;&#xA;&lt;p&gt;The naive architecture gives every subsystem its own fixed limit:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;&#34;&gt;&lt;code class=&#34;language-python&#34; data-lang=&#34;python&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;MAX_STEPS &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;20&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;MAX_SEARCH_NODES &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;32&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;MAX_CRITIC_CALLS &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;3&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;MAX_RETRIES &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;4&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;MAX_VERIFIER_CALLS &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;2&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;That looks safe.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Advanced Agents From First Principles 11: Which Advanced Agent Architecture Should You Use? A Practical Selection Guide</title>
      <link>http://programmer.ie/post/advanced-agents-from-first-principles-11/</link>
      <pubDate>Sun, 09 Aug 2026 09:20:00 +0100</pubDate>
      <guid>http://programmer.ie/post/advanced-agents-from-first-principles-11/</guid>
      <description>&lt;h1 id=&#34;which-advanced-agent-architecture-should-you-use&#34;&gt;Which Advanced Agent Architecture Should You Use?&lt;/h1&gt;&#xA;&lt;p&gt;You now have too many options.&lt;/p&gt;&#xA;&lt;p&gt;That is a better problem than having none.&lt;/p&gt;&#xA;&lt;p&gt;But it is still a problem.&lt;/p&gt;&#xA;&lt;p&gt;You can add:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;self-consistency,&lt;/li&gt;&#xA;&lt;li&gt;Tree of Thoughts,&lt;/li&gt;&#xA;&lt;li&gt;beam search,&lt;/li&gt;&#xA;&lt;li&gt;Monte Carlo Tree Search,&lt;/li&gt;&#xA;&lt;li&gt;evolutionary search,&lt;/li&gt;&#xA;&lt;li&gt;specialist routing,&lt;/li&gt;&#xA;&lt;li&gt;planner/executor/critic separation,&lt;/li&gt;&#xA;&lt;li&gt;multi-agent debate,&lt;/li&gt;&#xA;&lt;li&gt;adaptive policies,&lt;/li&gt;&#xA;&lt;li&gt;learning from previous runs,&lt;/li&gt;&#xA;&lt;li&gt;or a mixture-of-agents runtime that chooses among several of them.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;The temptation is to combine everything.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Advanced Agents From First Principles 10: Are You Combining Every Agent Technique Into One Monster? Build a Mixture-of-Agents Runtime</title>
      <link>http://programmer.ie/post/advanced-agents-from-first-principles-10/</link>
      <pubDate>Sun, 09 Aug 2026 00:25:00 +0100</pubDate>
      <guid>http://programmer.ie/post/advanced-agents-from-first-principles-10/</guid>
      <description>&lt;p&gt;You have a working agent.&lt;/p&gt;&#xA;&lt;p&gt;Then you add retrieval.&lt;/p&gt;&#xA;&lt;p&gt;Then memory.&lt;/p&gt;&#xA;&lt;p&gt;Then Best-of-N.&lt;/p&gt;&#xA;&lt;p&gt;Then critique and revision.&lt;/p&gt;&#xA;&lt;p&gt;Then Tree of Thoughts.&lt;/p&gt;&#xA;&lt;p&gt;Then MCTS.&lt;/p&gt;&#xA;&lt;p&gt;Then specialist models.&lt;/p&gt;&#xA;&lt;p&gt;Then adversarial review.&lt;/p&gt;&#xA;&lt;p&gt;Then a planner, executor, critic and verifier.&lt;/p&gt;&#xA;&lt;p&gt;Then a stronger model for hard cases.&lt;/p&gt;&#xA;&lt;p&gt;Eventually the architecture starts to look like this:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;&#34;&gt;&lt;code class=&#34;language-text&#34; data-lang=&#34;text&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;request&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;planner&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;retrieval&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;reasoning&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Best-of-N&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;critic&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Tree of Thoughts&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;MCTS&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;frontier model&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;second critic&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;verifier&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Every mechanism may have been individually reasonable.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
