<?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%A1%AB%E5%85%85%E6%8E%A9%E7%A0%81/</link>
    <description>Recent content in 填充掩码 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Wed, 11 Mar 2026 22:55:24 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%A1%AB%E5%85%85%E6%8E%A9%E7%A0%81/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Attention Mask：Transformer如何通过一个矩阵控制信息流向</title>
      <link>https://answer.freetools.me/attention-masktransformer%E5%A6%82%E4%BD%95%E9%80%9A%E8%BF%87%E4%B8%80%E4%B8%AA%E7%9F%A9%E9%98%B5%E6%8E%A7%E5%88%B6%E4%BF%A1%E6%81%AF%E6%B5%81%E5%90%91/</link>
      <pubDate>Wed, 11 Mar 2026 22:55:24 +0800</pubDate>
      <guid>https://answer.freetools.me/attention-masktransformer%E5%A6%82%E4%BD%95%E9%80%9A%E8%BF%87%E4%B8%80%E4%B8%AA%E7%9F%A9%E9%98%B5%E6%8E%A7%E5%88%B6%E4%BF%A1%E6%81%AF%E6%B5%81%E5%90%91/</guid>
      <description>深入解析Transformer中Attention Mask的工作原理：从因果掩码的下三角矩阵设计，到填充掩码的批处理机制，揭示为什么一个简单的矩阵能够实现因果性保证、变长序列处理和计算优化。涵盖数学原理、实现细节、常见陷阱和现代优化技术。</description>
    </item>
  </channel>
</rss>
