浅析注意力(Attention)机制(三)-- Multi-Head Attention多头自注意力机制
上期我们讲完了针对序列中单个元素的自注意力机制计算方法,为了更方便理解多头自注意力机制,我们先将自注意力机制改写为矩阵形式。
3.1 Self-Attention的矩阵形式
在实际计算中,序列的各个元素并行输入到自注意力机制中,将所有位置的向量堆叠起来
\(Q、K、V\)三参数的计算方法也可以改写为矩阵形式,即:
同理,相关性矩阵可由以下公式计算:
最后经过softmax归一化得到注意力权重,再和\(V\)加权求和,这也是自注意力机制的核心公式:
以上就是自注意力机制的矩阵形式,但单头的自注意力机制只能用一种视角给序列建模,我们自然而然能联想到,能否用并行的方式计算出多个注意力权重,然后融合起来呢?这就是多头自注意力机制的基本思想。
3.2 计算过程
正所谓“一生二、二生三、三生万物”,多头自注意力机制的核心思路很直观,就是通过多个注意力头并行,计算出一组注意力权重,每次关注不同的子空间,这样模型就能从多个视角挖掘序列中各个元素的依赖关系,即:
随后将这一组注意力权重直接拼接,没错,就是直接拼起来,得到一个更大的注意力矩阵
随后将拼接后的矩阵输入一个线性层,因为拼接后的注意力矩阵只是将不同注意力头的信息并排放在一起,来自不同注意力头的权重之间并没有发现关联,因此要实现真正的融合,必须进行一次线性变换,即:
由此,所有头的信息被打散并重新组合,模型可以自由地学习跨多头的特征关系。
把公式合并如下,得到多头注意力的融合公式:
3.3 维度关系
我们知道,Transformer 中的注意力机制是多层叠加使用的,为了让模型中的数据流动更加简洁,最好让向量流过注意力机制后维度保持不变
例如输入的编码\(\mathbf{x_{(i)}}\)位数为512,注意力头8个,则每个注意力头计算出的注意力维数为512/8=64,这个整除关系必须满足,那么\(d_k, d_v\)长度均为64,正好64是完全平方数,方便计算注意力分数时进行开方操作。
3.4 代码实现
import torch
import torch.nn as nn
import copy, math
import torch.nn.functional as F
from torch.autograd import Variable
class Encoder(nn.Module):
def __init__(self, layer, N):
super(Encoder, self).__init__()
self.layers = nn.ModuleList([copy.deepcopy(layer) for _ in range(N)])
self.norm = nn.LayerNorm(layer.size)
def forward(self, x, mask):
"""Pass the input (and mask) through each layer in turn."""
for layer in self.layers:
x = layer(x, mask)
return self.norm(x)
class SublayerConnection(nn.Module):
"""
A residual connection followed by a layer norm.
Note for code simplicity the norm is first as opposed to last.
"""
def __init__(self, size, dropout):
super(SublayerConnection, self).__init__()
self.norm = nn.LayerNorm(size)
self.dropout = nn.Dropout(dropout)
def forward(self, x, sublayer):
"""Apply residual connection to any sublayer with the same size."""
return x + self.dropout(sublayer(self.norm(x)))
class EncoderLayer(nn.Module):
def __init__(self, size, num_heads, feed_forward, dropout):
super(EncoderLayer, self).__init__()
self.self_attn = nn.MultiheadAttention(size, num_heads)
self.feed_forward = feed_forward
self.sublayer = nn.ModuleList([SublayerConnection(size, dropout) for _ in range(2)])
self.size = size
def forward(self, x, mask):
x = self.sublayer[0](x, lambda x: self.self_attn(x, x, x, mask))
return self.sublayer[1](x, self.feed_forward)
class Decoder(nn.Module):
def __init__(self, layer, N):
super(Decoder, self).__init__()
self.layers = nn.ModuleList([copy.deepcopy(layer) for _ in range(N)])
self.norm = nn.LayerNorm(layer.size)
def forward(self, x, memory, src_mask, tgt_mask):
for layer in self.layers:
x = layer(x, memory, src_mask, tgt_mask)
return self.norm(x)
class DecoderLayer(nn.Module):
def __init__(self, size, num_heads, feed_forward, dropout):
super(DecoderLayer, self).__init__()
self.self_attn = nn.MultiheadAttention(size, num_heads)
self.src_attn = nn.MultiheadAttention(size, num_heads)
self.feed_forward = feed_forward
self.sublayer = nn.ModuleList([SublayerConnection(size, dropout) for _ in range(3)])
self.size = size
def forward(self, x, memory, src_mask, tgt_mask):
x = self.sublayer[0](x, lambda x: self.self_attn(x, x, x, tgt_mask))
x = self.sublayer[1](x, lambda x: self.src_attn(x, memory, memory, src_mask))
return self.sublayer[2](x, self.feed_forward)
class PositionwiseFeedForward(nn.Module):
"""Implements FFN equation."""
def __init__(self, d_model, d_ff, dropout=0.1):
super(PositionwiseFeedForward, self).__init__()
self.w_1 = nn.Linear(d_model, d_ff)
self.w_2 = nn.Linear(d_ff, d_model)
self.dropout = nn.Dropout(dropout)
def forward(self, x):
return self.w_2(self.dropout(F.relu(self.w_1(x))))
class Embeddings(nn.Module):
def __init__(self, d_model, vocab):
super(Embeddings, self).__init__()
self.embeddings = nn.Embedding(vocab, d_model)
self.d_model = d_model
def forward(self, x):
return self.embeddings(x)*math.sqrt(self.d_model)
class PositionalEncoding(nn.Module):
def __init__(self, d_model, dropout, max_len=5000):
super(PositionalEncoding, self).__init__()
self.dropout = nn.Dropout(p=dropout)
pe = torch.zeros(max_len, d_model)
position = torch.arange(0, max_len).unsqueeze(1)
div_term = torch.exp(torch.arange(0, d_model, 2)*-(math.log(10000.0) / d_model))
pe[:, 0::2] = torch.sin(position * div_term)
pe[:, 1::2] = torch.cos(position * div_term)
pe = pe.unsqueeze(0)
self.register_buffer('pe', pe)
def forward(self, x):
x = x + Variable(self.pe[:, :x.size(1)],
requires_grad=False)
return self.dropout(x)
class Generator(nn.Module):
"""Define standard linear + softmax generation step."""
def __init__(self, d_model, vocab):
super(Generator, self).__init__()
self.proj = nn.Linear(d_model, vocab)
def forward(self, x):
return F.log_softmax(self.proj(x), dim=-1)
class EncoderDecoder(nn.Module):
def __init__(self, encoder, decoder, src_embed, tgt_embed, generator):
super(EncoderDecoder, self).__init__()
self.encoder = encoder
self.decoder = decoder
self.src_embed = src_embed
self.tgt_embed = tgt_embed
self.generator = generator
def forward(self, src, tgt, src_mask, tgt_mask):
"""Take in and process masked src and target sequences."""
return self.decode(self.encode(src, src_mask), src_mask,
tgt, tgt_mask)
def encode(self, src, src_mask):
return self.encoder(self.src_embed(src), src_mask)
def decode(self, memory, src_mask, tgt, tgt_mask):
return self.decoder(self.tgt_embed(tgt), memory, src_mask, tgt_mask)
def make_model(src_vocab, tgt_vocab, d_model=512, N=6, h=8, d_ff=2048, dropout=0.1):
c = copy.deepcopy
ff = PositionwiseFeedForward(d_model, d_ff, dropout=dropout)
position = PositionalEncoding(d_model, dropout=dropout)
# 编码长度embeddings512,注意力头head8个,则每个注意力头计算出的注意力分数维数为512/8=64,这个整除关系必须满足
# embeddings和head的商必须是完全平方数,因为计算注意力分数时需要进行开方操作
# 多头注意力就是将所有注意力头的计算结果拼接以后再进行线性变换的操作,最终输出的矩阵与输入相同,这样才可以堆叠
model = EncoderDecoder(
Encoder(EncoderLayer(d_model, h, c(ff), dropout), N),
Decoder(DecoderLayer(d_model, h, c(ff), dropout), N),
nn.Sequential(Embeddings(d_model, src_vocab), c(position)),
nn.Sequential(Embeddings(d_model, tgt_vocab), c(position)),
Generator(d_model, tgt_vocab)
)
# This was important from their code.
# Initialize parameters with Glorot / fan_avg.
for p in model.parameters():
if p.dim() > 1:
nn.init.xavier_uniform(p)
return model

浙公网安备 33010602011771号