<?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>Attention on Sandeep Kumar</title><link>https://sandeep007734.github.io/tags/attention/</link><description>Recent content in Attention on Sandeep Kumar</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 12 Aug 2026 00:00:00 +0530</lastBuildDate><atom:link href="https://sandeep007734.github.io/tags/attention/feed.xml" rel="self" type="application/rss+xml"/><item><title>The KV Cache: Sizing It, and the Attention Variants That Shrink It</title><link>https://sandeep007734.github.io/posts/kv_cache_and_gqa/</link><pubDate>Wed, 12 Aug 2026 00:00:00 +0530</pubDate><guid>https://sandeep007734.github.io/posts/kv_cache_and_gqa/</guid><description>Why decoding needs a KV cache, the exact formula for its size, why it makes decode memory-bound, and how multi-query, grouped-query, and latent attention change the constant in that formula.</description></item></channel></rss>