<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Self-Improving Agents on AIBussin — AI applications, systems and books</title><link>https://aibussin.com/tags/self-improving-agents/</link><description>Recent content in Self-Improving Agents on AIBussin — AI applications, systems and books</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Mon, 23 Jun 2025 11:10:59 +0100</lastBuildDate><atom:link href="https://aibussin.com/tags/self-improving-agents/index.xml" rel="self" type="application/rss+xml"/><item><title>Thoughts of Algorithms</title><link>https://aibussin.com/post/thoughts/</link><pubDate>Mon, 23 Jun 2025 11:10:59 +0100</pubDate><guid>https://aibussin.com/post/thoughts/</guid><description>&lt;blockquote&gt;&#10;&lt;p&gt;How a self-evolving AI learns to reflect, score, and rewrite its own reasoning&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;h2 id="-summary"&gt;🧪 Summary&lt;/h2&gt;&#10;&lt;p&gt;What if an AI could think not just solve problems, but reevaluate its beliefs in the face of new information?&lt;/p&gt;&#10;&lt;p&gt;In this post, we introduce a system that does exactly that. At the core of our pipeline is a lightweight scoring model called MR.Q, responsible for evaluating ideas and choosing the best ones. But when it encounters a new domain, a new goal, or a shift in task format, it doesn’t freeze it adapts.&lt;/p&gt;</description></item><item><title>Learning to Learn: A LATS-Based Framework for Self-Aware AI Pipelines</title><link>https://aibussin.com/post/lats/</link><pubDate>Thu, 12 Jun 2025 09:23:46 +0100</pubDate><guid>https://aibussin.com/post/lats/</guid><description>&lt;h2 id="-summary"&gt;📖 Summary&lt;/h2&gt;&#10;&lt;p&gt;In this post, we introduce the LATSAgent, an implementation of &lt;a href="https://arxiv.org/pdf/2310.04406" target="_blank" class="paper-badge"&#10; style="display: inline-block; padding: 6px 10px; background: #f3f4f6; border-left: 4px solid #3b82f6; border-radius: 4px; margin: 4px 0; text-decoration: none; color: #1f2937;"&gt;&#10; &lt;strong&gt;LATS&lt;/strong&gt;: Language Agent Tree Search Unifies Reasoning..&#10;&lt;/a&gt; within the &lt;a href="https://github.com/ernanhughes/co-ai"&gt;stephanie&lt;/a&gt; framework. Unlike prior agents that followed a single reasoning chain, this agent explores multiple reasoning paths in parallel, evaluates them using multidimensional scoring, and learns symbolic refinements over time. This is our most complete integration yet of search, simulation, scoring, and symbolic tuning bringing together all of our previous work on sharpening, pipeline reflection, and symbolic rules into a unified, intelligent reasoning loop.&lt;/p&gt;</description></item><item><title>Programming Intelligence: Using Symbolic Rules to Steer and Evolve AI</title><link>https://aibussin.com/post/symbolic/</link><pubDate>Wed, 04 Jun 2025 20:57:20 +0100</pubDate><guid>https://aibussin.com/post/symbolic/</guid><description>&lt;h2 id="-summary"&gt;🧪 Summary&lt;/h2&gt;&#10;&lt;p&gt;&amp;ldquo;What if AI systems could learn how to improve themselves not just at the level of weights or prompts, but at the level of strategy itself? In this post, we show how to build such a system, powered by symbolic rules and reflection.&lt;/p&gt;&#10;&lt;p&gt;The paper &lt;a href="https://arxiv.org/pdf/2406.18532v1" target="_blank" class="paper-badge"&#10; style="display: inline-block; padding: 6px 10px; background: #f3f4f6; border-left: 4px solid #3b82f6; border-radius: 4px; margin: 4px 0; text-decoration: none; color: #1f2937;"&gt;&#10; &lt;strong&gt;Symbolic Agents&lt;/strong&gt;: Symbolic Learning Enables Self-Evolving Agents&#10;&lt;/a&gt; introduces a framework where &lt;strong&gt;symbolic rules&lt;/strong&gt; guide, evaluate, and evolve agent behavior.&lt;/p&gt;</description></item><item><title>Adaptive Reasoning with ARM: Teaching AI the Right Way to Think</title><link>https://aibussin.com/post/arm/</link><pubDate>Wed, 28 May 2025 22:22:46 +0100</pubDate><guid>https://aibussin.com/post/arm/</guid><description>&lt;h2 id="summary"&gt;Summary&lt;/h2&gt;&#10;&lt;p&gt;Chain-of-thought is powerful, but which chain? Short explanations work for easy tasks, long reflections help on hard ones, and code sometimes beats them both. What if your model could adaptively pick the best strategy, per task, and improve as it learns?&lt;/p&gt;&#10;&lt;p&gt;The &lt;code&gt;Adaptive Reasoning Model&lt;/code&gt; &lt;strong&gt;(ARM)&lt;/strong&gt; is a framework for teaching language models how to choose the right reasoning format direct answers, chain-of-thoughts, or code depending on the task. It works by evaluating responses, scoring them based on rarity, conciseness, and difficulty alignment, and then updating model behavior over time.&lt;/p&gt;</description></item><item><title>General Reasoner: The smarter Local Agent</title><link>https://aibussin.com/post/general/</link><pubDate>Thu, 22 May 2025 21:41:54 +0100</pubDate><guid>https://aibussin.com/post/general/</guid><description>&lt;h2 id="-summary"&gt;🔧 Summary&lt;/h2&gt;&#10;&lt;p&gt;The &lt;a href="https://arxiv.org/abs/2505.14652"&gt;General Reasoner&lt;/a&gt; paper shows how we can train LLMs to reason across domains using diverse data and a generative verifier. In this post, I walk through our open-source implementation showing how we built a modular reasoning agent capable of generating multiple hypotheses, evaluating them with an LLM-based judge, and selecting the best answer.&lt;/p&gt;&#10;&lt;hr&gt;&#10;&lt;h2 id="-what-we-built"&gt;🧠 What We Built&lt;/h2&gt;&#10;&lt;p&gt;We built a &lt;code&gt;GeneralReasonerAgent&lt;/code&gt; that:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Dynamically generates multiple hypotheses using different &lt;strong&gt;reasoning strategies&lt;/strong&gt; (e.g., &lt;code&gt;cot&lt;/code&gt;, &lt;code&gt;debate&lt;/code&gt;, &lt;code&gt;verify_then_answer&lt;/code&gt;, etc.)&lt;/li&gt;&#10;&lt;li&gt;Evaluates each pair of hypotheses using either a &lt;strong&gt;local LLM judge&lt;/strong&gt; or our custom &lt;strong&gt;MR.Q evaluator&lt;/strong&gt;&lt;/li&gt;&#10;&lt;li&gt;Classifies the winning hypothesis using &lt;strong&gt;rubric dimensions&lt;/strong&gt;&lt;/li&gt;&#10;&lt;li&gt;Logs structured results to a PostgreSQL-backed system&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;All of this was integrated with our existing stephanie framework, which includes:&lt;/p&gt;</description></item></channel></rss>