<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Similarity Metrics on AIBussin — AI applications, systems and books</title><link>https://aibussin.com/tags/similarity-metrics/</link><description>Recent content in Similarity Metrics on AIBussin — AI applications, systems and books</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Wed, 05 Aug 2026 23:24:45 +0100</lastBuildDate><atom:link href="https://aibussin.com/tags/similarity-metrics/index.xml" rel="self" type="application/rss+xml"/><item><title>RELATE: Searching Embeddings by Relation, Not Just Similarity</title><link>https://aibussin.com/post/relate/</link><pubDate>Wed, 05 Aug 2026 23:24:45 +0100</pubDate><guid>https://aibussin.com/post/relate/</guid><description>&lt;p&gt;Embeddings are everywhere in modern AI.&lt;/p&gt;&#10;&lt;p&gt;They power semantic search, retrieval-augmented generation, recommendations, clustering, duplicate detection, code search, memory systems, and many of the mechanisms through which an AI system decides what information is relevant.&lt;/p&gt;&#10;&lt;p&gt;Yet most systems interrogate embeddings in essentially the same way:&lt;/p&gt;&#10;&lt;blockquote&gt;&#10;&lt;p&gt;Take two vectors and calculate cosine similarity.&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;p&gt;That is useful. But it also makes a strong assumption.&lt;/p&gt;&#10;&lt;p&gt;It assumes that the information we care about is expressed directly through the default geometry of the embedding space.&lt;/p&gt;</description></item></channel></rss>