<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Transformer on ByF (BaiFan) · Daily Deep Think</title>
    <link>https://blog.baifan.site/en/tags/transformer/</link>
    <description>Recent content in Transformer on ByF (BaiFan) · Daily Deep Think</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <managingEditor>blog@baifan.site (ByF (BaiFan))</managingEditor>
    <webMaster>blog@baifan.site (ByF (BaiFan))</webMaster>
    <copyright>CC BY-NC 4.0</copyright>
    <lastBuildDate>Tue, 05 Aug 2025 14:00:00 +0800</lastBuildDate><atom:link href="https://blog.baifan.site/en/tags/transformer/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Transformer Architecture Deconstructed: Attention, Geometric Scaling, and Memory IO</title>
      <link>https://blog.baifan.site/en/transformer-attention-mechanism-deep-dive/</link>
      <pubDate>Tue, 05 Aug 2025 14:00:00 +0800</pubDate>
      <author>blog@baifan.site (ByF (BaiFan))</author>
      <guid>https://blog.baifan.site/en/transformer-attention-mechanism-deep-dive/</guid>
      <description>&lt;p&gt;The physical barrier modern large language models confront when scaling context length is rarely raw floating-point throughput (FLOPs). It is the memory-access wall between high-bandwidth memory (HBM) and on-chip static random-access memory (SRAM). The standard Scaled Dot-Product Attention operator established by Vaswani et al. (2017) incurs an $O(N^2)$ memory-traffic overhead as sequence length $N$ grows, reducing self-attention primarily to a memory-bound workload.&lt;/p&gt;&#xA;&lt;!-- more --&gt;&#xA;&lt;p&gt;Understanding the Transformer requires stripping away anthropomorphic cognitive metaphors and grounding the discussion in the geometry of matrix projections alongside the hardware constraints of modern GPUs.&lt;/p&gt;</description>
      
    </item>
    
    <item>
      <title>A Complete Guide to LLMs: Tokens and Vectors in Depth</title>
      <link>https://blog.baifan.site/en/ai-llm-tutorial-token-vector-basics/</link>
      <pubDate>Tue, 22 Jul 2025 14:00:00 +0800</pubDate>
      <author>blog@baifan.site (ByF (BaiFan))</author>
      <guid>https://blog.baifan.site/en/ai-llm-tutorial-token-vector-basics/</guid>
      <description>&lt;h1 class=&#34;relative group&#34;&gt;AI Tutorial: A Guide to AI LLMs, from Basics to Depth&#xA;    &lt;div id=&#34;ai-tutorial-a-guide-to-ai-llms-from-basics-to-depth&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#ai-tutorial-a-guide-to-ai-llms-from-basics-to-depth&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h1&gt;&#xA;&lt;p&gt;This article takes you deep into the core concepts of large language models — from basic principles to vector representation — building a complete knowledge system step by step.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&#xA;&lt;h2 class=&#34;relative group&#34;&gt;1. Foundations of AI Application Development&#xA;    &lt;div id=&#34;1-foundations-of-ai-application-development&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#1-foundations-of-ai-application-development&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h2&gt;&#xA;&#xA;&lt;h3 class=&#34;relative group&#34;&gt;1.1 Basic Principles and Concepts&#xA;    &lt;div id=&#34;11-basic-principles-and-concepts&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#11-basic-principles-and-concepts&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h3&gt;&#xA;&#xA;&lt;h4 class=&#34;relative group&#34;&gt;In Plain Words&#xA;    &lt;div id=&#34;in-plain-words&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#in-plain-words&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h4&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Core mechanism&lt;/strong&gt;: predict the next word from the previous one — like a word-chain game&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;How it works&lt;/strong&gt;: output is generated token by token&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&lt;h4 class=&#34;relative group&#34;&gt;A Deeper Look&#xA;    &lt;div id=&#34;a-deeper-look&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#a-deeper-look&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h4&gt;&#xA;&lt;p&gt;A large AI model involves two key stages:&lt;/p&gt;</description>
      
    </item>
    
  </channel>
</rss>
