<?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>复杂度分析 on Answer</title>
    <link>https://answer.freetools.me/tags/%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90/</link>
    <description>Recent content in 复杂度分析 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Thu, 12 Mar 2026 10:44:33 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>序列长度增加一倍，推理时间翻四倍？Transformer注意力复杂度的技术真相</title>
      <link>https://answer.freetools.me/%E5%BA%8F%E5%88%97%E9%95%BF%E5%BA%A6%E5%A2%9E%E5%8A%A0%E4%B8%80%E5%80%8D%E6%8E%A8%E7%90%86%E6%97%B6%E9%97%B4%E7%BF%BB%E5%9B%9B%E5%80%8Dtransformer%E6%B3%A8%E6%84%8F%E5%8A%9B%E5%A4%8D%E6%9D%82%E5%BA%A6%E7%9A%84%E6%8A%80%E6%9C%AF%E7%9C%9F%E7%9B%B8/</link>
      <pubDate>Thu, 12 Mar 2026 10:44:33 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%BA%8F%E5%88%97%E9%95%BF%E5%BA%A6%E5%A2%9E%E5%8A%A0%E4%B8%80%E5%80%8D%E6%8E%A8%E7%90%86%E6%97%B6%E9%97%B4%E7%BF%BB%E5%9B%9B%E5%80%8Dtransformer%E6%B3%A8%E6%84%8F%E5%8A%9B%E5%A4%8D%E6%9D%82%E5%BA%A6%E7%9A%84%E6%8A%80%E6%9C%AF%E7%9C%9F%E7%9B%B8/</guid>
      <description>深入解析Transformer注意力机制的O(n²)复杂度瓶颈，从GPU内存层次、Prefill与Decode阶段差异、KV Cache优化到FlashAttention的IO感知算法，揭示序列长度影响推理速度的根本原因与优化路径。</description>
    </item>
  </channel>
</rss>
