<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Representation Learning on AIBussin — AI applications, systems and books</title><link>https://aibussin.com/tags/representation-learning/</link><description>Recent content in Representation Learning on AIBussin — AI applications, systems and books</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Mon, 07 Sep 2026 14:10:00 +0000</lastBuildDate><atom:link href="https://aibussin.com/tags/representation-learning/index.xml" rel="self" type="application/rss+xml"/><item><title>What Is an Embedding?</title><link>https://aibussin.com/books/embeddings-from-first-principles/01-chapter/</link><pubDate>Mon, 07 Sep 2026 09:00:00 +0000</pubDate><guid>https://aibussin.com/books/embeddings-from-first-principles/01-chapter/</guid><description>&lt;p&gt;&lt;em&gt;Part I — A Vector Is Not Meaning&lt;/em&gt;&lt;/p&gt;&#10;&lt;h2 id="three-words-and-a-list-of-numbers"&gt;Three words and a list of numbers&lt;/h2&gt;&#10;&lt;p&gt;Take three words:&lt;/p&gt;&#10;&lt;div class="highlight"&gt;&lt;pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;"&gt;&lt;code class="language-text" data-lang="text"&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;cat&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;dog&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;airplane&#10;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Turn them into numbers. Any embedding API will do it. You get three arrays, each maybe 384 or 768 or 1,536 floats long:&lt;/p&gt;&#10;&lt;div class="highlight"&gt;&lt;pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;"&gt;&lt;code class="language-text" data-lang="text"&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;cat [ 0.021, -0.114, 0.062, ... ]&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;dog [ 0.019, -0.098, 0.071, ... ]&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;airplane [-0.087, 0.203, -0.041, ... ]&#10;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Compute the angle between &lt;code&gt;cat&lt;/code&gt; and &lt;code&gt;dog&lt;/code&gt;. It is small. Compute the angle between &lt;code&gt;cat&lt;/code&gt; and &lt;code&gt;airplane&lt;/code&gt;. It is larger. Something about &amp;ldquo;cats and dogs are both pets&amp;rdquo; appears to have survived the trip into number-space.&lt;/p&gt;</description></item><item><title>Learning an Embedding Space</title><link>https://aibussin.com/books/embeddings-from-first-principles/03-chapter/</link><pubDate>Mon, 07 Sep 2026 09:20:00 +0000</pubDate><guid>https://aibussin.com/books/embeddings-from-first-principles/03-chapter/</guid><description>&lt;p&gt;&lt;em&gt;Part I — A Vector Is Not Meaning&lt;/em&gt;&lt;/p&gt;&#10;&lt;h2 id="refusing-the-handout"&gt;Refusing the handout&lt;/h2&gt;&#10;&lt;p&gt;For two chapters the vectors were given. Chapter 1 took them from an API and asked what was in them; Chapter 2 placed some by hand and treated the rest as the output of a model we agreed not to open. Chapter 2 closed on the question it left unanswered: &lt;strong&gt;where does the geometry come from?&lt;/strong&gt;&lt;/p&gt;&#10;&lt;p&gt;This chapter builds a small space from nothing but a corpus and a counting rule. A usable geometry appears — related words land near each other without anyone labeling an axis &amp;ldquo;animal&amp;rdquo; or &amp;ldquo;drink.&amp;rdquo; Then comes the more important half: we inspect the construction closely enough to predict, from the mechanism alone, what it cannot preserve. When the measured results arrive, the failures are not surprises. They are consequences of the path the information took.&lt;/p&gt;</description></item><item><title>Alignment</title><link>https://aibussin.com/books/embeddings-from-first-principles/19-chapter/</link><pubDate>Mon, 07 Sep 2026 14:10:00 +0000</pubDate><guid>https://aibussin.com/books/embeddings-from-first-principles/19-chapter/</guid><description>&lt;p&gt;&lt;em&gt;Part VI — Crossing Embedding Spaces · Which map family survives held-out data?&lt;/em&gt;&lt;/p&gt;&#10;&lt;h2 id="what-chapter-18-left-open"&gt;What Chapter 18 left open&lt;/h2&gt;&#10;&lt;p&gt;Chapter 18 fit the simplest serious bridge — affine ridge regression — from &lt;code&gt;all-MiniLM-L6-v2&lt;/code&gt; into &lt;code&gt;all-mpnet-base-v2&lt;/code&gt;, and evaluated it on entity families the map never saw. The result was not a verdict. It was a profile, uneven enough to make one number impossible to trust on its own:&lt;/p&gt;&#10;&lt;div class="highlight"&gt;&lt;pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;"&gt;&lt;code class="language-text" data-lang="text"&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;coordinate reconstruction 0.5860&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;10-NN neighborhood overlap 0.7128&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;retrieval nDCG@10 ratio 0.7987&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;rank-triplet agreement 0.7529&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;calibration-transfer score 0.7882&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;relation-profile Pearson correlation 0.8673&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;structured hard-negative margin ratio 0.2342&#10;&lt;/span&gt;&lt;/span&gt;&lt;span style="display:flex;"&gt;&lt;span&gt;held-out/train reconstruction ratio 0.6480&#10;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;The chapter&amp;rsquo;s lesson was not &amp;ldquo;ridge works.&amp;rdquo; It was that &lt;code&gt;≈&lt;/code&gt; is a preservation contract — a named property, measured on held-out data, not a single number a map either clears or fails. That leaves an open question this chapter exists to answer:&lt;/p&gt;</description></item><item><title>What Does a Preference Know About the Future?</title><link>https://aibussin.com/post/future/</link><pubDate>Fri, 10 Jul 2026 11:32:58 +0100</pubDate><guid>https://aibussin.com/post/future/</guid><description>&lt;h2 id="we-trained-a-model-on-editorial-choices-to-see-whether-it-learned-what-happened-next"&gt;We Trained a Model on Editorial Choices to See Whether It Learned What Happened Next&lt;/h2&gt;&#10;&lt;p&gt;Most preference-learning systems use a choice to change the future.&lt;/p&gt;&#10;&lt;p&gt;A model produces two responses. A human selects one. The chosen response becomes positive evidence, the rejected response becomes negative evidence, and training makes outputs resembling the chosen response more likely.&lt;/p&gt;&#10;&lt;p&gt;The preference acts as an instruction:&lt;/p&gt;&#10;&lt;blockquote&gt;&#10;&lt;p&gt;Produce more things like this.&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;p&gt;I wanted to know whether the same choice could also function as evidence.&lt;/p&gt;</description></item><item><title>The Eye That Sees</title><link>https://aibussin.com/post/eye/</link><pubDate>Fri, 17 Apr 2026 14:27:45 +0100</pubDate><guid>https://aibussin.com/post/eye/</guid><description>&lt;blockquote&gt;&#10;&lt;p&gt;&lt;em&gt;Using AI to Decode Symbols Without Assuming Meaning&lt;/em&gt;&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;h2 id="executive-summary-from-symbol-to-system"&gt;&lt;strong&gt;Executive Summary: From Symbol to System&lt;/strong&gt;&lt;/h2&gt;&#10;&lt;blockquote&gt;&#10;&lt;p&gt;&lt;em&gt;We set out to understand a single image. We ended up building a system that can understand structure itself.&lt;/em&gt;&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;p&gt;We started with a constraint:&lt;/p&gt;&#10;&lt;blockquote&gt;&#10;&lt;p&gt;&lt;strong&gt;Assume we do not understand the symbol.&lt;/strong&gt;&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;p&gt;No prior knowledge. No accepted interpretations.&lt;/p&gt;&#10;&lt;p&gt;Just an image: an eye, a triangle, rays, an unfinished pyramid.&lt;/p&gt;&#10;&lt;p&gt;From that starting point, we:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;decomposed the symbol into observable parts&lt;/li&gt;&#10;&lt;li&gt;grounded those parts in documented history&lt;/li&gt;&#10;&lt;li&gt;separated structure from speculation&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;That produces a defensible analysis.&lt;/p&gt;</description></item><item><title>The Shape of Thought: Exploring Embedding Strategies with Ollama, HF, and H-Net</title><link>https://aibussin.com/post/hnet/</link><pubDate>Sat, 19 Jul 2025 22:06:13 +0100</pubDate><guid>https://aibussin.com/post/hnet/</guid><description>&lt;h2 id="-summary"&gt;🔍 Summary&lt;/h2&gt;&#10;&lt;p&gt;Stephanie, a self-improving system, is built on a powerful belief:&lt;/p&gt;&#10;&lt;blockquote&gt;&#10;&lt;p&gt;&lt;strong&gt;If an AI can evaluate its own understanding, it can reshape itself.&lt;/strong&gt;&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;p&gt;This principle fuels every part of her design from embedding to scoring to tuning.&lt;/p&gt;&#10;&lt;p&gt;At the heart of this system is a &lt;strong&gt;layered reasoning pipeline&lt;/strong&gt;:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;strong&gt;MRQ&lt;/strong&gt; offers directional, reinforcement-style feedback.&lt;/li&gt;&#10;&lt;li&gt;&lt;strong&gt;EBT&lt;/strong&gt; provides uncertainty-aware judgments and convergence guidance.&lt;/li&gt;&#10;&lt;li&gt;&lt;strong&gt;SVM&lt;/strong&gt; delivers fast, efficient evaluations for grounded comparisons.&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;These models form Stephanie’s &lt;strong&gt;subconscious engine&lt;/strong&gt; the part of her mind that runs beneath explicit thought, constantly shaping her understanding. But like any subconscious, its &lt;em&gt;clarity&lt;/em&gt; depends on how raw experience is &lt;strong&gt;represented&lt;/strong&gt;.&lt;/p&gt;</description></item></channel></rss>