<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Prompt Tuning on AIBussin — AI applications, systems and books</title>
		<link>https://aibussin.com/tags/prompt-tuning/</link>
		<description>Recent content in Prompt Tuning on AIBussin — AI applications, systems and books</description>
		<generator>Hugo</generator>
		<language>en-US</language>
		
		
		
		
			<lastBuildDate>Thu, 26 Jun 2025 13:31:41 +0100</lastBuildDate>
		
			<atom:link href="https://aibussin.com/tags/prompt-tuning/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Compiling Thought: Building a Prompt Compiler for Self-Improving AI</title>
				<link>https://aibussin.com/post/compiler/</link>
				<pubDate>Thu, 26 Jun 2025 13:31:41 +0100</pubDate>
				<guid>https://aibussin.com/post/compiler/</guid>
				<description>&lt;p&gt;&lt;strong&gt;How to design a pipeline that turns vague goals into smart prompts&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;h2 id=&#34;-summary&#34;&gt;🧪 Summary&lt;/h2&gt;&#xA;&lt;p&gt;Why spend hours engineering prompts when AI can optimize its own instructions. This blog post introduces a novel approach toward creating a self-improving AI by treating prompts as programs. Traditional AI systems often rely on static instructions rigid and limited in adaptability. Here, we present a different perspective: viewing the Large Language Model (LLM) as a &lt;strong&gt;prompt compiler&lt;/strong&gt; capable of dynamically transforming raw instructions into optimized prompts through iterative cycles of decomposition, evaluation, and intelligent reassembly.&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=&#34;-summary&#34;&gt;🔧 Summary&lt;/h2&gt;&#xA;&lt;p&gt;The &lt;a href=&#34;https://arxiv.org/abs/2505.14652&#34;&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;&#xA;&lt;hr&gt;&#xA;&lt;h2 id=&#34;-what-we-built&#34;&gt;🧠 What We Built&lt;/h2&gt;&#xA;&lt;p&gt;We built a &lt;code&gt;GeneralReasonerAgent&lt;/code&gt; that:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&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;&#xA;&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;&#xA;&lt;li&gt;Classifies the winning hypothesis using &lt;strong&gt;rubric dimensions&lt;/strong&gt;&lt;/li&gt;&#xA;&lt;li&gt;Logs structured results to a PostgreSQL-backed system&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;p&gt;All of this was integrated with our existing stephanie framework, which includes:&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
