트랜스포머 신경망 이해하기: 인코딩 및 디코딩

트랜스포머 신경망은 단어 임베딩, 위치 인코딩, 자기 주의, 인코더-디코더 주의로 설명할 수 있습니다.

### 트랜스포머 신경망의 내부 작동 원리
* 🤖  이 통계 퀘스트는 단어 임베딩부터 위치 인코딩에 이르기까지 Transformer 신경망의 내부 작동 방식을 설명합니다.
* 🔤  단어 임베딩은 단어를 숫자로 변환하는 데 사용되며, 어휘의 모든 단어에 대해 하나의 입력이 있는 비교적 간단한 신경망을 포함합니다.
* 📐  그런 다음 사인 및 코사인 스퀴글을 포함하는 기술을 사용하여 단어 임베딩에 위치 인코딩을 추가하여 어순을 추적합니다.
* 🧠  자기 주의는 입력 및 출력 구문 내에서 단어 간의 관계를 추적하는 데 사용되며, 유사성을 계산하고 소프트맥스 함수를 사용하는 것이 포함됩니다.
* 🔗  인코더-디코더 주의는 입력과 출력 구문 간의 관계를 추적하여 입력의 중요한 단어가 번역 과정에서 손실되지 않도록 하는 데 사용됩니다.
* 📚  트랜스포머는 정규화, 다양한 유사도 함수, 인코더와 디코더에 숨겨진 레이어가 있는 추가 신경망으로 향상시킬 수 있습니다.
* 💡  통계 퀘스트는 뻔뻔한 자기 홍보와 채널 구독 및 지원을 요청하는 마지막 메시지로 마무리됩니다.

[Music] Translation: It's done with a Transformer. Hello, I'm Josh Starmer and welcome to StatQuest. Today, we're going to talk about Transformer neural networks, and they're going to be clearly explained. Transformers are more fun when you build them in the cloud with lightning, bam, right now. People are going bonkers about something called ChatGPT. For example, our friend, StatSquatch, might type something into ChatGPT like write an awesome song in the style of StatQuest. Translation: It's done with a Transformer. Anyway, there's a lot to be said about how ChatGPT works, but fundamentally, it is based on something called a Transformer. So, in this StatQuest, we're going to show you how a Transformer works one step at a time. Specifically, we're going to focus on how a Transformer neural network can translate a simple English sentence. Let's go into Spanish. Vamos. Now, since a Transformer is a type of neural network, and neural networks usually only have numbers for input values, the first thing we need to do is find a

way to turn the input and output words into numbers. There are a lot of ways to convert words into numbers, but for neural networks, one of the most commonly used methods is called word embedding. The main idea of word embedding is to use a relatively simple neural network that has one input for every word and symbol in the vocabulary that you want to use. In this case, we have a super simple vocabulary that allows us to input short phrases like let's go and to go, and we have an input for this symbol EOS, which stands for end of sentence or end of sequence. Because the vocabulary can be a mix of words, word fragments, and symbols, we call each input a token. The inputs are then connected to something called an activation function, and in this example, we have two activation functions, and each connection multiplies the input value by something called a weight. Hey Josh, where do these numbers come from? Great question, Squatch, and we'll answer it in just a bit. For now, let's just see how we convert the word 'let's' into numbers. First, we put a 1 into the input for

let's, and then put zeros into all of the other inputs. Now we multiply the inputs by their weights on the connections to the activation functions. For example, the input for let's is one, so we multiply 1.87 by 1 to get 1.87 going to the activation function on the left, and we multiply 0.09 by 1 to get 0.09 going to the activation function on the right. In contrast, if the input value for the word 2 is 0, then we multiply negative 1.45 by 0 to get 0 going to the activation function on the left, and we multiply 1.50 by 0 to get 0 going to the activation function on the right. In other words, when an input value is 0, then it only sends zeros to the activation functions, and that means to go and the EOS symbol all just send zeros to the activation functions, and only the weight values for let's end up at the activation functions because its input value is 1.

so in this case 1.87 goes to the activation function on the left, and 0.09 goes to the activation function on the right. In this example, the activation functions themselves are just identity functions, meaning the output values are the same as the input values. In other words, if the input value or x-axis coordinate for the activation function on the left is 1.87, then the output value, the y-axis coordinate, will also be 1.87. Likewise, because the input to the activation function on the right is 0.09, the output is also 0.09. Thus, these output values, 1.87 and 0.09, are the numbers that represent the word leads. Likewise, if we want to convert the word go into numbers, we set the input value for go to 1, and all of the other inputs to zero, and we end up with -0.78 and 0.27 as the numbers that represent the word go. And that is how we use word embedding to

convert our input phrase let's go into numbers bam. Note: there is a lot more to say about word embedding, so if you're interested, check out the quest. Also, note before we move on, I want to point out two things. First, we reuse the same word embedding network for each input word or symbol. In other words, the weights in the network for let's are the exact same as the weights in the network for go. This means that regardless of how long the input sentence is, we just copy and use the exact same word embedding network for each word or symbol, and this gives us flexibility to handle input sentences with different lengths. The second thing I want to mention is that all of these weights, and all of the other weights we're going to talk about in this quest, are determined using something called backpropagation. To get a sense of what backpropagation does, let's imagine we had this data and we wanted to fit a line to it. Backpropagation would start with a line that has a random value for the y-axis intercept and a random value for the

slope, and then using an iterative process back propagation would change the y-axis intercept and slope one step at a time until it found the optimal values. Likewise, in the context of neural networks, each weight starts out as a random number, but when we train the Transformer with English phrases and known Spanish translations, back propagation optimizes these values one step at a time and results in these final weights. Also, just to be clear, the process of optimizing the weights is also called training. Bam! Note: there is a lot more to be said about training and back propagation, so if you're interested, check out the quests now because the word embedding networks are taking up the whole screen. Let's shrink them down and put them in the corner. Okay, and now that we know how to convert words into numbers, let's talk about word order. For example, if Norm said Squatch eats pizza, then Squatch might say yum. In contrast, if Norm said Pizza eats squash, then Squatch might say yikes. So these two phrases Squatch eats Pizza and pizza eats squash use the exact same

words, but have very different meanings, so keeping track of word order is super important. So, let's talk about positional encoding, which is a technique that Transformers use to keep track of word order. We'll start by showing how to add positional encoding to the first phrase, Squatch eats Pizza. Note: there are a bunch of ways to do positional encoding, but we're just going to talk about one popular method. That said, the first thing we do is convert the words squash eats pizza into numbers using word embedding. In this example, we've got a new vocabulary, and we're creating four word embedding values per word. However, in practice, people often create hundreds or even thousands of embedding values per word. Now, we add a set of numbers that correspond to word order to the embedding values for each word. Hey Josh, where do the numbers that correspond to word order come from? In this case, the numbers that represent the word order come from a sequence of alternating sine and cosine squiggles. Each squiggle gives a specific position values for each word's embeddings.

for example, the y-axis values on the green squiggle give us position encoding values for the first embeddings for each word. Specifically, for the first word, which has an x-axis coordinate all the way to the left of the green squiggle, the position value for the first embedding is the y-axis coordinate zero. The position value for the second embedding comes from the orange squiggle, and the y-axis coordinate on the orange squiggle that corresponds to the first word is one. Likewise, the blue squiggle, which is more spread out than the first two squiggles, gives us the position value for the third embedding value, which for the first word is zero. Lastly, the red squiggle gives us the position value for the fourth embedding, which for the first word is one. Thus, the position values for the first word come from the corresponding y-axis coordinates on the squiggles. Now, to get the position values for the second word, we simply use the y-axis coordinates on the squiggles that correspond to the x-axis coordinate for

the second word lastly. To get the position values for the third word, we use the y-axis coordinates on the squiggles that correspond to the x-axis coordinate for the third word. Note, because the sine and cosine squiggles are repetitive, it's possible that two words might get the same position or y-axis values. For example, the second and third words both got negative 0.9 for the first position value. However, because the squiggles get wider for larger embedding positions and the more embedding values we have, then the wider the squiggles get. Then, even with a repeat value here and there, we end up with a unique sequence of position values for each word. Thus, each input word ends up with a unique sequence of position values. Now, all we have to do is add the position values to the embedding values, and we end up with the word embeddings plus positional encoding for the whole sentence. Squatch eats Pizza yum. Note, if we reverse the order of the input words to be Pizza eats squash, then the embeddings for the first and third

words get swapped, but the positional values for the first, second, and third word stay the same. And when we add the positional values to the embeddings, we end up with new positional encoding for the first and third words. And the second word, since it didn't move, stays the same. Thus, positional encoding allows a Transformer to keep track of word order. Bam! Now let's go back to our simple example where we are just trying to translate the English sentence let's go and add position values to the word embeddings. The first embedding for the first word Let's gets zero, and the second embedding gets one. And the first embedding for the second word go gets a negative 0.9, and the second embedding gets 0.4. And now we just do the math to get the positional encoding for both words. Bam! Now, because we're going to need all the space we can get, let's consolidate the math in the diagram and let the sine and cosine and plus symbols represent the positional encoding. Now that we know how to keep track of

each word's position. Let's talk about how a Transformer keeps track of the relationships among words. For example, if the input sentence was this: The pizza came out of the oven, and it tasted good. Then this word it could refer to pizza, or potentially it could refer to the word oven. Josh, I've heard of good-tasting pizza, but never a good-tasting oven. I know, Squatch, that's why it's important that the Transformer correctly associates the word it with pizza. The good news is that Transformers have something called self-attention, which is a mechanism to correctly associate the word it with pizza. In general terms, self-attention works by seeing how similar each word is to all of the words in the sentence, including itself. For example, self-attention calculates the similarity between the first word the and all of the words in the sentence, including itself. Self-attention calculates these similarities for every word in the sentence. Once the similarities are calculated, they are used to determine how the Transformer encodes each word. For example, if you looked at a lot of

sentences about pizza and the word ID was more commonly associated with pizza, than oven. Then the similarity score for pizza will cause it to have a larger impact on how the word ID is encoded by the Transformer. Bam! And now that we know the main ideas of how self-attention works, let's look at the details. So, let's go back to our simple example where we had just added positional encoding to the words let's and go. The first thing we do is multiply the position-encoded values for the word let's by a pair of weights, and we add those products together to get -1.0. Then we do the same thing with a different pair of weights to get 3.7. We do this twice because we started out with two position-encoded values that represent the word let's, and after doing the math two times, we still have two values representing the word let's. Josh, I don't get it. If we want two values to represent 'let's', why don't we just use the two values we started with? That's a great question, Squatch.

we'll answer it in a little bit. Grr. Anyway, for now, just know that we have these two new values to represent the word let's. In Transformer terminology, we call them query values. And now that we have query values for the word let's, use them to calculate the similarity between itself and the word go. And we do this by creating two new values, just like we did for the query, to represent the word let's. And we create two new values to represent the word go. Both sets of new values are called key values, and we use them to calculate similarities with the query for let's. One way to calculate similarities between the query and the keys is to calculate something called a DOT product. For example, in order to calculate the dot product similarity between the query and key for let's, we simply multiply each pair of numbers together and then add the products to get 11.7. Likewise, we can calculate the dot product similarity between the query for let's and the key for go by multiplying the pairs of numbers.

together, and adding the products to get negative 2.6. The relatively large similarity value for let's relative to itself 11.7 compared to the relatively small value for lets relative to the word go negative 2.6 tells us that let's is much more similar to itself than it is to the word go. That said, if you remember the example where the word it could relate to pizza or oven, the word it should have a relatively large similarity value with respect to the word Pizza since it refers to pizza and not oven. Note there's a lot to be said about calculating similarities in this context and the dot product, so if you're interested, check out the quests. Anyway, since let's is much more similar to itself than it is to the word go, then we want let's to have more influence on its encoding than the word go, and we do this by first running the similarities course through something called a soft Max function. The main idea of a soft Max function is that it preserves the order of the input.

values from low to high, and translates them into numbers between 0 and 1 that add up to one. So we can think of the output of the softmax function as a way to determine what percentage of each input word we should use to encode the word let's. In this case, because let's is so much more similar to itself than the word go, we'll use one hundred percent of the word let's to encode let's. Note, there's a lot more to be said about the softmax function, so if you're interested, check out the quest. Anyway, because we want 100% of the word let's to encode let's, we create two more values that we'll cleverly call values to represent the word let's and scale the values that represent let's by 1.0. Then we create two values to represent the word go and scale those values by 0.0. Lastly, we add the scaled values together, and these sums which combine separate encodings for both input words let's and

go relative to their similarity to Let's are the self-attention values for leads bam. Now that we have self-attention values for the word let's, it's time to calculate them for the word go. The good news is that we don't need to recalculate the keys and values. Instead, all we need to do is create the query that represents the word go and do the math by first calculating the similarity scores between the new query and the keys, and then run the similarity scores through a softmax, and then scale the values, and then add them together, and we end up with the self-attention values for go. Note before we move on, I want to point out a few details about self-attention. First, the weights that we use to calculate the self-attention queries are the exact same for let's and go. In other words, this example uses one set of weights for calculating self-attention queries regardless of how many words are in the input. Likewise, we reuse the sets of weights for calculating self-attention keys and values for each input word.

this means that no matter how many words are input into the Transformer, we just reuse the same sets of weights for self-attention queries, keys, and values. The other thing I want to point out is that we can calculate the queries, keys, and values for each word at the same time. In other words, we don't have to calculate the query, key, and value for the first word first before moving on to the second word. And because we can do all of the computation at the same time, Transformers can take advantage of parallel computing and run fast. Now that we understand the details of how self-attention works, let's shrink it down so we can keep building our Transformer. Bam! Josh, you forgot something. If we want two values to represent, let's why don't we just use the two position-encoded values we started with first. The new self-attention values for each word contain input from all of the other words, and this helps give each word context. This can help establish how each word in the input is related to the others. Also, if we think of this unit with its

weights for calculating queries, keys, and values as a self-attention cell. Then, in order to correctly establish how words are related in complicated sentences and paragraphs, we can create a stack of self-attention cells, each with its own sets of weights that we apply to the position-encoded values for each word to capture different relationships among the words in the manuscript. That first describes Transformers. They stacked eight self-attention cells, and they called this multi-head attention. Why eight instead of 12 or 16? I have no idea. Bam. Okay, going back to our simple example with only one self-attention cell, there's one more thing we need to do to encode the input. We take the position-encoded values and add them to the self-attention values. These bypasses are called residual connections, and they make it easier to train complex neural networks by allowing the self-attention layer to establish relationships among the input words without having to also preserve the word embedding and positioning coding information. Bam. And that's all we need to do to encode the input for this simple Transformer.

double bam note this simple Transformer only contains the parts required for encoding: the input word embedding, positional encoding, self-attention, and residual connections. These four features allow the Transformer to encode words into numbers, encode the positions of the words, encode the relationships among the words, and relatively easily and quickly train in parallel. That said, there are lots of extra things we can add to a Transformer, and we'll talk about those at the end of this Quest. Bam, so now that we've encoded the English input phrase, let's go. It's time to decode it into Spanish. In other words, the first part of a transformer is called an encoder, and now it's time to create the second part: A decoder. The decoder, just like the encoder, starts with word embedding. However, this time we create embedding values for the output vocabulary, which consists of the Spanish words. ¡Vamos! and the EOS (end of sequence) token. Now, because we just finished encoding the English sentence let's go, the decoder starts with embedding values for the EOS token. In this case, we're using the EOS token to start the

decoding because that is a common way to initialize the process of decoding the encoded input sentence. However, sometimes you'll see people use SOS for startup sentence or start of sequence to initialize the process. Josh starting with SOS makes more sense to me. Then you can do it that way. Squatch, I'm just saying a lot of people start with EOS. Anyway, we plug in 1 for EOS and zero for everything else and do the math, and we end up with 2.70 and negative 1.34 as the numbers that represent the EOS token. Bam! Now let's shrink the word embedding down to make more space so that we can add the positional encoding. Note: these are the exact same sine and cosine squiggles that we used when we encoded the input. And since the EOS token is in the first position with two embeddings, we just add those two position values, and we get 2.70 and negative 0.34 as the position and word embedding values representing the EOS token. Bam! Now let's

consolidate the math in the diagram. And before we move on to the next step, let's review a key concept from when we encoded the input. One key concept from earlier was that we created a single unit to process an input word, and then we just copied that unit for each word in the input. And if we had more words, we just make more copies of the same unit. By creating a single unit that can be copied for each input word, the Transformer can do all of the computation for each word in the input at the same time. For example, we can calculate the word embeddings on different processors at the same time, and then add the positional encoding at the same time, and then calculate the queries, keys, and values at the same time. And once that is done, we can calculate the self-attention values at the same time. And lastly, we can calculate the residual connections at the same time. Doing all of the computations at the same time, rather than doing them sequentially for each word, means we can process a lot of words.

relatively quickly on a chip with a lot of computing cores, like a GPU (Graphics Processing Unit), or multiple chips in the cloud. Well, likewise, when we decode and translate the input, we want a single unit that we can copy for each translated word. For the same reasons, we want to do the math quickly. So, even though we're only processing the EOS token so far, we add a self-attention layer so that ultimately we can keep track of related words in the output. Now that we have the query, key, and value numbers for the EOS token, we calculate self-attention values just like before. The self-attention values for the EOS token are -2.8 and -2.3. Note: the sets of weights we used to calculate the decoder self-attention query, key, and value are different from the sets we used in the encoder. Now, let's consolidate the math and add residual connections just like before. Bam! Now, so far we've talked about how self-attention helps the Transformer keep track of how words are related within a sentence.

however, since we're translating a sentence, we also need to keep track of the relationships between the input sentence and the output. For example, if the input sentence was don't eat the delicious looking and smelling pizza, then when translating, it's super important to keep track of the very first word don't. If the translation focuses on other parts of the sentence and omits the don't, then we'll end up with eat the delicious looking and smelling pizza. These two sentences have completely opposite meanings, so it's super important for the decoder to keep track of the significant words in the input. So, the main idea of encoder-decoder attention is to allow the decoder to keep track of the significant words in the input. Now that we know the main idea behind encoder-decoder attention, here are the details: first, to give us a little more room, let's consolidate the math and the diagrams. Now, just like we did for self-attention, we create two new values to represent the query for the EOS token in the decoder. Then we create keys for each word in the encoder, and we calculate the

similarities between the EOS token in the decoder and each word in the encoder by calculating the dot products, just like before. Then we run the similarities through a softmax function, and this tells us to use one hundred percent of the first input word and zero percent of the second when the decoder determines what should be the first translated word. Now that we know what percentage of each input word to use when determining what should be the first translated word, we calculate values for each input word and then scale those values by the softmax percentages, and then add the pairs of scaled values together to get the encoder-decoder attention values. Bam! Now to make room for the next step, let's consolidate the encoder-decoder attention in our diagram. Note: the sets of weights that we use to calculate the queries, keys, and values for encoder-decoder attention are different from the sets of weights we use for self-attention. However, just like for self-attention, the sets of weights are copied and reused for each word. This allows the Transformer to be flexible with the length of the inputs.

and outputs. And also, we can stack encode or decoder attention, just like we can stack self-attention, to keep track of words in complicated phrases. Bam! Now we add another set of residual connections that allow the encoder-decoder attention to focus on the relationships between the output words and the input words without having to preserve the self-attention or word and position encoding that happened earlier. Then we consolidate the math and the diagram. Lastly, we need a way to take these two values that represent the EOS token in the decoder and select one of the four output tokens. Ear vamos e or EOS. So we run these two values through a fully connected layer that has one input for each value that represents the current token. So in this case, we have two inputs and one output for each token in the output vocabulary, which in this case means four outputs. Note: a fully connected layer is just a simple neural network with weights (numbers we multiply the inputs by) and biases (numbers we add to the sums of the products), and when we do the math, we get four.

output values which we run through a final softmax function to select the first output word vamos. Bam note: vamos is the Spanish translation for Let's Go. Triple boom. No, not yet. So far, the translation is correct, but the decoder doesn't stop until it outputs an EOS token. So let's consolidate our diagrams and plug the translated word vamos into a copy of the decoder's embedding layer and do the math. First, we get the word embeddings for vamos. Then we add the positional encoding. Now we calculate self-attention values for vamos using the exact same weights that we used for the EOS token. Now, add the residual connections and calculate the encoder-decoder attention using the same sets of weights that we used for the EOS token. Now we add more residual connections. Lastly, we run the values that represent vamos through the same fully connected layer and softmax that we used for the EOS token. And the second output from the decoder is EOS, so we are done decoding. Triple bam. At long last, we've shown how a Transformer can encode a simple input.

phrase let's go and decode the encoding into the translated phrase of vamos. In summary, Transformers use word embedding to convert words into numbers, positional encoding to keep track of word order, self-attention to keep track of word relationships within the input and output phrases, encoder-decoder attention to keep track of things between the input and output phrases to make sure that important words in the input are not lost in the translation, and residual connections to allow each subunit like self-attention to focus on solving just one part of the problem. Now that we understand the main ideas of how Transformers work, let's talk about a few extra things we can add to them. In this example, we kept things super simple. However, if we had larger vocabularies and the original Transformer had 37,000 tokens and longer input and output phrases, then in order to get their model to work, they had to normalize the values after every step. For example, they normalize the values after positional encoding and after self-attention in both the encoder and the decoder. Also, when we calculated

attention values. We used the dot product to calculate the similarities, but you can use whatever similarity function you want. In the original Transformer manuscript, they calculated the similarities with a DOT product divided by the square root of the number of embedding values per token. Just like with scaling the values after each step, they found that scaling the dot product helped encode and decode long and complicated phrases. Lastly, to give a Transformer more weights and biases to fit to complicated data, you can add additional neural networks with hidden layers to both the encoder and decoder. Bam! Now it's time for some Shameless self-promotion. If you want to review statistics and machine learning offline, check out the StatQuest PDF study guides in my book, the Stat Quest Illustrated Guide to Machine Learning at stackwest.org. There's something for everyone. Hooray! We've made it to the end of another exciting Stat Quest. If you like this Stat Quest and want to see more, please subscribe. And if you want to support StatQuest, consider contributing to my Patreon campaign, becoming a channel member, buying one or two of my

original songs, or a t-shirt, or a hoodie, or just donate. The links are in the description below. Alright, until next time. Quest on.

Transformer Neural Networks, ChatGPT's foundation, Clearly Explained!!!

Statistics, Machine Learning and Data Science can sometimes seem like very scary topics, but since each technique is really just a combination of small and simple steps, they are actually quite simple. My goal with StatQuest is to break down the major methodologies into easy to understand pieces. That said, I don't dumb down the material. Instead, I build up your understanding so that you are smarter.

Contact, Video Index, Etc: https://statquest.org

StatQuest with Josh Starmer

이 통계 퀘스트 에피소드에서는 ChatGPT를 포함한 트랜스포머 신경망의 문장 번역 기능에 중점을 두고 설명합니다.

단어 임베딩은 활성화 함수와 가중치를 사용하여 각 단어를 표현하기 위해 신경망의 입력으로 단어를 숫자로 변환하는 일반적인 방법입니다.

이 과정을 통해 네트워크는 입력 문장에 포함된 단어의 의미를 이해하고 처리할 수 있습니다.

트랜스포머의 단어 임베딩 및 위치 인코딩

단어 임베딩을 사용하면 신경망 처리를 위해 단어를 숫자로 변환할 수 있습니다.

역전파는 훈련 중에 네트워크의 가중치를 최적화하는 데 사용됩니다.

위치 인코딩은 단어 순서를 유지하기 위해 트랜스포머에서 사용하는 기술로, 주로 사인과 코사인 함수를 번갈아 가며 사용하여 단어 임베딩에 위치 값을 할당합니다.

트랜스포머의 단어 포지셔닝과 자기 주의력 이해하기

위치 인코딩을 사용하면 단어 임베딩에 고유한 위치 값을 추가하여 어순이 변경되더라도 문장에서 단어의 순서를 유지할 수 있습니다.

자기 주의는 문장에서 단어 간의 유사성을 계산하여 각 단어가 인코딩되는 방식을 결정하고 모델이 단어 간의 관계를 이해할 수 있도록 하는 Transformers의 핵심 메커니즘입니다.

자체 주의는 각 단어와 자신을 포함한 문장의 다른 모든 단어와의 유사성을 평가하고 이러한 유사성을 사용하여 연관성을 기반으로 각 단어를 인코딩하여 올바른 단어 관계를 포착하는 방식으로 작동합니다.

트랜스포머에서 자기 주의 계산하기

쿼리 값은 "가자"와 "가자"의 유사도를 점 곱으로 계산하는 데 사용되며, "가자"의 유사도가 "가"보다 더 큽니다.

그런 다음 소프트맥스 함수를 적용하여 "가자"를 인코딩하는 데 사용할 각 입력 단어의 비율을 결정하여 자체 주의도 값을 산출합니다.

"가자"라는 단어에 대해서도 기존 키와 값을 사용하여 동일한 과정을 반복하여 자기 관심도 값을 얻습니다.

트랜스포머 아키텍처 이해: 기본 사항

트랜스포머는 모든 단어에 대해 동일한 가중치를 사용하여 병렬 계산과 빠른 처리를 가능하게 합니다.

자체 주의 메커니즘을 통해 각 단어는 입력된 다른 모든 단어와의 관계를 파악하여 문맥적 연결을 설정할 수 있습니다.

Transformer의 인코더 구성 요소는 단어 임베딩, 위치 인코딩, 자기 주의, 잔여 연결로 구성되어 있어 병렬 학습을 위해 단어 수와 관계를 효율적으로 인코딩할 수 있습니다.

트랜스포머 모델에서 자기 주의의 중요성

트랜스포머 모델은 단일 유닛을 사용해 각 입력 단어를 동시에 처리하므로 단어 임베딩, 위치 인코딩, 쿼리, 키 및 값을 효율적으로 계산할 수 있습니다.

모든 단어를 동시에 계산하는 이 모델은 특히 컴퓨팅 코어가 여러 개 있는 하드웨어에서 많은 수의 단어를 빠르게 처리할 수 있습니다.

트랜스포머가 번역 중에 입력 문장과 출력 문장 사이의 관계뿐만 아니라 문장 내 단어 간의 관계를 추적하려면 자체 주의가 매우 중요합니다.

인코더-디코더 주의 기능을 사용하면 디코더가 입력에서 중요한 단어에 집중할 수 있으므로 번역 과정에서 중요한 정보를 유지할 수 있습니다.

트랜스포머에서 주의도 및 번역 계산하기

첫 번째 번역된 단어를 결정하는 과정에는 디코더의 EOS 토큰과 인코더의 각 단어 간의 유사성을 계산하고, 소프트맥스 함수를 통해 결과를 실행하고, 백분율을 사용하여 인코더-디코더 주의의 스케일링된 값을 결합하는 것이 포함됩니다.

그런 다음 트랜스포머는 완전히 연결된 레이어와 소프트맥스 함수를 사용하여 다음 출력 단어를 선택하고, 디코딩 프로세스의 끝을 의미하는 EOS 토큰을 출력할 때까지 프로세스를 계속 진행합니다.

이는 트랜스포머가 다이어그램과 수학적 계산을 통해 간단한 입력을 효과적으로 인코딩하는 방법을 보여줍니다.

트랜스포머는 단어 임베딩을 사용하여 단어를 숫자로 변환하고 위치 인코딩을 사용하여 어순을 유지합니다.

자체 주의는 단어 관계를 추적하는 데 사용되며, 인코더-디코더 주의는 입력에서 중요한 단어가 번역 과정에서 손실되지 않도록 보장합니다.

값 정규화, 도트 곱 스케일링, 숨겨진 레이어가 있는 신경망 추가는 모델의 성능을 개선하는 데 사용되는 추가 기술입니다.