<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Vector-Search on Sachin Chavan</title>
    <link>https://sachinsmc.me/blog/tags/vector-search/</link>
    <description>Recent content in Vector-Search on Sachin Chavan</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 23 Jun 2026 12:00:00 +0400</lastBuildDate>
    <atom:link href="https://sachinsmc.me/blog/tags/vector-search/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>The Overhead Is the Story: My Take on Google&#39;s TurboQuant</title>
      <link>https://sachinsmc.me/blog/posts/turboquant-data-free-quantization/</link>
      <pubDate>Tue, 23 Jun 2026 12:00:00 +0400</pubDate>
      <guid>https://sachinsmc.me/blog/posts/turboquant-data-free-quantization/</guid>
      <description>Google&amp;rsquo;s TurboQuant compresses LLM KV caches and embedding vectors to 3-4 bits with no training and no codebook, and still beats methods that need both. The clever part is not the quantizer, it is what it refuses to store. Here is the intuition, with runnable NumPy you can paste and check.</description>
    </item>
  </channel>
</rss>
