<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Neural Networks on ByF (BaiFan) · Daily Deep Think</title>
    <link>https://blog.baifan.site/en/tags/neural-networks/</link>
    <description>Recent content in Neural Networks 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/neural-networks/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>
    
  </channel>
</rss>
