<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bayesian on Guy Freeman</title><link>https://gfrm.in/categories/bayesian/</link><description>Recent content in Bayesian on Guy Freeman</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sun, 26 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://gfrm.in/categories/bayesian/index.xml" rel="self" type="application/rss+xml"/><item><title>Three Types and a Funeral for Your Inference Library</title><link>https://gfrm.in/posts/three-types/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/three-types/</guid><description>&lt;div class="callout callout-note"&gt;
 This is Part 1 of a series on Bayesian decision-theoretic agents.
&lt;/div&gt;

&lt;div class="callout callout-note"&gt;
 This post describes the Credence architecture as it stood in March 2026, when the system used the standard Kolmogorov definition of probability &amp;mdash; measures over sample spaces. Since then, the foundation has been reconstructed around de Finetti&amp;rsquo;s definition, where expectation (the &lt;em&gt;prevision&lt;/em&gt;) is the primitive and probability is derived from it. The three types described here were the right starting point; &lt;a href="https://gfrm.in/#what-came-next-the-funeral-in-the-title"&gt;what came next&lt;/a&gt; is at the end.
&lt;/div&gt;

&lt;p&gt;What would it take to build an agent that genuinely learns and decides &amp;mdash; not one that pattern-matches its way through tool calls, but one whose behaviour is &lt;em&gt;derived&lt;/em&gt; from a few fundamentals the way physics is derived from conservation laws?&lt;/p&gt;</description></item><item><title>Ninety-Six Percent Cheaper and Slightly Better</title><link>https://gfrm.in/posts/ninety-six-percent-cheaper/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/ninety-six-percent-cheaper/</guid><description>&lt;p&gt;The production question about LLM agents, once you have gotten past whether they work at all, is how much they cost. A customer-service agent that answers well but costs eight cents per turn is not a customer-service agent; it is a charity. The conventional answer is to pick a cheaper model and hope it is good enough. The less conventional answer is to treat model selection as a decision problem.&lt;/p&gt;</description></item><item><title>Sixty-Two Percent Correct and Winning by a Hundred and Twenty Points</title><link>https://gfrm.in/posts/accuracy-paradox/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/accuracy-paradox/</guid><description>&lt;p&gt;The standard way to evaluate a question-answering system is to measure how often it gets the right answer. This seems reasonable. It is, in practice, a trap.&lt;/p&gt;
&lt;p&gt;I ran an experiment to demonstrate why. A &lt;a href="https://gfrm.in/posts/three-types/"&gt;Bayesian decision-theoretic agent&lt;/a&gt; &amp;mdash; built on the Credence DSL, using Beta-Bernoulli reliability tracking and value-of-information calculations &amp;mdash; competed against several LLM agents on a 50-question benchmark. All had access to the same four tools. All faced the same questions. All were scored on the same objective.&lt;/p&gt;</description></item><item><title>The Agent That Invents Its Own Rules</title><link>https://gfrm.in/posts/program-synthesis/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/program-synthesis/</guid><description>&lt;p&gt;The &lt;a href="https://gfrm.in/posts/three-types/"&gt;previous post in this series&lt;/a&gt; described what I called Tier 1 of the Credence architecture: a DSL for Bayesian decision agents with three types, four axioms, and a constitution forbidding everything else. That post ended with a program the user had to write by hand &amp;mdash; a short S-expression encoding a hypothesis about what the environment was like and how to act in it.&lt;/p&gt;
&lt;p&gt;Hand-written programs have a well-known limitation: they are only as good as whoever wrote them.&lt;/p&gt;</description></item><item><title>The Prompting Gradient</title><link>https://gfrm.in/posts/eight-ways-to-prompt/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/eight-ways-to-prompt/</guid><description>&lt;p&gt;The &lt;a href="https://gfrm.in/posts/accuracy-paradox/"&gt;accuracy paradox post&lt;/a&gt; reported the headline: a Bayesian agent scoring +129.5 against an LLM agent&amp;rsquo;s +10.8, despite lower accuracy. This post is about the LLM side of that experiment &amp;mdash; what was tried, what helped, and where the ceiling is.&lt;/p&gt;
&lt;h2 id="the-three-variants"&gt;The Three Variants&lt;/h2&gt;
&lt;p&gt;Three LLM agents were tested on the same 50-question benchmark. They differed only in prompting:&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;LLM Bare.&lt;/strong&gt; The model receives a description of the four available tools, the scoring system (+10 correct, -5 wrong, 0 abstain, minus tool costs), and the current question with its four candidate answers. No guidance on how to decide. No reasoning format imposed. The model chooses a tool, receives a response, and decides what to do next.&lt;/p&gt;</description></item><item><title>The Loop Problem</title><link>https://gfrm.in/posts/loop-problem/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/loop-problem/</guid><description>&lt;div class="callout callout-note"&gt;
 This is Part 3 of a series. For the axiomatic foundation, see &lt;a href="https://gfrm.in/posts/three-types/"&gt;Part 1: Three Types and a Funeral&lt;/a&gt;. For the VOI-gated text adventure agent, see &lt;a href="https://gfrm.in/posts/teaching-zork/"&gt;Part 2: Teaching Zork to a Bayesian&lt;/a&gt;.
&lt;/div&gt;

&lt;p&gt;Every reinforcement learning agent that has ever played a text adventure has, at some point, tried to take the lantern fifty times in a row.&lt;/p&gt;
&lt;p&gt;Not because it&amp;rsquo;s stupid. Because its state representation makes &amp;ldquo;Shack with book&amp;rdquo; and &amp;ldquo;Shack with lantern&amp;rdquo; look like different states, so the learned futility of &amp;ldquo;take lantern&amp;rdquo; in one state doesn&amp;rsquo;t transfer to the other. The agent is doing exactly what its architecture tells it to do: each state-action pair is independent, and it hasn&amp;rsquo;t yet learned that &lt;em&gt;this particular&lt;/em&gt; pair is useless. It will learn, eventually, after wasting 39 steps per episode on actions it has already tried.&lt;/p&gt;</description></item><item><title>Teaching Zork to a Bayesian</title><link>https://gfrm.in/posts/teaching-zork/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/teaching-zork/</guid><description>&lt;div class="callout callout-note"&gt;
 This is Part 2 of a series. For the axioms and types underneath, see &lt;a href="https://gfrm.in/posts/three-types/"&gt;Part 1: Three Types and a Funeral&lt;/a&gt;. For the state-representation consequences, see &lt;a href="https://gfrm.in/posts/loop-problem/"&gt;Part 3: The Loop Problem&lt;/a&gt;.
&lt;/div&gt;

&lt;p&gt;Every AI agent demo involves web search, retrieval, or API calls &amp;mdash; tasks where querying everything is merely expensive. A LangChain ReAct agent that hammers all four tools on every question wastes money but still gets answers. The penalty is economic, not existential.&lt;/p&gt;</description></item><item><title>The Bitter Lesson Has No Utility Function</title><link>https://gfrm.in/posts/bitter-lesson-missing-half/</link><pubDate>Thu, 12 Mar 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/bitter-lesson-missing-half/</guid><description>&lt;p&gt;I wrote &lt;a href="https://gfrm.in/posts/why-decision-theory-lost/"&gt;an essay&lt;/a&gt; arguing that decision theory had been quietly abandoned by mainstream AI &amp;mdash; not because it stopped working, but because deep learning absorbed all the oxygen. I posted it to &lt;a href="https://news.ycombinator.com/item?id=47306334"&gt;Hacker News&lt;/a&gt;. A commenter informed me I was &amp;ldquo;annoyed at the Bitter Lesson.&amp;rdquo;&lt;/p&gt;
&lt;p&gt;I hadn&amp;rsquo;t read the Bitter Lesson. This proved awkward for approximately forty-five seconds, after which it proved illuminating.&lt;/p&gt;
&lt;p&gt;So I read it. Rich Sutton&amp;rsquo;s &lt;a href="http://www.incompleteideas.net/IncIdeas/BitterLesson.html"&gt;essay&lt;/a&gt;, published in 2019, argues that general methods leveraging computation consistently beat methods built on hand-crafted human knowledge. Chess: deep search beat hand-tuned evaluation. Go: self-play beat human strategy. Speech recognition: statistical methods beat phoneme engineering. Computer vision: neural networks beat edge detectors. The pattern, he argues, has held for seventy years:&lt;/p&gt;</description></item><item><title>Why We Stopped Using the Mathematics That Works</title><link>https://gfrm.in/posts/why-decision-theory-lost/</link><pubDate>Mon, 09 Mar 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/why-decision-theory-lost/</guid><description>&lt;p&gt;Someone asked a good question. I&amp;rsquo;d written &lt;a href="https://gfrm.in/posts/agentic-ai/"&gt;a post&lt;/a&gt; arguing that what the industry calls &amp;ldquo;AI agents&amp;rdquo; are flowcharts with good marketing, and that the mathematics to do better has existed since the 1960s. A commenter on LinkedIn replied: &amp;ldquo;So why did it stop being widely used?&amp;rdquo;&lt;/p&gt;
&lt;p&gt;I sat with this for a day. It deserved a proper answer, not least because I&amp;rsquo;d spent a decade watching it happen from inside a statistics department and had never quite articulated the mechanism to myself.&lt;/p&gt;</description></item><item><title>Agentic AI Is Neither Intelligent Nor an Agent</title><link>https://gfrm.in/posts/agentic-ai/</link><pubDate>Mon, 23 Feb 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/agentic-ai/</guid><description>&lt;p&gt;I&amp;rsquo;ve spent the last few months building agents that maintain actual beliefs and update them from evidence — first &lt;a href="https://gfrm.in/posts/bayesian-agent/"&gt;a Bayesian learner&lt;/a&gt; that teaches itself which foods are safe, then &lt;a href="https://gfrm.in/posts/bayesian-agent-part2/"&gt;an evolutionary system&lt;/a&gt; that discovers its own cognitive architecture. The experience has given me a certain clarity about the industry&amp;rsquo;s use of the word &amp;ldquo;agent,&amp;rdquo; in much the same way that learning to cook gives you clarity about airline food.&lt;/p&gt;
&lt;p&gt;What would it take for an AI system to genuinely deserve the word?&lt;/p&gt;</description></item><item><title>How Decision Theory Cuts Your AI Agent's API Bill in Half</title><link>https://gfrm.in/posts/decision-theory-agents/</link><pubDate>Mon, 23 Feb 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/decision-theory-agents/</guid><description>&lt;p&gt;The &lt;a href="https://gfrm.in/posts/agentic-ai/"&gt;companion essay&lt;/a&gt; argued that LLM-based &amp;ldquo;agents&amp;rdquo; don&amp;rsquo;t earn the title. No beliefs, no uncertainty quantification, no principled mechanism for deciding whether a tool query justifies its cost. This post supplies the technical scaffolding for that claim &amp;mdash; the mathematics and code behind &lt;a href="https://github.com/gfrmin/credence"&gt;Credence&lt;/a&gt;, the benchmark I built to test it. Think of it as the receipts.&lt;/p&gt;
&lt;div class="callout callout-note"&gt;
 For the philosophical argument, see &lt;a href="https://gfrm.in/posts/agentic-ai/"&gt;Agentic AI Is Neither Intelligent Nor an Agent&lt;/a&gt;.
&lt;/div&gt;

&lt;h2 id="the-problem-every-query-has-a-price"&gt;The Problem: Every Query Has a Price&lt;/h2&gt;
&lt;p&gt;Hand a standard LangChain ReAct agent a question and four tools, and it will query most of them most of the time. It possesses no apparatus for reasoning about whether the next query repays its cost. The prompt says &amp;ldquo;be helpful&amp;rdquo;; the agent takes helpfulness to mean exhaustiveness.&lt;/p&gt;</description></item><item><title>Evolution Discovers How to Think: A Philosophical Journey in Code</title><link>https://gfrm.in/posts/bayesian-agent-part2/</link><pubDate>Sat, 31 Jan 2026 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/bayesian-agent-part2/</guid><description>&lt;p&gt;In &lt;a href="https://gfrm.in/posts/bayesian-agent/"&gt;Part 1&lt;/a&gt;, I built an agent that learns which foods are safe through Bayesian inference. It starts ignorant, observes outcomes, updates its beliefs using exact conjugate mathematics, and eventually acts with something resembling competence. Clean code, sound theory, and those belief distributions converging in real-time remain genuinely satisfying to watch, in the way that all correctly implemented mathematics is satisfying to watch.&lt;/p&gt;
&lt;p&gt;Something has been nagging at me, though.&lt;/p&gt;
&lt;p&gt;The agent learns &lt;em&gt;what&lt;/em&gt; to believe. I designed &lt;em&gt;how&lt;/em&gt; it believes. I chose the variables it perceives. I specified the structure of its world-model. I set the prior hyperparameters. The agent&amp;rsquo;s entire cognitive architecture &amp;mdash; the shape of its epistemic machinery &amp;mdash; came from me, handed down like tablets from a mountain. The agent had no say in the matter. As someone who spent years doing Bayesian statistics, I should know better than to treat the model structure as given. The prior over model structures is the prior that actually matters, and I skipped it entirely.&lt;/p&gt;</description></item><item><title>Building a Bayesian Learning Agent That Teaches Itself to Eat</title><link>https://gfrm.in/posts/bayesian-agent/</link><pubDate>Fri, 26 Dec 2025 00:00:00 +0000</pubDate><guid>https://gfrm.in/posts/bayesian-agent/</guid><description>&lt;p&gt;You&amp;rsquo;re stranded somewhere unfamiliar with twelve types of food scattered around. Some provide energy. Others are toxic. You don&amp;rsquo;t know which is which, you&amp;rsquo;re losing energy with every step, and nobody left a manual. The question is whether you can learn fast enough to survive.&lt;/p&gt;
&lt;p&gt;This is the exploration-exploitation tradeoff, and it&amp;rsquo;s one of those problems that sounds like a thought experiment until you actually have to solve it. Pure exploration &amp;mdash; trying everything at random &amp;mdash; kills you. Pure exploitation &amp;mdash; eating only what you currently believe is best &amp;mdash; starves you when better options exist two metres away. You need something that balances both, and ideally something with a mathematical proof attached.&lt;/p&gt;</description></item></channel></rss>