liqiang
b119135836
Build latest book artifacts / build (push) Canceled after 0s
dependency resolution / resolve (3.11) (push) Canceled after 0s
dependency resolution / resolve (3.13) (push) Canceled after 0s
deploy-pages / build (push) Canceled after 0s
deploy-pages / deploy (push) Canceled after 0s
i18n consistency check / check (push) Canceled after 0s
provider adoption tests / test (chapter2/context-compression) (push) Canceled after 0s
provider adoption tests / test (chapter2/prompt-injection) (push) Canceled after 0s
provider adoption tests / test (chapter2/system-hint) (push) Canceled after 0s
provider adoption tests / test (chapter3/log-sanitization) (push) Canceled after 0s
web-search-agent tests / test (push) Canceled after 0s
web-search-agent tests / agentbook (push) Canceled after 0s
1367 lines
229 KiB
JSON
1367 lines
229 KiB
JSON
[
|
||
{
|
||
"meter": "Proposer(纯文本)",
|
||
"called_at_utc": "2026-07-29T21:44:34.781917+00:00",
|
||
"latency_s": 242.697,
|
||
"request": {
|
||
"model": "doubao-seed-1-6-250615",
|
||
"messages": [
|
||
{
|
||
"role": "system",
|
||
"content": "你是一名擅长把学术论文转化为演示文稿的 Proposer Agent。\n你用 Slidev 框架（Markdown + HTML）编写 PPT 源码 slides.md。\n\nSlidev 语法要点：\n- 文件开头是 YAML frontmatter（--- 包裹），设置 theme: default。\n- 用单独一行的 `---`（前后空行）分隔每一页幻灯片。\n- 首页通常放标题、作者、会议。\n- 引用图片用 markdown：，可用 HTML 控制尺寸，\n 例如 <img src=\"/speedup_bar.png\" class=\"h-60 mx-auto\" />。\n- 可用 Windi/Uno CSS 工具类控制排版（如 text-sm、grid grid-cols-2 gap-4）。\n\n要求：\n- 最终生成 10-20 页，覆盖论文的标题、背景/动机、方法、实验结果、局限与结论。\n- 至少在 3 页中使用提供的图表/表格，且图文匹配。\n- 每页信息量适中、不要塞太多字，宁可拆页也不要溢出。\n- 只输出 slides.md 的完整内容，用 ```markdown 代码块包裹，不要额外解释。"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": "以下是论文全文（Markdown）：\n\n# Attention Is All You Need\n\nAuthors: Ashish Vaswani et al.\n\n\n## PDF page 1\n\nProvided proper attribution is provided, Google hereby grants permission to\nreproduce the tables and figures in this paper solely for use in journalistic or\nscholarly works.\nAttention Is All You Need\nAshish Vaswani∗\nGoogle Brain\navaswani@google.com\nNoam Shazeer∗\nGoogle Brain\nnoam@google.com\nNiki Parmar∗\nGoogle Research\nnikip@google.com\nJakob Uszkoreit∗\nGoogle Research\nusz@google.com\nLlion Jones∗\nGoogle Research\nllion@google.com\nAidan N. Gomez∗†\nUniversity of Toronto\naidan@cs.toronto.edu\nŁukasz Kaiser∗\nGoogle Brain\nlukaszkaiser@google.com\nIllia Polosukhin∗‡\nillia.polosukhin@gmail.com\nAbstract\nThe dominant sequence transduction models are based on complex recurrent or\nconvolutional neural networks that include an encoder and a decoder. The best\nperforming models also connect the encoder and decoder through an attention\nmechanism. We propose a new simple network architecture, the Transformer,\nbased solely on attention mechanisms, dispensing with recurrence and convolutions\nentirely. Experiments on two machine translation tasks show these models to\nbe superior in quality while being more parallelizable and requiring significantly\nless time to train. Our model achieves 28.4 BLEU on the WMT 2014 English-\nto-German translation task, improving over the existing best results, including\nensembles, by over 2 BLEU. On the WMT 2014 English-to-French translation task,\nour model establishes a new single-model state-of-the-art BLEU score of 41.8 after\ntraining for 3.5 days on eight GPUs, a small fraction of the training costs of the\nbest models from the literature. We show that the Transformer generalizes well to\nother tasks by applying it successfully to English constituency parsing both with\nlarge and limited training data.\n∗Equal contribution. Listing order is random. Jakob proposed replacing RNNs with self-attention and started\nthe effort to evaluate this idea. Ashish, with Illia, designed and implemented the first Transformer models and\nhas been crucially involved in every aspect of this work. Noam proposed scaled dot-product attention, multi-head\nattention and the parameter-free position representation and became the other person involved in nearly every\ndetail. Niki designed, implemented, tuned and evaluated countless model variants in our original codebase and\ntensor2tensor. Llion also experimented with novel model variants, was responsible for our initial codebase, and\nefficient inference and visualizations. Lukasz and Aidan spent countless long days designing various parts of and\nimplementing tensor2tensor, replacing our earlier codebase, greatly improving results and massively accelerating\nour research.\n†Work performed while at Google Brain.\n‡Work performed while at Google Research.\n31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA.\narXiv:1706.03762v7 [cs.CL] 2 Aug 2023\n\n\n## PDF page 2\n\n1\nIntroduction\nRecurrent neural networks, long short-term memory [13] and gated recurrent [7] neural networks\nin particular, have been firmly established as state of the art approaches in sequence modeling and\ntransduction problems such as language modeling and machine translation [35, 2, 5]. Numerous\nefforts have since continued to push the boundaries of recurrent language models and encoder-decoder\narchitectures [38, 24, 15].\nRecurrent models typically factor computation along the symbol positions of the input and output\nsequences. Aligning the positions to steps in computation time, they generate a sequence of hidden\nstates ht, as a function of the previous hidden state ht−1 and the input for position t. This inherently\nsequential nature precludes parallelization within training examples, which becomes critical at longer\nsequence lengths, as memory constraints limit batching across examples. Recent work has achieved\nsignificant improvements in computational efficiency through factorization tricks [21] and conditional\ncomputation [32], while also improving model performance in case of the latter. The fundamental\nconstraint of sequential computation, however, remains.\nAttention mechanisms have become an integral part of compelling sequence modeling and transduc-\ntion models in various tasks, allowing modeling of dependencies without regard to their distance in\nthe input or output sequences [2, 19]. In all but a few cases [27], however, such attention mechanisms\nare used in conjunction with a recurrent network.\nIn this work we propose the Transformer, a model architecture eschewing recurrence and instead\nrelying entirely on an attention mechanism to draw global dependencies between input and output.\nThe Transformer allows for significantly more parallelization and can reach a new state of the art in\ntranslation quality after being trained for as little as twelve hours on eight P100 GPUs.\n2\nBackground\nThe goal of reducing sequential computation also forms the foundation of the Extended Neural GPU\n[16], ByteNet [18] and ConvS2S [9], all of which use convolutional neural networks as basic building\nblock, computing hidden representations in parallel for all input and output positions. In these models,\nthe number of operations required to relate signals from two arbitrary input or output positions grows\nin the distance between positions, linearly for ConvS2S and logarithmically for ByteNet. This makes\nit more difficult to learn dependencies between distant positions [12]. In the Transformer this is\nreduced to a constant number of operations, albeit at the cost of reduced effective resolution due\nto averaging attention-weighted positions, an effect we counteract with Multi-Head Attention as\ndescribed in section 3.2.\nSelf-attention, sometimes called intra-attention is an attention mechanism relating different positions\nof a single sequence in order to compute a representation of the sequence. Self-attention has been\nused successfully in a variety of tasks including reading comprehension, abstractive summarization,\ntextual entailment and learning task-independent sentence representations [4, 27, 28, 22].\nEnd-to-end memory networks are based on a recurrent attention mechanism instead of sequence-\naligned recurrence and have been shown to perform well on simple-language question answering and\nlanguage modeling tasks [34].\nTo the best of our knowledge, however, the Transformer is the first transduction model relying\nentirely on self-attention to compute representations of its input and output without using sequence-\naligned RNNs or convolution. In the following sections, we will describe the Transformer, motivate\nself-attention and discuss its advantages over models such as [17, 18] and [9].\n3\nModel Architecture\nMost competitive neural sequence transduction models have an encoder-decoder structure [5, 2, 35].\nHere, the encoder maps an input sequence of symbol representations (x1, ..., xn) to a sequence\nof continuous representations z = (z1, ..., zn). Given z, the decoder then generates an output\nsequence (y1, ..., ym) of symbols one element at a time. At each step the model is auto-regressive\n[10], consuming the previously generated symbols as additional input when generating the next.\n2\n\n\n## PDF page 3\n\nFigure 1: The Transformer - model architecture.\nThe Transformer follows this overall architecture using stacked self-attention and point-wise, fully\nconnected layers for both the encoder and decoder, shown in the left and right halves of Figure 1,\nrespectively.\n3.1\nEncoder and Decoder Stacks\nEncoder:\nThe encoder is composed of a stack of N = 6 identical layers. Each layer has two\nsub-layers. The first is a multi-head self-attention mechanism, and the second is a simple, position-\nwise fully connected feed-forward network. We employ a residual connection [11] around each of\nthe two sub-layers, followed by layer normalization [1]. That is, the output of each sub-layer is\nLayerNorm(x + Sublayer(x)), where Sublayer(x) is the function implemented by the sub-layer\nitself. To facilitate these residual connections, all sub-layers in the model, as well as the embedding\nlayers, produce outputs of dimension dmodel = 512.\nDecoder:\nThe decoder is also composed of a stack of N = 6 identical layers. In addition to the two\nsub-layers in each encoder layer, the decoder inserts a third sub-layer, which performs multi-head\nattention over the output of the encoder stack. Similar to the encoder, we employ residual connections\naround each of the sub-layers, followed by layer normalization. We also modify the self-attention\nsub-layer in the decoder stack to prevent positions from attending to subsequent positions. This\nmasking, combined with fact that the output embeddings are offset by one position, ensures that the\npredictions for position i can depend only on the known outputs at positions less than i.\n3.2\nAttention\nAn attention function can be described as mapping a query and a set of key-value pairs to an output,\nwhere the query, keys, values, and output are all vectors. The output is computed as a weighted sum\n3\n\n\n## PDF page 4\n\nScaled Dot-Product Attention\nMulti-Head Attention\nFigure 2: (left) Scaled Dot-Product Attention. (right) Multi-Head Attention consists of several\nattention layers running in parallel.\nof the values, where the weight assigned to each value is computed by a compatibility function of the\nquery with the corresponding key.\n3.2.1\nScaled Dot-Product Attention\nWe call our particular attention \"Scaled Dot-Product Attention\" (Figure 2). The input consists of\nqueries and keys of dimension dk, and values of dimension dv. We compute the dot products of the\nquery with all keys, divide each by √dk, and apply a softmax function to obtain the weights on the\nvalues.\nIn practice, we compute the attention function on a set of queries simultaneously, packed together\ninto a matrix Q. The keys and values are also packed together into matrices K and V . We compute\nthe matrix of outputs as:\nAttention(Q, K, V ) = softmax(QKT\n√dk\n)V\n(1)\nThe two most commonly used attention functions are additive attention [2], and dot-product (multi-\nplicative) attention. Dot-product attention is identical to our algorithm, except for the scaling factor\nof\n1\n√dk . Additive attention computes the compatibility function using a feed-forward network with\na single hidden layer. While the two are similar in theoretical complexity, dot-product attention is\nmuch faster and more space-efficient in practice, since it can be implemented using highly optimized\nmatrix multiplication code.\nWhile for small values of dk the two mechanisms perform similarly, additive attention outperforms\ndot product attention without scaling for larger values of dk [3]. We suspect that for large values of\ndk, the dot products grow large in magnitude, pushing the softmax function into regions where it has\nextremely small gradients 4. To counteract this effect, we scale the dot products by\n1\n√dk .\n3.2.2\nMulti-Head Attention\nInstead of performing a single attention function with dmodel-dimensional keys, values and queries,\nwe found it beneficial to linearly project the queries, keys and values h times with different, learned\nlinear projections to dk, dk and dv dimensions, respectively. On each of these projected versions of\nqueries, keys and values we then perform the attention function in parallel, yielding dv-dimensional\n4To illustrate why the dot products get large, assume that the components of q and k are independent random\nvariables with mean 0 and variance 1. Then their dot product, q · k = Pdk\ni=1 qiki, has mean 0 and variance dk.\n4\n\n\n## PDF page 5\n\noutput values. These are concatenated and once again projected, resulting in the final values, as\ndepicted in Figure 2.\nMulti-head attention allows the model to jointly attend to information from different representation\nsubspaces at different positions. With a single attention head, averaging inhibits this.\nMultiHead(Q, K, V ) = Concat(head1, ..., headh)W O\nwhere headi = Attention(QW Q\ni , KW K\ni , V W V\ni )\nWhere the projections are parameter matrices W Q\ni\n∈Rdmodel×dk, W K\ni\n∈Rdmodel×dk, W V\ni\n∈Rdmodel×dv\nand W O ∈Rhdv×dmodel.\nIn this work we employ h = 8 parallel attention layers, or heads. For each of these we use\ndk = dv = dmodel/h = 64. Due to the reduced dimension of each head, the total computational cost\nis similar to that of single-head attention with full dimensionality.\n3.2.3\nApplications of Attention in our Model\nThe Transformer uses multi-head attention in three different ways:\n• In \"encoder-decoder attention\" layers, the queries come from the previous decoder layer,\nand the memory keys and values come from the output of the encoder. This allows every\nposition in the decoder to attend over all positions in the input sequence. This mimics the\ntypical encoder-decoder attention mechanisms in sequence-to-sequence models such as\n[38, 2, 9].\n• The encoder contains self-attention layers. In a self-attention layer all of the keys, values\nand queries come from the same place, in this case, the output of the previous layer in the\nencoder. Each position in the encoder can attend to all positions in the previous layer of the\nencoder.\n• Similarly, self-attention layers in the decoder allow each position in the decoder to attend to\nall positions in the decoder up to and including that position. We need to prevent leftward\ninformation flow in the decoder to preserve the auto-regressive property. We implement this\ninside of scaled dot-product attention by masking out (setting to −∞) all values in the input\nof the softmax which correspond to illegal connections. See Figure 2.\n3.3\nPosition-wise Feed-Forward Networks\nIn addition to attention sub-layers, each of the layers in our encoder and decoder contains a fully\nconnected feed-forward network, which is applied to each position separately and identically. This\nconsists of two linear transformations with a ReLU activation in between.\nFFN(x) = max(0, xW1 + b1)W2 + b2\n(2)\nWhile the linear transformations are the same across different positions, they use different parameters\nfrom layer to layer. Another way of describing this is as two convolutions with kernel size 1.\nThe dimensionality of input and output is dmodel = 512, and the inner-layer has dimensionality\ndff = 2048.\n3.4\nEmbeddings and Softmax\nSimilarly to other sequence transduction models, we use learned embeddings to convert the input\ntokens and output tokens to vectors of dimension dmodel. We also use the usual learned linear transfor-\nmation and softmax function to convert the decoder output to predicted next-token probabilities. In\nour model, we share the same weight matrix between the two embedding layers and the pre-softmax\nlinear transformation, similar to [30]. In the embedding layers, we multiply those weights by √dmodel.\n5\n\n\n## PDF page 6\n\nTable 1: Maximum path lengths, per-layer complexity and minimum number of sequential operations\nfor different layer types. n is the sequence length, d is the representation dimension, k is the kernel\nsize of convolutions and r the size of the neighborhood in restricted self-attention.\nLayer Type\nComplexity per Layer\nSequential\nMaximum Path Length\nOperations\nSelf-Attention\nO(n2 · d)\nO(1)\nO(1)\nRecurrent\nO(n · d2)\nO(n)\nO(n)\nConvolutional\nO(k · n · d2)\nO(1)\nO(logk(n))\nSelf-Attention (restricted)\nO(r · n · d)\nO(1)\nO(n/r)\n3.5\nPositional Encoding\nSince our model contains no recurrence and no convolution, in order for the model to make use of the\norder of the sequence, we must inject some information about the relative or absolute position of the\ntokens in the sequence. To this end, we add \"positional encodings\" to the input embeddings at the\nbottoms of the encoder and decoder stacks. The positional encodings have the same dimension dmodel\nas the embeddings, so that the two can be summed. There are many choices of positional encodings,\nlearned and fixed [9].\nIn this work, we use sine and cosine functions of different frequencies:\nPE(pos,2i) = sin(pos/100002i/dmodel)\nPE(pos,2i+1) = cos(pos/100002i/dmodel)\nwhere pos is the position and i is the dimension. That is, each dimension of the positional encoding\ncorresponds to a sinusoid. The wavelengths form a geometric progression from 2π to 10000 · 2π. We\nchose this function because we hypothesized it would allow the model to easily learn to attend by\nrelative positions, since for any fixed offset k, PEpos+k can be represented as a linear function of\nPEpos.\nWe also experimented with using learned positional embeddings [9] instead, and found that the two\nversions produced nearly identical results (see Table 3 row (E)). We chose the sinusoidal version\nbecause it may allow the model to extrapolate to sequence lengths longer than the ones encountered\nduring training.\n4\nWhy Self-Attention\nIn this section we compare various aspects of self-attention layers to the recurrent and convolu-\ntional layers commonly used for mapping one variable-length sequence of symbol representations\n(x1, ..., xn) to another sequence of equal length (z1, ..., zn), with xi, zi ∈Rd, such as a hidden\nlayer in a typical sequence transduction encoder or decoder. Motivating our use of self-attention we\nconsider three desiderata.\nOne is the total computational complexity per layer. Another is the amount of computation that can\nbe parallelized, as measured by the minimum number of sequential operations required.\nThe third is the path length between long-range dependencies in the network. Learning long-range\ndependencies is a key challenge in many sequence transduction tasks. One key factor affecting the\nability to learn such dependencies is the length of the paths forward and backward signals have to\ntraverse in the network. The shorter these paths between any combination of positions in the input\nand output sequences, the easier it is to learn long-range dependencies [12]. Hence we also compare\nthe maximum path length between any two input and output positions in networks composed of the\ndifferent layer types.\nAs noted in Table 1, a self-attention layer connects all positions with a constant number of sequentially\nexecuted operations, whereas a recurrent layer requires O(n) sequential operations. In terms of\ncomputational complexity, self-attention layers are faster than recurrent layers when the sequence\n6\n\n\n## PDF page 7\n\nlength n is smaller than the representation dimensionality d, which is most often the case with\nsentence representations used by state-of-the-art models in machine translations, such as word-piece\n[38] and byte-pair [31] representations. To improve computational performance for tasks involving\nvery long sequences, self-attention could be restricted to considering only a neighborhood of size r in\nthe input sequence centered around the respective output position. This would increase the maximum\npath length to O(n/r). We plan to investigate this approach further in future work.\nA single convolutional layer with kernel width k < n does not connect all pairs of input and output\npositions. Doing so requires a stack of O(n/k) convolutional layers in the case of contiguous kernels,\nor O(logk(n)) in the case of dilated convolutions [18], increasing the length of the longest paths\nbetween any two positions in the network. Convolutional layers are generally more expensive than\nrecurrent layers, by a factor of k. Separable convolutions [6], however, decrease the complexity\nconsiderably, to O(k · n · d + n · d2). Even with k = n, however, the complexity of a separable\nconvolution is equal to the combination of a self-attention layer and a point-wise feed-forward layer,\nthe approach we take in our model.\nAs side benefit, self-attention could yield more interpretable models. We inspect attention distributions\nfrom our models and present and discuss examples in the appendix. Not only do individual attention\nheads clearly learn to perform different tasks, many appear to exhibit behavior related to the syntactic\nand semantic structure of the sentences.\n5\nTraining\nThis section describes the training regime for our models.\n5.1\nTraining Data and Batching\nWe trained on the standard WMT 2014 English-German dataset consisting of about 4.5 million\nsentence pairs. Sentences were encoded using byte-pair encoding [3], which has a shared source-\ntarget vocabulary of about 37000 tokens. For English-French, we used the significantly larger WMT\n2014 English-French dataset consisting of 36M sentences and split tokens into a 32000 word-piece\nvocabulary [38]. Sentence pairs were batched together by approximate sequence length. Each training\nbatch contained a set of sentence pairs containing approximately 25000 source tokens and 25000\ntarget tokens.\n5.2\nHardware and Schedule\nWe trained our models on one machine with 8 NVIDIA P100 GPUs. For our base models using\nthe hyperparameters described throughout the paper, each training step took about 0.4 seconds. We\ntrained the base models for a total of 100,000 steps or 12 hours. For our big models,(described on the\nbottom line of table 3), step time was 1.0 seconds. The big models were trained for 300,000 steps\n(3.5 days).\n5.3\nOptimizer\nWe used the Adam optimizer [20] with β1 = 0.9, β2 = 0.98 and ϵ = 10−9. We varied the learning\nrate over the course of training, according to the formula:\nlrate = d−0.5\nmodel · min(step_num−0.5, step_num · warmup_steps−1.5)\n(3)\nThis corresponds to increasing the learning rate linearly for the first warmup_steps training steps,\nand decreasing it thereafter proportionally to the inverse square root of the step number. We used\nwarmup_steps = 4000.\n5.4\nRegularization\nWe employ three types of regularization during training:\n7\n\n\n## PDF page 8\n\nTable 2: The Transformer achieves better BLEU scores than previous state-of-the-art models on the\nEnglish-to-German and English-to-French newstest2014 tests at a fraction of the training cost.\nModel\nBLEU\nTraining Cost (FLOPs)\nEN-DE\nEN-FR\nEN-DE\nEN-FR\nByteNet [18]\n23.75\nDeep-Att + PosUnk [39]\n39.2\n1.0 · 1020\nGNMT + RL [38]\n24.6\n39.92\n2.3 · 1019\n1.4 · 1020\nConvS2S [9]\n25.16\n40.46\n9.6 · 1018\n1.5 · 1020\nMoE [32]\n26.03\n40.56\n2.0 · 1019\n1.2 · 1020\nDeep-Att + PosUnk Ensemble [39]\n40.4\n8.0 · 1020\nGNMT + RL Ensemble [38]\n26.30\n41.16\n1.8 · 1020\n1.1 · 1021\nConvS2S Ensemble [9]\n26.36\n41.29\n7.7 · 1019\n1.2 · 1021\nTransformer (base model)\n27.3\n38.1\n3.3 · 1018\nTransformer (big)\n28.4\n41.8\n2.3 · 1019\nResidual Dropout\nWe apply dropout [33] to the output of each sub-layer, before it is added to the\nsub-layer input and normalized. In addition, we apply dropout to the sums of the embeddings and the\npositional encodings in both the encoder and decoder stacks. For the base model, we use a rate of\nPdrop = 0.1.\nLabel Smoothing\nDuring training, we employed label smoothing of value ϵls = 0.1 [36]. This\nhurts perplexity, as the model learns to be more unsure, but improves accuracy and BLEU score.\n6\nResults\n6.1\nMachine Translation\nOn the WMT 2014 English-to-German translation task, the big transformer model (Transformer (big)\nin Table 2) outperforms the best previously reported models (including ensembles) by more than 2.0\nBLEU, establishing a new state-of-the-art BLEU score of 28.4. The configuration of this model is\nlisted in the bottom line of Table 3. Training took 3.5 days on 8 P100 GPUs. Even our base model\nsurpasses all previously published models and ensembles, at a fraction of the training cost of any of\nthe competitive models.\nOn the WMT 2014 English-to-French translation task, our big model achieves a BLEU score of 41.0,\noutperforming all of the previously published single models, at less than 1/4 the training cost of the\nprevious state-of-the-art model. The Transformer (big) model trained for English-to-French used\ndropout rate Pdrop = 0.1, instead of 0.3.\nFor the base models, we used a single model obtained by averaging the last 5 checkpoints, which\nwere written at 10-minute intervals. For the big models, we averaged the last 20 checkpoints. We\nused beam search with a beam size of 4 and length penalty α = 0.6 [38]. These hyperparameters\nwere chosen after experimentation on the development set. We set the maximum output length during\ninference to input length + 50, but terminate early when possible [38].\nTable 2 summarizes our results and compares our translation quality and training costs to other model\narchitectures from the literature. We estimate the number of floating point operations used to train a\nmodel by multiplying the training time, the number of GPUs used, and an estimate of the sustained\nsingle-precision floating-point capacity of each GPU 5.\n6.2\nModel Variations\nTo evaluate the importance of different components of the Transformer, we varied our base model\nin different ways, measuring the change in performance on English-to-German translation on the\n5We used values of 2.8, 3.7, 6.0 and 9.5 TFLOPS for K80, K40, M40 and P100, respectively.\n8\n\n\n## PDF page 9\n\nTable 3: Variations on the Transformer architecture. Unlisted values are identical to those of the base\nmodel. All metrics are on the English-to-German translation development set, newstest2013. Listed\nperplexities are per-wordpiece, according to our byte-pair encoding, and should not be compared to\nper-word perplexities.\nN\ndmodel\ndff\nh\ndk\ndv\nPdrop\nϵls\ntrain\nPPL\nBLEU\nparams\nsteps\n(dev)\n(dev)\n×106\nbase\n6\n512\n2048\n8\n64\n64\n0.1\n0.1\n100K\n4.92\n25.8\n65\n(A)\n1\n512\n512\n5.29\n24.9\n4\n128\n128\n5.00\n25.5\n16\n32\n32\n4.91\n25.8\n32\n16\n16\n5.01\n25.4\n(B)\n16\n5.16\n25.1\n58\n32\n5.01\n25.4\n60\n(C)\n2\n6.11\n23.7\n36\n4\n5.19\n25.3\n50\n8\n4.88\n25.5\n80\n256\n32\n32\n5.75\n24.5\n28\n1024\n128\n128\n4.66\n26.0\n168\n1024\n5.12\n25.4\n53\n4096\n4.75\n26.2\n90\n(D)\n0.0\n5.77\n24.6\n0.2\n4.95\n25.5\n0.0\n4.67\n25.3\n0.2\n5.47\n25.7\n(E)\npositional embedding instead of sinusoids\n4.92\n25.7\nbig\n6\n1024\n4096\n16\n0.3\n300K\n4.33\n26.4\n213\ndevelopment set, newstest2013. We used beam search as described in the previous section, but no\ncheckpoint averaging. We present these results in Table 3.\nIn Table 3 rows (A), we vary the number of attention heads and the attention key and value dimensions,\nkeeping the amount of computation constant, as described in Section 3.2.2. While single-head\nattention is 0.9 BLEU worse than the best setting, quality also drops off with too many heads.\nIn Table 3 rows (B), we observe that reducing the attention key size dk hurts model quality. This\nsuggests that determining compatibility is not easy and that a more sophisticated compatibility\nfunction than dot product may be beneficial. We further observe in rows (C) and (D) that, as expected,\nbigger models are better, and dropout is very helpful in avoiding over-fitting. In row (E) we replace our\nsinusoidal positional encoding with learned positional embeddings [9], and observe nearly identical\nresults to the base model.\n6.3\nEnglish Constituency Parsing\nTo evaluate if the Transformer can generalize to other tasks we performed experiments on English\nconstituency parsing. This task presents specific challenges: the output is subject to strong structural\nconstraints and is significantly longer than the input. Furthermore, RNN sequence-to-sequence\nmodels have not been able to attain state-of-the-art results in small-data regimes [37].\nWe trained a 4-layer transformer with dmodel = 1024 on the Wall Street Journal (WSJ) portion of the\nPenn Treebank [25], about 40K training sentences. We also trained it in a semi-supervised setting,\nusing the larger high-confidence and BerkleyParser corpora from with approximately 17M sentences\n[37]. We used a vocabulary of 16K tokens for the WSJ only setting and a vocabulary of 32K tokens\nfor the semi-supervised setting.\nWe performed only a small number of experiments to select the dropout, both attention and residual\n(section 5.4), learning rates and beam size on the Section 22 development set, all other parameters\nremained unchanged from the English-to-German base translation model. During inference, we\n9\n\n\n## PDF page 10\n\nTable 4: The Transformer generalizes well to English constituency parsing (Results are on Section 23\nof WSJ)\nParser\nTraining\nWSJ 23 F1\nVinyals & Kaiser el al. (2014) [37]\nWSJ only, discriminative\n88.3\nPetrov et al. (2006) [29]\nWSJ only, discriminative\n90.4\nZhu et al. (2013) [40]\nWSJ only, discriminative\n90.4\nDyer et al. (2016) [8]\nWSJ only, discriminative\n91.7\nTransformer (4 layers)\nWSJ only, discriminative\n91.3\nZhu et al. (2013) [40]\nsemi-supervised\n91.3\nHuang & Harper (2009) [14]\nsemi-supervised\n91.3\nMcClosky et al. (2006) [26]\nsemi-supervised\n92.1\nVinyals & Kaiser el al. (2014) [37]\nsemi-supervised\n92.1\nTransformer (4 layers)\nsemi-supervised\n92.7\nLuong et al. (2015) [23]\nmulti-task\n93.0\nDyer et al. (2016) [8]\ngenerative\n93.3\nincreased the maximum output length to input length + 300. We used a beam size of 21 and α = 0.3\nfor both WSJ only and the semi-supervised setting.\nOur results in Table 4 show that despite the lack of task-specific tuning our model performs sur-\nprisingly well, yielding better results than all previously reported models with the exception of the\nRecurrent Neural Network Grammar [8].\nIn contrast to RNN sequence-to-sequence models [37], the Transformer outperforms the Berkeley-\nParser [29] even when training only on the WSJ training set of 40K sentences.\n7\nConclusion\nIn this work, we presented the Transformer, the first sequence transduction model based entirely on\nattention, replacing the recurrent layers most commonly used in encoder-decoder architectures with\nmulti-headed self-attention.\nFor translation tasks, the Transformer can be trained significantly faster than architectures based\non recurrent or convolutional layers. On both WMT 2014 English-to-German and WMT 2014\nEnglish-to-French translation tasks, we achieve a new state of the art. In the former task our best\nmodel outperforms even all previously reported ensembles.\nWe are excited about the future of attention-based models and plan to apply them to other tasks. We\nplan to extend the Transformer to problems involving input and output modalities other than text and\nto investigate local, restricted attention mechanisms to efficiently handle large inputs and outputs\nsuch as images, audio and video. Making generation less sequential is another research goals of ours.\nThe code we used to train and evaluate our models is available at https://github.com/\ntensorflow/tensor2tensor.\nAcknowledgements\nWe are grateful to Nal Kalchbrenner and Stephan Gouws for their fruitful\ncomments, corrections and inspiration.\nReferences\n[1] Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint\narXiv:1607.06450, 2016.\n[2] Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly\nlearning to align and translate. CoRR, abs/1409.0473, 2014.\n[3] Denny Britz, Anna Goldie, Minh-Thang Luong, and Quoc V. Le. Massive exploration of neural\nmachine translation architectures. CoRR, abs/1703.03906, 2017.\n[4] Jianpeng Cheng, Li Dong, and Mirella Lapata. Long short-term memory-networks for machine\nreading. arXiv preprint arXiv:1601.06733, 2016.\n10\n\n\n## PDF page 11\n\n[5] Kyunghyun Cho, Bart van Merrienboer, Caglar Gulcehre, Fethi Bougares, Holger Schwenk,\nand Yoshua Bengio. Learning phrase representations using rnn encoder-decoder for statistical\nmachine translation. CoRR, abs/1406.1078, 2014.\n[6] Francois Chollet. Xception: Deep learning with depthwise separable convolutions. arXiv\npreprint arXiv:1610.02357, 2016.\n[7] Junyoung Chung, Çaglar Gülçehre, Kyunghyun Cho, and Yoshua Bengio. Empirical evaluation\nof gated recurrent neural networks on sequence modeling. CoRR, abs/1412.3555, 2014.\n[8] Chris Dyer, Adhiguna Kuncoro, Miguel Ballesteros, and Noah A. Smith. Recurrent neural\nnetwork grammars. In Proc. of NAACL, 2016.\n[9] Jonas Gehring, Michael Auli, David Grangier, Denis Yarats, and Yann N. Dauphin. Convolu-\ntional sequence to sequence learning. arXiv preprint arXiv:1705.03122v2, 2017.\n[10] Alex Graves.\nGenerating sequences with recurrent neural networks.\narXiv preprint\narXiv:1308.0850, 2013.\n[11] Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for im-\nage recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern\nRecognition, pages 770–778, 2016.\n[12] Sepp Hochreiter, Yoshua Bengio, Paolo Frasconi, and Jürgen Schmidhuber. Gradient flow in\nrecurrent nets: the difficulty of learning long-term dependencies, 2001.\n[13] Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory. Neural computation,\n9(8):1735–1780, 1997.\n[14] Zhongqiang Huang and Mary Harper. Self-training PCFG grammars with latent annotations\nacross languages. In Proceedings of the 2009 Conference on Empirical Methods in Natural\nLanguage Processing, pages 832–841. ACL, August 2009.\n[15] Rafal Jozefowicz, Oriol Vinyals, Mike Schuster, Noam Shazeer, and Yonghui Wu. Exploring\nthe limits of language modeling. arXiv preprint arXiv:1602.02410, 2016.\n[16] Łukasz Kaiser and Samy Bengio. Can active memory replace attention? In Advances in Neural\nInformation Processing Systems, (NIPS), 2016.\n[17] Łukasz Kaiser and Ilya Sutskever. Neural GPUs learn algorithms. In International Conference\non Learning Representations (ICLR), 2016.\n[18] Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Ko-\nray Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099v2,\n2017.\n[19] Yoon Kim, Carl Denton, Luong Hoang, and Alexander M. Rush. Structured attention networks.\nIn International Conference on Learning Representations, 2017.\n[20] Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015.\n[21] Oleksii Kuchaiev and Boris Ginsburg. Factorization tricks for LSTM networks. arXiv preprint\narXiv:1703.10722, 2017.\n[22] Zhouhan Lin, Minwei Feng, Cicero Nogueira dos Santos, Mo Yu, Bing Xiang, Bowen\nZhou, and Yoshua Bengio. A structured self-attentive sentence embedding. arXiv preprint\narXiv:1703.03130, 2017.\n[23] Minh-Thang Luong, Quoc V. Le, Ilya Sutskever, Oriol Vinyals, and Lukasz Kaiser. Multi-task\nsequence to sequence learning. arXiv preprint arXiv:1511.06114, 2015.\n[24] Minh-Thang Luong, Hieu Pham, and Christopher D Manning. Effective approaches to attention-\nbased neural machine translation. arXiv preprint arXiv:1508.04025, 2015.\n11\n\n\n## PDF page 12\n\n[25] Mitchell P Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. Building a large annotated\ncorpus of english: The penn treebank. Computational linguistics, 19(2):313–330, 1993.\n[26] David McClosky, Eugene Charniak, and Mark Johnson. Effective self-training for parsing. In\nProceedings of the Human Language Technology Conference of the NAACL, Main Conference,\npages 152–159. ACL, June 2006.\n[27] Ankur Parikh, Oscar Täckström, Dipanjan Das, and Jakob Uszkoreit. A decomposable attention\nmodel. In Empirical Methods in Natural Language Processing, 2016.\n[28] Romain Paulus, Caiming Xiong, and Richard Socher. A deep reinforced model for abstractive\nsummarization. arXiv preprint arXiv:1705.04304, 2017.\n[29] Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. Learning accurate, compact,\nand interpretable tree annotation. In Proceedings of the 21st International Conference on\nComputational Linguistics and 44th Annual Meeting of the ACL, pages 433–440. ACL, July\n2006.\n[30] Ofir Press and Lior Wolf. Using the output embedding to improve language models. arXiv\npreprint arXiv:1608.05859, 2016.\n[31] Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words\nwith subword units. arXiv preprint arXiv:1508.07909, 2015.\n[32] Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Le, Geoffrey Hinton,\nand Jeff Dean. Outrageously large neural networks: The sparsely-gated mixture-of-experts\nlayer. arXiv preprint arXiv:1701.06538, 2017.\n[33] Nitish Srivastava, Geoffrey E Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdi-\nnov. Dropout: a simple way to prevent neural networks from overfitting. Journal of Machine\nLearning Research, 15(1):1929–1958, 2014.\n[34] Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, and Rob Fergus. End-to-end memory\nnetworks. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors,\nAdvances in Neural Information Processing Systems 28, pages 2440–2448. Curran Associates,\nInc., 2015.\n[35] Ilya Sutskever, Oriol Vinyals, and Quoc VV Le. Sequence to sequence learning with neural\nnetworks. In Advances in Neural Information Processing Systems, pages 3104–3112, 2014.\n[36] Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jonathon Shlens, and Zbigniew Wojna.\nRethinking the inception architecture for computer vision. CoRR, abs/1512.00567, 2015.\n[37] Vinyals & Kaiser, Koo, Petrov, Sutskever, and Hinton. Grammar as a foreign language. In\nAdvances in Neural Information Processing Systems, 2015.\n[38] Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang\nMacherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, et al. Google’s neural machine\ntranslation system: Bridging the gap between human and machine translation. arXiv preprint\narXiv:1609.08144, 2016.\n[39] Jie Zhou, Ying Cao, Xuguang Wang, Peng Li, and Wei Xu. Deep recurrent models with\nfast-forward connections for neural machine translation. CoRR, abs/1606.04199, 2016.\n[40] Muhua Zhu, Yue Zhang, Wenliang Chen, Min Zhang, and Jingbo Zhu. Fast and accurate\nshift-reduce constituent parsing. In Proceedings of the 51st Annual Meeting of the ACL (Volume\n1: Long Papers), pages 434–443. ACL, August 2013.\n12\n\n\n## PDF page 13\n\nAttention Visualizations\nIt\nis\nin\nthis\nspirit\nthat\na\nmajority\nof\nAmerican\ngovernments\nhave\npassed\nnew\nlaws\nsince\n2009\nmaking\nthe\nregistration\nor\nvoting\nprocess\nmore\ndifficult\n.\n<EOS>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\nIt\nis\nin\nthis\nspirit\nthat\na\nmajority\nof\nAmerican\ngovernments\nhave\npassed\nnew\nlaws\nsince\n2009\nmaking\nthe\nregistration\nor\nvoting\nprocess\nmore\ndifficult\n.\n<EOS>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\nFigure 3: An example of the attention mechanism following long-distance dependencies in the\nencoder self-attention in layer 5 of 6. Many of the attention heads attend to a distant dependency of\nthe verb ‘making’, completing the phrase ‘making...more difficult’. Attentions here shown only for\nthe word ‘making’. Different colors represent different heads. Best viewed in color.\n13\n\n\n## PDF page 14\n\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nFigure 4: Two attention heads, also in layer 5 of 6, apparently involved in anaphora resolution. Top:\nFull attentions for head 5. Bottom: Isolated attentions from just the word ‘its’ for attention heads 5\nand 6. Note that the attentions are very sharp for this word.\n14\n\n\n## PDF page 15\n\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nFigure 5: Many of the attention heads exhibit behaviour that seems related to the structure of the\nsentence. We give two such examples above, from two different heads from the encoder self-attention\nat layer 5 of 6. The heads clearly learned to perform different tasks.\n15\n\n\n可直接引用的图表文件（放在 Slidev public 目录，用 /文件名 引用）：\n- paper_figure_1_transformer.png：Figure 1 from PDF page 3: The Transformer model architecture.\n- paper_figure_3_long_distance.png：Figure 3 from PDF page 13: Encoder self-attention following long-distance dependencies.\n- paper_figure_4_anaphora.png：Figure 4 from PDF page 14: Attention heads involved in anaphora resolution.\n\n请生成一版 10-20 页的完整初稿。内容必须忠于论文，至少引用上面列出的三张原论文图，并覆盖问题、Transformer 架构、注意力机制、训练、主要实验、局限和结论。不要复制长段原文；每页保持听众可读的信息密度。生成完整的 slides.md。"
|
||
}
|
||
],
|
||
"temperature": 0.3
|
||
},
|
||
"response": {
|
||
"id": "021785361415665637105f9e0c7bada5e282be23591e67a328b6f",
|
||
"model": "doubao-seed-1-6-250615",
|
||
"finish_reason": "stop",
|
||
"content": "```markdown\n---\ntheme: default\n---\n\n# Attention Is All You Need\n## A Revolutionary Architecture for Sequence Transduction\n\nAshish Vaswani et al. \nNIPS 2017\n\n---\n\n## Abstract\n\n- Proposes **Transformer** - first model based solely on attention mechanisms\n- Dispenses with recurrence and convolutions entirely\n- Superior quality while being more parallelizable and requiring less training time\n- Achieves 28.4 BLEU on WMT 2014 English-to-German (↑2 BLEU over previous best)\n- Achieves 41.8 BLEU on WMT 2014 English-to-French (new state-of-the-art)\n- Generalizes well to other tasks like English constituency parsing\n\n---\n\n## Background: The Problem with Existing Approaches\n\n### Recurrent Neural Networks (RNNs/LSTMs/GRUs)\n- Inherently sequential computation\n- Cannot parallelize within training examples\n- Difficult to learn long-range dependencies\n\n### Convolutional Approaches\n- ByteNet, ConvS2S use CNNs for parallelization\n- Number of operations grows with distance between positions\n- Linear (ConvS2S) or logarithmic (ByteNet) path lengths\n\n---\n\n## Key Insight: Attention is Sufficient\n\nAttention mechanisms allow modeling dependencies without regard to distance, but were previously used with RNNs.\n\n**Transformer**: First transduction model relying entirely on self-attention to compute representations without:\n- Sequence-aligned RNNs\n- Convolutions\n\n---\n\n## Transformer Architecture Overview\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-80 mx-auto\" />\n\n*Encoder-decoder structure with stacked self-attention and feed-forward layers*\n\n---\n\n## Encoder Structure\n\n- Stack of **6 identical layers**\n- Each layer has two sub-layers:\n 1. **Multi-head self-attention** mechanism\n 2. **Position-wise fully connected feed-forward network**\n- Residual connections around each sub-layer\n- Layer normalization after each sub-layer\n- All sub-layers produce outputs of dimension `d_model = 512`\n\n---\n\n## Decoder Structure\n\n- Stack of **6 identical layers**\n- Three sub-layers per layer:\n 1. Masked multi-head self-attention (prevents leftward information flow)\n 2. Multi-head attention over encoder output\n 3. Position-wise fully connected feed-forward network\n- Residual connections and layer normalization\n- Output embeddings offset by one position (auto-regressive property)\n\n---\n\n## Attention Mechanism\n\n### Scaled Dot-Product Attention\n$$\\text{Attention}(Q, K, V) = \\text{softmax}\\left(\\frac{QK^T}{\\sqrt{d_k}}\\right)V$$\n\n- $Q$ (queries), $K$ (keys), $V$ (values) are matrices\n- Scaling by $\\frac{1}{\\sqrt{d_k}}$ prevents gradients from becoming too small\n- Faster and more space-efficient than additive attention\n\n---\n\n## Multi-Head Attention\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-40 mx-auto\" />\n\n- Projects queries, keys, values $h$ times with different learned projections\n- Performs attention in parallel on projected versions\n- Concatenates results and projects again\n\n$$\\text{MultiHead}(Q, K, V) = \\text{Concat}(\\text{head}_1, ..., \\text{head}_h)W^O$$\nwhere $\\text{head}_i = \\text{Attention}(QW_i^Q, KW_i^K, VW_i^V)$\n\n---\n\n## Three Applications of Attention\n\n1. **Encoder-decoder attention**: Queries from decoder, keys/values from encoder\n2. **Encoder self-attention**: All keys, values, queries from previous encoder layer\n3. **Decoder self-attention**: All positions in decoder up to current position (masked)\n\n---\n\n## Positional Encoding\n\nSince model has no recurrence/convolution, we inject positional information:\n\n$$\\text{PE}_{(pos, 2i)} = \\sin\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n$$\\text{PE}_{(pos, 2i+1)} = \\cos\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n\n- Same dimension as embeddings ($d_{\\text{model}}$)\n- Allows model to learn relative position information\n- Performed nearly as well as learned positional embeddings\n\n---\n\n## Why Self-Attention?\n\n| Layer Type | Complexity | Sequential Operations | Max Path Length |\n|------------|------------|-----------------------|-----------------|\n| Self-Attention | $O(n^2 \\cdot d)$ | $O(1)$ | $O(1)$ |\n| Recurrent | $O(n \\cdot d^2)$ | $O(n)$ | $O(n)$ |\n| Convolutional | $O(k \\cdot n \\cdot d^2)$ | $O(1)$ | $O(\\log_k n)$ |\n\n- Constant path length between any positions\n- More parallelizable than RNNs\n- Better computational efficiency for typical sentence lengths\n\n---\n\n## Training Details\n\n### Data & Batching\n- WMT 2014 English-German (4.5M sentence pairs)\n- WMT 2014 English-French (36M sentence pairs)\n- Byte-pair encoding (37K shared vocab for EN-DE)\n- Batches with ~25000 source and target tokens\n\n### Hardware & Schedule\n- 8 NVIDIA P100 GPUs\n- Base model: 100,000 steps (12 hours)\n- Big model: 300,000 steps (3.5 days)\n\n---\n\n## Training Details (Cont.)\n\n### Optimizer\n- Adam with $\\beta_1 = 0.9$, $\\beta_2 = 0.98$, $\\epsilon = 10^{-9}$\n- Learning rate schedule:\n $$\\text{lrate} = d_{\\text{model}}^{-0.5} \\cdot \\min(\\text{step\\_num}^{-0.5}, \\text{step\\_num} \\cdot \\text{warmup\\_steps}^{-1.5})$$\n- Warmup steps = 4000\n\n### Regularization\n- Residual dropout (P_drop = 0.1)\n- Label smoothing ($\\epsilon_{ls} = 0.1$)\n\n---\n\n## Machine Translation Results\n\n| Model | EN-DE BLEU | EN-FR BLEU | Training Cost (FLOPs) |\n|-------|------------|------------|-----------------------|\n| GNMT + RL Ensemble | 26.30 | 41.16 | $1.8 \\cdot 10^{20}$ |\n| ConvS2S Ensemble | 26.36 | 41.29 | $7.7 \\cdot 10^{19}$ |\n| **Transformer (big)** | **28.4** | **41.8** | **$2.3 \\cdot 10^{19}$** |\n\n- Transformer outperforms all previous state-of-the-art models\n- Achieves better results with significantly lower training cost\n- 28.4 BLEU on EN-DE (↑2 BLEU over previous best)\n- 41.8 BLEU on EN-FR (new state-of-the-art)\n\n---\n\n## Model Variations Analysis\n\n| Variation | Dev PPL | Dev BLEU |\n|-----------|---------|----------|\n| Base model | 4.92 | 25.8 |\n| Single attention head | 5.29 | 24.9 |\n| No dropout | 5.77 | 24.6 |\n| Learned positional embeddings | 4.92 | 25.7 |\n| Big model | 4.33 | 26.4 |\n\n- Multiple attention heads improve performance\n- Dropout is crucial for avoiding overfitting\n- Sinusoidal and learned positional encodings perform similarly\n- Larger models (more dimensions, more heads) improve performance\n\n---\n\n## Generalization to Other Tasks: English Constituency Parsing\n\n| Parser | Training | WSJ 23 F1 |\n|--------|----------|-----------|\n| Petrov et al. (2006) | WSJ only | 90.4 |\n| Dyer et al. (2016) | WSJ only | 91.7 |\n| **Transformer (4 layers)** | **WSJ only** | **91.3** |\n| Vinyals & Kaiser et al. | Semi-supervised | 92.1 |\n| **Transformer (4 layers)** | **Semi-supervised** | **92.7** |\n\n- Transformer performs well despite no task-specific tuning\n- Outperforms previous models in semi-supervised setting\n- Shows generalization ability beyond machine translation\n\n---\n\n## Attention Visualization: Long-Distance Dependencies\n\n<img src=\"/paper_figure_3_long_distance.png\" class=\"h-70 mx-auto\" />\n\n*Encoder self-attention in layer 5 showing attention to distant dependency of the verb \"making\"*\n\n---\n\n## Attention Visualization: Anaphora Resolution\n\n<img src=\"/paper_figure_4_anaphora.png\" class=\"h-70 mx-auto\" />\n\n*Attention heads involved in resolving \"its\" reference to \"The Law\"*\n\n---\n\n## Limitations\n\n- Computational complexity grows quadratically with sequence length\n- Less effective for very long sequences (e.g., books, articles)\n- Still requires sequential generation in decoder\n- Limited ability to model hierarchical structure compared to some syntactic models\n\n---\n\n## Conclusion and Future Work\n\n### Key Contributions\n- Introduced Transformer architecture based solely on attention\n- Achieved new state-of-the-art results in machine translation\n- Demonstrated improved parallelization and reduced training time\n- Showed generalization to other tasks like constituency parsing\n\n### Future Directions\n- Apply to other modalities (images, audio, video)\n- Investigate local, restricted attention for large inputs\n- Make generation less sequential\n- Explore interpretability of attention mechanisms\n\n---\n\n## Thank You\n\nCode available at: https://github.com/tensorflow/tensor2tensor\n\narXiv:1706.03762v7 [cs.CL]\n```"
|
||
},
|
||
"usage": {
|
||
"prompt_tokens": 11719,
|
||
"completion_tokens": 2696,
|
||
"total_tokens": 14415,
|
||
"cached_prompt_tokens": 0
|
||
}
|
||
},
|
||
{
|
||
"meter": "Reviewer(每轮只看最新截图)",
|
||
"called_at_utc": "2026-07-29T21:46:36.849209+00:00",
|
||
"latency_s": 108.017,
|
||
"request": {
|
||
"model": "doubao-seed-1-6-250615",
|
||
"messages": [
|
||
{
|
||
"role": "system",
|
||
"content": "你是一名严格的演示文稿质量审核员（Reviewer）。你会看到一份由 Slidev 渲染出的 PPT，\n每张图对应一页幻灯片（按顺序编号，从第 1 页开始）。请逐页检查以下问题：\n\n- text_overflow（文字溢出/被裁切超出页面边界）\n- overcrowded（内容过多/过于拥挤/留白不足）\n- image_size（图片过大顶出布局，或过小看不清）\n- readability（字号过小、对比度差、代码块难读）\n- layout（对齐混乱、标题与正文比例失衡、空页）\n\n请以**目标用户是听众**的严格标准审查——一页幻灯片若要点超过约 5 条、或正文文字块偏长、\n或图片挤压了文字空间，都应视为 overcrowded/image_size 问题。报告真实存在的问题，\n但不要放过\"塞得太满\"。对每个问题给出：page（页码，整数）、\nissue_type（上面之一）、severity（high/medium/low）、suggestion（具体、可执行的修改建议，中文）。\n\n同时给出：\n- overall_score：0-100 的整体质量分（越高越好）\n- pass：布尔值，仅当整份 PPT **既无 high 也无 medium 级问题**、排版干净可读时才为 true\n\n严格输出如下 JSON（不要输出任何多余文字）：\n{\n \"overall_score\": <int>,\n \"pass\": <bool>,\n \"issues\": [\n {\"page\": <int>, \"issue_type\": \"<type>\", \"severity\": \"<high|medium|low>\", \"suggestion\": \"<中文建议>\"}\n ]\n}"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": [
|
||
{
|
||
"type": "text",
|
||
"text": "这份 PPT 共 22 页，下面按页码顺序给出每一页的渲染截图。请审查。"
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 1 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "43e962b781454c3d5eac7723de28844f9fe12cee5370e89387f0273d1c119d0a",
|
||
"characters": 89538,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 2 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "49ef18fe73027dffd44f4ef26db4bed64194b3e919c25c781cc1eddd14dd122c",
|
||
"characters": 158646,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 3 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "8fc492f97955b686b960a2ad359ff0cb6b67af7cc7c29565ddd896ebec86411e",
|
||
"characters": 180426,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 4 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "3aff1d8f78e992b811abfb7056b3f702a7f9b9e0252d87589169b320329ea9cd",
|
||
"characters": 115978,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 5 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "d1b08f63033f50a0099bfaf290d2c78488497ce90502f0418a22fc85d858ab24",
|
||
"characters": 148726,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 6 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "4cbae6a4937ffb56da0c5fb4dbb5aa5f325f018fc665e233e112b88f44ea7c95",
|
||
"characters": 123034,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 7 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "5154b5ae06b6015c9c65ceed41cd695e1ddf6ffe88f9ef9b3c98155701f0ed4b",
|
||
"characters": 137362,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 8 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "8559bdc49da07f01235da0fa53449148195874fd2f682c332cb4023b88b6ff02",
|
||
"characters": 119686,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 9 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "9b6a9158801511032b0fd84c59ec7013e05f4d3d352475255895113742f6a5bc",
|
||
"characters": 155130,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 10 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "9732a52d2df1fc5403c15e9c3cd8ace7b00475643c043382229760c70c5be9c3",
|
||
"characters": 106458,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 11 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "dd95550e6ada1f29652e54f3c829782fc745de53586acfa85a90695cfac91793",
|
||
"characters": 137506,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 12 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "ea1edf49df3f7f1e769de47bcd3d74e48a72f16baa7022a36459ff005a6fe8b1",
|
||
"characters": 144394,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 13 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "bb4f2d67289bfde1dc34fd1d5d05ba84df6733df19da7672c575df05bc2b88ef",
|
||
"characters": 150930,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 14 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "ab11824c0cd1daad91e32c3629d81a20c9898b99e23233e4c3596ebf70f73779",
|
||
"characters": 121158,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 15 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "8cc141f1636df5677fd3fe8c5026161b5fea7521144aab9f89a2e1496a626780",
|
||
"characters": 163930,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 16 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "9f73149110209b10e363999672518d069a739b47fb2810c43ef85d037e43331a",
|
||
"characters": 164278,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 17 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "1c13a7beae9c3df2e300c64d72e713e1650aaf494ef573948ffc2530a09ff3bd",
|
||
"characters": 187338,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 18 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "a949a90e8deae3cacb814102a8599f61ec1e3c2275234c5c39fe4f8436d6eff5",
|
||
"characters": 155882,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 19 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "152229f827c51f5f55506e4b7d0e36b4c5bd0ac16dd148d6b3626db5609c7c13",
|
||
"characters": 151042,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 20 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "5dc9bc292e179506bb90c291ca5d98a25b94259e7ba069cd20bc91b65495ee84",
|
||
"characters": 103154,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 21 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "7f11c37fbfba252ecc3a4b48cdc1729ca4ba7390ce4ec4a0edf516cb39fb933c",
|
||
"characters": 191606,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 22 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "664fadc511edb5003c94f280fbdebe1a87fa9af4deb179cef896c1499ea8db5c",
|
||
"characters": 51614,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
}
|
||
]
|
||
}
|
||
],
|
||
"temperature": 0.2
|
||
},
|
||
"response": {
|
||
"id": "021785361549724cfcda9ed8a69b2edb3386bd623e2b8f0498b3e",
|
||
"model": "doubao-seed-1-6-250615",
|
||
"finish_reason": "stop",
|
||
"content": "{\n \"overall_score\": 65,\n \"pass\": false,\n \"issues\": [\n {\"page\": 2, \"issue_type\": \"overcrowded\", \"severity\": \"medium\", \"suggestion\": \"将6个要点拆分为2页，每页不超过3-4个要点，或精简合并相似内容\"},\n {\"page\": 3, \"issue_type\": \"overcrowded\", \"severity\": \"medium\", \"suggestion\": \"将RNN和卷积方法分两页展示，或每个部分保留2个核心要点\"},\n {\"page\": 5, \"issue_type\": \"image_size\", \"severity\": \"high\", \"suggestion\": \"放大架构图至至少占页面60%空间，确保图中文字和模块清晰可见\"},\n {\"page\": 5, \"issue_type\": \"readability\", \"severity\": \"medium\", \"suggestion\": \"删除图片下方的小字体说明文字，或单独用一页解释架构细节\"},\n {\"page\": 7, \"issue_type\": \"overcrowded\", \"severity\": \"medium\", \"suggestion\": \"将3个子要点拆分为独立要点，或移至下一页单独讲解decoder子层结构\"},\n {\"page\": 9, \"issue_type\": \"image_size\", \"severity\": \"high\", \"suggestion\": \"放大多头注意力机制图，确保每个头的结构和连接关系清晰可辨\"},\n {\"page\": 9, \"issue_type\": \"readability\", \"severity\": \"medium\", \"suggestion\": \"删除图片下方的小字体说明文字，公式保持现有大小即可\"},\n {\"page\": 13, \"issue_type\": \"overcrowded\", \"severity\": \"medium\", \"suggestion\": \"将Data & Batching和Hardware & Schedule分两页展示，或各保留2个最关键要点\"},\n {\"page\": 15, \"issue_type\": \"overcrowded\", \"severity\": \"medium\", \"suggestion\": \"表格保留核心对比数据，4个要点精简为2-3个核心结论\"},\n {\"page\": 18, \"issue_type\": \"image_size\", \"severity\": \"high\", \"suggestion\": \"单独一页放大展示注意力可视化图，确保能看清词语间的注意力连接关系\"},\n {\"page\": 18, \"issue_type\": \"readability\", \"severity\": \"medium\", \"suggestion\": \"删除图片下方的小字体说明文字，用简洁标题概括可视化内容\"},\n {\"page\": 19, \"issue_type\": \"image_size\", \"severity\": \"high\", \"suggestion\": \"单独一页放大展示指代消解可视化图，确保紫色连接线和词语清晰可见\"},\n {\"page\": 19, \"issue_type\": \"readability\", \"severity\": \"medium\", \"suggestion\": \"删除图片下方的小字体说明文字，直接在标题中说明可视化内容\"},\n {\"page\": 21, \"issue_type\": \"overcrowded\", \"severity\": \"medium\", \"suggestion\": \"将Key Contributions和Future Directions分两页展示，每部分保留3-4个要点\"}\n ]\n}"
|
||
},
|
||
"usage": {
|
||
"prompt_tokens": 26530,
|
||
"completion_tokens": 2147,
|
||
"total_tokens": 28677,
|
||
"cached_prompt_tokens": 0
|
||
}
|
||
},
|
||
{
|
||
"meter": "Proposer(纯文本)",
|
||
"called_at_utc": "2026-07-29T21:47:29.728538+00:00",
|
||
"latency_s": 52.871,
|
||
"request": {
|
||
"model": "doubao-seed-1-6-250615",
|
||
"messages": [
|
||
{
|
||
"role": "system",
|
||
"content": "你是一名擅长把学术论文转化为演示文稿的 Proposer Agent。\n你用 Slidev 框架（Markdown + HTML）编写 PPT 源码 slides.md。\n\nSlidev 语法要点：\n- 文件开头是 YAML frontmatter（--- 包裹），设置 theme: default。\n- 用单独一行的 `---`（前后空行）分隔每一页幻灯片。\n- 首页通常放标题、作者、会议。\n- 引用图片用 markdown：，可用 HTML 控制尺寸，\n 例如 <img src=\"/speedup_bar.png\" class=\"h-60 mx-auto\" />。\n- 可用 Windi/Uno CSS 工具类控制排版（如 text-sm、grid grid-cols-2 gap-4）。\n\n要求：\n- 最终生成 10-20 页，覆盖论文的标题、背景/动机、方法、实验结果、局限与结论。\n- 至少在 3 页中使用提供的图表/表格，且图文匹配。\n- 每页信息量适中、不要塞太多字，宁可拆页也不要溢出。\n- 只输出 slides.md 的完整内容，用 ```markdown 代码块包裹，不要额外解释。"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": "以下是论文全文（Markdown）：\n\n# Attention Is All You Need\n\nAuthors: Ashish Vaswani et al.\n\n\n## PDF page 1\n\nProvided proper attribution is provided, Google hereby grants permission to\nreproduce the tables and figures in this paper solely for use in journalistic or\nscholarly works.\nAttention Is All You Need\nAshish Vaswani∗\nGoogle Brain\navaswani@google.com\nNoam Shazeer∗\nGoogle Brain\nnoam@google.com\nNiki Parmar∗\nGoogle Research\nnikip@google.com\nJakob Uszkoreit∗\nGoogle Research\nusz@google.com\nLlion Jones∗\nGoogle Research\nllion@google.com\nAidan N. Gomez∗†\nUniversity of Toronto\naidan@cs.toronto.edu\nŁukasz Kaiser∗\nGoogle Brain\nlukaszkaiser@google.com\nIllia Polosukhin∗‡\nillia.polosukhin@gmail.com\nAbstract\nThe dominant sequence transduction models are based on complex recurrent or\nconvolutional neural networks that include an encoder and a decoder. The best\nperforming models also connect the encoder and decoder through an attention\nmechanism. We propose a new simple network architecture, the Transformer,\nbased solely on attention mechanisms, dispensing with recurrence and convolutions\nentirely. Experiments on two machine translation tasks show these models to\nbe superior in quality while being more parallelizable and requiring significantly\nless time to train. Our model achieves 28.4 BLEU on the WMT 2014 English-\nto-German translation task, improving over the existing best results, including\nensembles, by over 2 BLEU. On the WMT 2014 English-to-French translation task,\nour model establishes a new single-model state-of-the-art BLEU score of 41.8 after\ntraining for 3.5 days on eight GPUs, a small fraction of the training costs of the\nbest models from the literature. We show that the Transformer generalizes well to\nother tasks by applying it successfully to English constituency parsing both with\nlarge and limited training data.\n∗Equal contribution. Listing order is random. Jakob proposed replacing RNNs with self-attention and started\nthe effort to evaluate this idea. Ashish, with Illia, designed and implemented the first Transformer models and\nhas been crucially involved in every aspect of this work. Noam proposed scaled dot-product attention, multi-head\nattention and the parameter-free position representation and became the other person involved in nearly every\ndetail. Niki designed, implemented, tuned and evaluated countless model variants in our original codebase and\ntensor2tensor. Llion also experimented with novel model variants, was responsible for our initial codebase, and\nefficient inference and visualizations. Lukasz and Aidan spent countless long days designing various parts of and\nimplementing tensor2tensor, replacing our earlier codebase, greatly improving results and massively accelerating\nour research.\n†Work performed while at Google Brain.\n‡Work performed while at Google Research.\n31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA.\narXiv:1706.03762v7 [cs.CL] 2 Aug 2023\n\n\n## PDF page 2\n\n1\nIntroduction\nRecurrent neural networks, long short-term memory [13] and gated recurrent [7] neural networks\nin particular, have been firmly established as state of the art approaches in sequence modeling and\ntransduction problems such as language modeling and machine translation [35, 2, 5]. Numerous\nefforts have since continued to push the boundaries of recurrent language models and encoder-decoder\narchitectures [38, 24, 15].\nRecurrent models typically factor computation along the symbol positions of the input and output\nsequences. Aligning the positions to steps in computation time, they generate a sequence of hidden\nstates ht, as a function of the previous hidden state ht−1 and the input for position t. This inherently\nsequential nature precludes parallelization within training examples, which becomes critical at longer\nsequence lengths, as memory constraints limit batching across examples. Recent work has achieved\nsignificant improvements in computational efficiency through factorization tricks [21] and conditional\ncomputation [32], while also improving model performance in case of the latter. The fundamental\nconstraint of sequential computation, however, remains.\nAttention mechanisms have become an integral part of compelling sequence modeling and transduc-\ntion models in various tasks, allowing modeling of dependencies without regard to their distance in\nthe input or output sequences [2, 19]. In all but a few cases [27], however, such attention mechanisms\nare used in conjunction with a recurrent network.\nIn this work we propose the Transformer, a model architecture eschewing recurrence and instead\nrelying entirely on an attention mechanism to draw global dependencies between input and output.\nThe Transformer allows for significantly more parallelization and can reach a new state of the art in\ntranslation quality after being trained for as little as twelve hours on eight P100 GPUs.\n2\nBackground\nThe goal of reducing sequential computation also forms the foundation of the Extended Neural GPU\n[16], ByteNet [18] and ConvS2S [9], all of which use convolutional neural networks as basic building\nblock, computing hidden representations in parallel for all input and output positions. In these models,\nthe number of operations required to relate signals from two arbitrary input or output positions grows\nin the distance between positions, linearly for ConvS2S and logarithmically for ByteNet. This makes\nit more difficult to learn dependencies between distant positions [12]. In the Transformer this is\nreduced to a constant number of operations, albeit at the cost of reduced effective resolution due\nto averaging attention-weighted positions, an effect we counteract with Multi-Head Attention as\ndescribed in section 3.2.\nSelf-attention, sometimes called intra-attention is an attention mechanism relating different positions\nof a single sequence in order to compute a representation of the sequence. Self-attention has been\nused successfully in a variety of tasks including reading comprehension, abstractive summarization,\ntextual entailment and learning task-independent sentence representations [4, 27, 28, 22].\nEnd-to-end memory networks are based on a recurrent attention mechanism instead of sequence-\naligned recurrence and have been shown to perform well on simple-language question answering and\nlanguage modeling tasks [34].\nTo the best of our knowledge, however, the Transformer is the first transduction model relying\nentirely on self-attention to compute representations of its input and output without using sequence-\naligned RNNs or convolution. In the following sections, we will describe the Transformer, motivate\nself-attention and discuss its advantages over models such as [17, 18] and [9].\n3\nModel Architecture\nMost competitive neural sequence transduction models have an encoder-decoder structure [5, 2, 35].\nHere, the encoder maps an input sequence of symbol representations (x1, ..., xn) to a sequence\nof continuous representations z = (z1, ..., zn). Given z, the decoder then generates an output\nsequence (y1, ..., ym) of symbols one element at a time. At each step the model is auto-regressive\n[10], consuming the previously generated symbols as additional input when generating the next.\n2\n\n\n## PDF page 3\n\nFigure 1: The Transformer - model architecture.\nThe Transformer follows this overall architecture using stacked self-attention and point-wise, fully\nconnected layers for both the encoder and decoder, shown in the left and right halves of Figure 1,\nrespectively.\n3.1\nEncoder and Decoder Stacks\nEncoder:\nThe encoder is composed of a stack of N = 6 identical layers. Each layer has two\nsub-layers. The first is a multi-head self-attention mechanism, and the second is a simple, position-\nwise fully connected feed-forward network. We employ a residual connection [11] around each of\nthe two sub-layers, followed by layer normalization [1]. That is, the output of each sub-layer is\nLayerNorm(x + Sublayer(x)), where Sublayer(x) is the function implemented by the sub-layer\nitself. To facilitate these residual connections, all sub-layers in the model, as well as the embedding\nlayers, produce outputs of dimension dmodel = 512.\nDecoder:\nThe decoder is also composed of a stack of N = 6 identical layers. In addition to the two\nsub-layers in each encoder layer, the decoder inserts a third sub-layer, which performs multi-head\nattention over the output of the encoder stack. Similar to the encoder, we employ residual connections\naround each of the sub-layers, followed by layer normalization. We also modify the self-attention\nsub-layer in the decoder stack to prevent positions from attending to subsequent positions. This\nmasking, combined with fact that the output embeddings are offset by one position, ensures that the\npredictions for position i can depend only on the known outputs at positions less than i.\n3.2\nAttention\nAn attention function can be described as mapping a query and a set of key-value pairs to an output,\nwhere the query, keys, values, and output are all vectors. The output is computed as a weighted sum\n3\n\n\n## PDF page 4\n\nScaled Dot-Product Attention\nMulti-Head Attention\nFigure 2: (left) Scaled Dot-Product Attention. (right) Multi-Head Attention consists of several\nattention layers running in parallel.\nof the values, where the weight assigned to each value is computed by a compatibility function of the\nquery with the corresponding key.\n3.2.1\nScaled Dot-Product Attention\nWe call our particular attention \"Scaled Dot-Product Attention\" (Figure 2). The input consists of\nqueries and keys of dimension dk, and values of dimension dv. We compute the dot products of the\nquery with all keys, divide each by √dk, and apply a softmax function to obtain the weights on the\nvalues.\nIn practice, we compute the attention function on a set of queries simultaneously, packed together\ninto a matrix Q. The keys and values are also packed together into matrices K and V . We compute\nthe matrix of outputs as:\nAttention(Q, K, V ) = softmax(QKT\n√dk\n)V\n(1)\nThe two most commonly used attention functions are additive attention [2], and dot-product (multi-\nplicative) attention. Dot-product attention is identical to our algorithm, except for the scaling factor\nof\n1\n√dk . Additive attention computes the compatibility function using a feed-forward network with\na single hidden layer. While the two are similar in theoretical complexity, dot-product attention is\nmuch faster and more space-efficient in practice, since it can be implemented using highly optimized\nmatrix multiplication code.\nWhile for small values of dk the two mechanisms perform similarly, additive attention outperforms\ndot product attention without scaling for larger values of dk [3]. We suspect that for large values of\ndk, the dot products grow large in magnitude, pushing the softmax function into regions where it has\nextremely small gradients 4. To counteract this effect, we scale the dot products by\n1\n√dk .\n3.2.2\nMulti-Head Attention\nInstead of performing a single attention function with dmodel-dimensional keys, values and queries,\nwe found it beneficial to linearly project the queries, keys and values h times with different, learned\nlinear projections to dk, dk and dv dimensions, respectively. On each of these projected versions of\nqueries, keys and values we then perform the attention function in parallel, yielding dv-dimensional\n4To illustrate why the dot products get large, assume that the components of q and k are independent random\nvariables with mean 0 and variance 1. Then their dot product, q · k = Pdk\ni=1 qiki, has mean 0 and variance dk.\n4\n\n\n## PDF page 5\n\noutput values. These are concatenated and once again projected, resulting in the final values, as\ndepicted in Figure 2.\nMulti-head attention allows the model to jointly attend to information from different representation\nsubspaces at different positions. With a single attention head, averaging inhibits this.\nMultiHead(Q, K, V ) = Concat(head1, ..., headh)W O\nwhere headi = Attention(QW Q\ni , KW K\ni , V W V\ni )\nWhere the projections are parameter matrices W Q\ni\n∈Rdmodel×dk, W K\ni\n∈Rdmodel×dk, W V\ni\n∈Rdmodel×dv\nand W O ∈Rhdv×dmodel.\nIn this work we employ h = 8 parallel attention layers, or heads. For each of these we use\ndk = dv = dmodel/h = 64. Due to the reduced dimension of each head, the total computational cost\nis similar to that of single-head attention with full dimensionality.\n3.2.3\nApplications of Attention in our Model\nThe Transformer uses multi-head attention in three different ways:\n• In \"encoder-decoder attention\" layers, the queries come from the previous decoder layer,\nand the memory keys and values come from the output of the encoder. This allows every\nposition in the decoder to attend over all positions in the input sequence. This mimics the\ntypical encoder-decoder attention mechanisms in sequence-to-sequence models such as\n[38, 2, 9].\n• The encoder contains self-attention layers. In a self-attention layer all of the keys, values\nand queries come from the same place, in this case, the output of the previous layer in the\nencoder. Each position in the encoder can attend to all positions in the previous layer of the\nencoder.\n• Similarly, self-attention layers in the decoder allow each position in the decoder to attend to\nall positions in the decoder up to and including that position. We need to prevent leftward\ninformation flow in the decoder to preserve the auto-regressive property. We implement this\ninside of scaled dot-product attention by masking out (setting to −∞) all values in the input\nof the softmax which correspond to illegal connections. See Figure 2.\n3.3\nPosition-wise Feed-Forward Networks\nIn addition to attention sub-layers, each of the layers in our encoder and decoder contains a fully\nconnected feed-forward network, which is applied to each position separately and identically. This\nconsists of two linear transformations with a ReLU activation in between.\nFFN(x) = max(0, xW1 + b1)W2 + b2\n(2)\nWhile the linear transformations are the same across different positions, they use different parameters\nfrom layer to layer. Another way of describing this is as two convolutions with kernel size 1.\nThe dimensionality of input and output is dmodel = 512, and the inner-layer has dimensionality\ndff = 2048.\n3.4\nEmbeddings and Softmax\nSimilarly to other sequence transduction models, we use learned embeddings to convert the input\ntokens and output tokens to vectors of dimension dmodel. We also use the usual learned linear transfor-\nmation and softmax function to convert the decoder output to predicted next-token probabilities. In\nour model, we share the same weight matrix between the two embedding layers and the pre-softmax\nlinear transformation, similar to [30]. In the embedding layers, we multiply those weights by √dmodel.\n5\n\n\n## PDF page 6\n\nTable 1: Maximum path lengths, per-layer complexity and minimum number of sequential operations\nfor different layer types. n is the sequence length, d is the representation dimension, k is the kernel\nsize of convolutions and r the size of the neighborhood in restricted self-attention.\nLayer Type\nComplexity per Layer\nSequential\nMaximum Path Length\nOperations\nSelf-Attention\nO(n2 · d)\nO(1)\nO(1)\nRecurrent\nO(n · d2)\nO(n)\nO(n)\nConvolutional\nO(k · n · d2)\nO(1)\nO(logk(n))\nSelf-Attention (restricted)\nO(r · n · d)\nO(1)\nO(n/r)\n3.5\nPositional Encoding\nSince our model contains no recurrence and no convolution, in order for the model to make use of the\norder of the sequence, we must inject some information about the relative or absolute position of the\ntokens in the sequence. To this end, we add \"positional encodings\" to the input embeddings at the\nbottoms of the encoder and decoder stacks. The positional encodings have the same dimension dmodel\nas the embeddings, so that the two can be summed. There are many choices of positional encodings,\nlearned and fixed [9].\nIn this work, we use sine and cosine functions of different frequencies:\nPE(pos,2i) = sin(pos/100002i/dmodel)\nPE(pos,2i+1) = cos(pos/100002i/dmodel)\nwhere pos is the position and i is the dimension. That is, each dimension of the positional encoding\ncorresponds to a sinusoid. The wavelengths form a geometric progression from 2π to 10000 · 2π. We\nchose this function because we hypothesized it would allow the model to easily learn to attend by\nrelative positions, since for any fixed offset k, PEpos+k can be represented as a linear function of\nPEpos.\nWe also experimented with using learned positional embeddings [9] instead, and found that the two\nversions produced nearly identical results (see Table 3 row (E)). We chose the sinusoidal version\nbecause it may allow the model to extrapolate to sequence lengths longer than the ones encountered\nduring training.\n4\nWhy Self-Attention\nIn this section we compare various aspects of self-attention layers to the recurrent and convolu-\ntional layers commonly used for mapping one variable-length sequence of symbol representations\n(x1, ..., xn) to another sequence of equal length (z1, ..., zn), with xi, zi ∈Rd, such as a hidden\nlayer in a typical sequence transduction encoder or decoder. Motivating our use of self-attention we\nconsider three desiderata.\nOne is the total computational complexity per layer. Another is the amount of computation that can\nbe parallelized, as measured by the minimum number of sequential operations required.\nThe third is the path length between long-range dependencies in the network. Learning long-range\ndependencies is a key challenge in many sequence transduction tasks. One key factor affecting the\nability to learn such dependencies is the length of the paths forward and backward signals have to\ntraverse in the network. The shorter these paths between any combination of positions in the input\nand output sequences, the easier it is to learn long-range dependencies [12]. Hence we also compare\nthe maximum path length between any two input and output positions in networks composed of the\ndifferent layer types.\nAs noted in Table 1, a self-attention layer connects all positions with a constant number of sequentially\nexecuted operations, whereas a recurrent layer requires O(n) sequential operations. In terms of\ncomputational complexity, self-attention layers are faster than recurrent layers when the sequence\n6\n\n\n## PDF page 7\n\nlength n is smaller than the representation dimensionality d, which is most often the case with\nsentence representations used by state-of-the-art models in machine translations, such as word-piece\n[38] and byte-pair [31] representations. To improve computational performance for tasks involving\nvery long sequences, self-attention could be restricted to considering only a neighborhood of size r in\nthe input sequence centered around the respective output position. This would increase the maximum\npath length to O(n/r). We plan to investigate this approach further in future work.\nA single convolutional layer with kernel width k < n does not connect all pairs of input and output\npositions. Doing so requires a stack of O(n/k) convolutional layers in the case of contiguous kernels,\nor O(logk(n)) in the case of dilated convolutions [18], increasing the length of the longest paths\nbetween any two positions in the network. Convolutional layers are generally more expensive than\nrecurrent layers, by a factor of k. Separable convolutions [6], however, decrease the complexity\nconsiderably, to O(k · n · d + n · d2). Even with k = n, however, the complexity of a separable\nconvolution is equal to the combination of a self-attention layer and a point-wise feed-forward layer,\nthe approach we take in our model.\nAs side benefit, self-attention could yield more interpretable models. We inspect attention distributions\nfrom our models and present and discuss examples in the appendix. Not only do individual attention\nheads clearly learn to perform different tasks, many appear to exhibit behavior related to the syntactic\nand semantic structure of the sentences.\n5\nTraining\nThis section describes the training regime for our models.\n5.1\nTraining Data and Batching\nWe trained on the standard WMT 2014 English-German dataset consisting of about 4.5 million\nsentence pairs. Sentences were encoded using byte-pair encoding [3], which has a shared source-\ntarget vocabulary of about 37000 tokens. For English-French, we used the significantly larger WMT\n2014 English-French dataset consisting of 36M sentences and split tokens into a 32000 word-piece\nvocabulary [38]. Sentence pairs were batched together by approximate sequence length. Each training\nbatch contained a set of sentence pairs containing approximately 25000 source tokens and 25000\ntarget tokens.\n5.2\nHardware and Schedule\nWe trained our models on one machine with 8 NVIDIA P100 GPUs. For our base models using\nthe hyperparameters described throughout the paper, each training step took about 0.4 seconds. We\ntrained the base models for a total of 100,000 steps or 12 hours. For our big models,(described on the\nbottom line of table 3), step time was 1.0 seconds. The big models were trained for 300,000 steps\n(3.5 days).\n5.3\nOptimizer\nWe used the Adam optimizer [20] with β1 = 0.9, β2 = 0.98 and ϵ = 10−9. We varied the learning\nrate over the course of training, according to the formula:\nlrate = d−0.5\nmodel · min(step_num−0.5, step_num · warmup_steps−1.5)\n(3)\nThis corresponds to increasing the learning rate linearly for the first warmup_steps training steps,\nand decreasing it thereafter proportionally to the inverse square root of the step number. We used\nwarmup_steps = 4000.\n5.4\nRegularization\nWe employ three types of regularization during training:\n7\n\n\n## PDF page 8\n\nTable 2: The Transformer achieves better BLEU scores than previous state-of-the-art models on the\nEnglish-to-German and English-to-French newstest2014 tests at a fraction of the training cost.\nModel\nBLEU\nTraining Cost (FLOPs)\nEN-DE\nEN-FR\nEN-DE\nEN-FR\nByteNet [18]\n23.75\nDeep-Att + PosUnk [39]\n39.2\n1.0 · 1020\nGNMT + RL [38]\n24.6\n39.92\n2.3 · 1019\n1.4 · 1020\nConvS2S [9]\n25.16\n40.46\n9.6 · 1018\n1.5 · 1020\nMoE [32]\n26.03\n40.56\n2.0 · 1019\n1.2 · 1020\nDeep-Att + PosUnk Ensemble [39]\n40.4\n8.0 · 1020\nGNMT + RL Ensemble [38]\n26.30\n41.16\n1.8 · 1020\n1.1 · 1021\nConvS2S Ensemble [9]\n26.36\n41.29\n7.7 · 1019\n1.2 · 1021\nTransformer (base model)\n27.3\n38.1\n3.3 · 1018\nTransformer (big)\n28.4\n41.8\n2.3 · 1019\nResidual Dropout\nWe apply dropout [33] to the output of each sub-layer, before it is added to the\nsub-layer input and normalized. In addition, we apply dropout to the sums of the embeddings and the\npositional encodings in both the encoder and decoder stacks. For the base model, we use a rate of\nPdrop = 0.1.\nLabel Smoothing\nDuring training, we employed label smoothing of value ϵls = 0.1 [36]. This\nhurts perplexity, as the model learns to be more unsure, but improves accuracy and BLEU score.\n6\nResults\n6.1\nMachine Translation\nOn the WMT 2014 English-to-German translation task, the big transformer model (Transformer (big)\nin Table 2) outperforms the best previously reported models (including ensembles) by more than 2.0\nBLEU, establishing a new state-of-the-art BLEU score of 28.4. The configuration of this model is\nlisted in the bottom line of Table 3. Training took 3.5 days on 8 P100 GPUs. Even our base model\nsurpasses all previously published models and ensembles, at a fraction of the training cost of any of\nthe competitive models.\nOn the WMT 2014 English-to-French translation task, our big model achieves a BLEU score of 41.0,\noutperforming all of the previously published single models, at less than 1/4 the training cost of the\nprevious state-of-the-art model. The Transformer (big) model trained for English-to-French used\ndropout rate Pdrop = 0.1, instead of 0.3.\nFor the base models, we used a single model obtained by averaging the last 5 checkpoints, which\nwere written at 10-minute intervals. For the big models, we averaged the last 20 checkpoints. We\nused beam search with a beam size of 4 and length penalty α = 0.6 [38]. These hyperparameters\nwere chosen after experimentation on the development set. We set the maximum output length during\ninference to input length + 50, but terminate early when possible [38].\nTable 2 summarizes our results and compares our translation quality and training costs to other model\narchitectures from the literature. We estimate the number of floating point operations used to train a\nmodel by multiplying the training time, the number of GPUs used, and an estimate of the sustained\nsingle-precision floating-point capacity of each GPU 5.\n6.2\nModel Variations\nTo evaluate the importance of different components of the Transformer, we varied our base model\nin different ways, measuring the change in performance on English-to-German translation on the\n5We used values of 2.8, 3.7, 6.0 and 9.5 TFLOPS for K80, K40, M40 and P100, respectively.\n8\n\n\n## PDF page 9\n\nTable 3: Variations on the Transformer architecture. Unlisted values are identical to those of the base\nmodel. All metrics are on the English-to-German translation development set, newstest2013. Listed\nperplexities are per-wordpiece, according to our byte-pair encoding, and should not be compared to\nper-word perplexities.\nN\ndmodel\ndff\nh\ndk\ndv\nPdrop\nϵls\ntrain\nPPL\nBLEU\nparams\nsteps\n(dev)\n(dev)\n×106\nbase\n6\n512\n2048\n8\n64\n64\n0.1\n0.1\n100K\n4.92\n25.8\n65\n(A)\n1\n512\n512\n5.29\n24.9\n4\n128\n128\n5.00\n25.5\n16\n32\n32\n4.91\n25.8\n32\n16\n16\n5.01\n25.4\n(B)\n16\n5.16\n25.1\n58\n32\n5.01\n25.4\n60\n(C)\n2\n6.11\n23.7\n36\n4\n5.19\n25.3\n50\n8\n4.88\n25.5\n80\n256\n32\n32\n5.75\n24.5\n28\n1024\n128\n128\n4.66\n26.0\n168\n1024\n5.12\n25.4\n53\n4096\n4.75\n26.2\n90\n(D)\n0.0\n5.77\n24.6\n0.2\n4.95\n25.5\n0.0\n4.67\n25.3\n0.2\n5.47\n25.7\n(E)\npositional embedding instead of sinusoids\n4.92\n25.7\nbig\n6\n1024\n4096\n16\n0.3\n300K\n4.33\n26.4\n213\ndevelopment set, newstest2013. We used beam search as described in the previous section, but no\ncheckpoint averaging. We present these results in Table 3.\nIn Table 3 rows (A), we vary the number of attention heads and the attention key and value dimensions,\nkeeping the amount of computation constant, as described in Section 3.2.2. While single-head\nattention is 0.9 BLEU worse than the best setting, quality also drops off with too many heads.\nIn Table 3 rows (B), we observe that reducing the attention key size dk hurts model quality. This\nsuggests that determining compatibility is not easy and that a more sophisticated compatibility\nfunction than dot product may be beneficial. We further observe in rows (C) and (D) that, as expected,\nbigger models are better, and dropout is very helpful in avoiding over-fitting. In row (E) we replace our\nsinusoidal positional encoding with learned positional embeddings [9], and observe nearly identical\nresults to the base model.\n6.3\nEnglish Constituency Parsing\nTo evaluate if the Transformer can generalize to other tasks we performed experiments on English\nconstituency parsing. This task presents specific challenges: the output is subject to strong structural\nconstraints and is significantly longer than the input. Furthermore, RNN sequence-to-sequence\nmodels have not been able to attain state-of-the-art results in small-data regimes [37].\nWe trained a 4-layer transformer with dmodel = 1024 on the Wall Street Journal (WSJ) portion of the\nPenn Treebank [25], about 40K training sentences. We also trained it in a semi-supervised setting,\nusing the larger high-confidence and BerkleyParser corpora from with approximately 17M sentences\n[37]. We used a vocabulary of 16K tokens for the WSJ only setting and a vocabulary of 32K tokens\nfor the semi-supervised setting.\nWe performed only a small number of experiments to select the dropout, both attention and residual\n(section 5.4), learning rates and beam size on the Section 22 development set, all other parameters\nremained unchanged from the English-to-German base translation model. During inference, we\n9\n\n\n## PDF page 10\n\nTable 4: The Transformer generalizes well to English constituency parsing (Results are on Section 23\nof WSJ)\nParser\nTraining\nWSJ 23 F1\nVinyals & Kaiser el al. (2014) [37]\nWSJ only, discriminative\n88.3\nPetrov et al. (2006) [29]\nWSJ only, discriminative\n90.4\nZhu et al. (2013) [40]\nWSJ only, discriminative\n90.4\nDyer et al. (2016) [8]\nWSJ only, discriminative\n91.7\nTransformer (4 layers)\nWSJ only, discriminative\n91.3\nZhu et al. (2013) [40]\nsemi-supervised\n91.3\nHuang & Harper (2009) [14]\nsemi-supervised\n91.3\nMcClosky et al. (2006) [26]\nsemi-supervised\n92.1\nVinyals & Kaiser el al. (2014) [37]\nsemi-supervised\n92.1\nTransformer (4 layers)\nsemi-supervised\n92.7\nLuong et al. (2015) [23]\nmulti-task\n93.0\nDyer et al. (2016) [8]\ngenerative\n93.3\nincreased the maximum output length to input length + 300. We used a beam size of 21 and α = 0.3\nfor both WSJ only and the semi-supervised setting.\nOur results in Table 4 show that despite the lack of task-specific tuning our model performs sur-\nprisingly well, yielding better results than all previously reported models with the exception of the\nRecurrent Neural Network Grammar [8].\nIn contrast to RNN sequence-to-sequence models [37], the Transformer outperforms the Berkeley-\nParser [29] even when training only on the WSJ training set of 40K sentences.\n7\nConclusion\nIn this work, we presented the Transformer, the first sequence transduction model based entirely on\nattention, replacing the recurrent layers most commonly used in encoder-decoder architectures with\nmulti-headed self-attention.\nFor translation tasks, the Transformer can be trained significantly faster than architectures based\non recurrent or convolutional layers. On both WMT 2014 English-to-German and WMT 2014\nEnglish-to-French translation tasks, we achieve a new state of the art. In the former task our best\nmodel outperforms even all previously reported ensembles.\nWe are excited about the future of attention-based models and plan to apply them to other tasks. We\nplan to extend the Transformer to problems involving input and output modalities other than text and\nto investigate local, restricted attention mechanisms to efficiently handle large inputs and outputs\nsuch as images, audio and video. Making generation less sequential is another research goals of ours.\nThe code we used to train and evaluate our models is available at https://github.com/\ntensorflow/tensor2tensor.\nAcknowledgements\nWe are grateful to Nal Kalchbrenner and Stephan Gouws for their fruitful\ncomments, corrections and inspiration.\nReferences\n[1] Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint\narXiv:1607.06450, 2016.\n[2] Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly\nlearning to align and translate. CoRR, abs/1409.0473, 2014.\n[3] Denny Britz, Anna Goldie, Minh-Thang Luong, and Quoc V. Le. Massive exploration of neural\nmachine translation architectures. CoRR, abs/1703.03906, 2017.\n[4] Jianpeng Cheng, Li Dong, and Mirella Lapata. Long short-term memory-networks for machine\nreading. arXiv preprint arXiv:1601.06733, 2016.\n10\n\n\n## PDF page 11\n\n[5] Kyunghyun Cho, Bart van Merrienboer, Caglar Gulcehre, Fethi Bougares, Holger Schwenk,\nand Yoshua Bengio. Learning phrase representations using rnn encoder-decoder for statistical\nmachine translation. CoRR, abs/1406.1078, 2014.\n[6] Francois Chollet. Xception: Deep learning with depthwise separable convolutions. arXiv\npreprint arXiv:1610.02357, 2016.\n[7] Junyoung Chung, Çaglar Gülçehre, Kyunghyun Cho, and Yoshua Bengio. Empirical evaluation\nof gated recurrent neural networks on sequence modeling. CoRR, abs/1412.3555, 2014.\n[8] Chris Dyer, Adhiguna Kuncoro, Miguel Ballesteros, and Noah A. Smith. Recurrent neural\nnetwork grammars. In Proc. of NAACL, 2016.\n[9] Jonas Gehring, Michael Auli, David Grangier, Denis Yarats, and Yann N. Dauphin. Convolu-\ntional sequence to sequence learning. arXiv preprint arXiv:1705.03122v2, 2017.\n[10] Alex Graves.\nGenerating sequences with recurrent neural networks.\narXiv preprint\narXiv:1308.0850, 2013.\n[11] Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for im-\nage recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern\nRecognition, pages 770–778, 2016.\n[12] Sepp Hochreiter, Yoshua Bengio, Paolo Frasconi, and Jürgen Schmidhuber. Gradient flow in\nrecurrent nets: the difficulty of learning long-term dependencies, 2001.\n[13] Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory. Neural computation,\n9(8):1735–1780, 1997.\n[14] Zhongqiang Huang and Mary Harper. Self-training PCFG grammars with latent annotations\nacross languages. In Proceedings of the 2009 Conference on Empirical Methods in Natural\nLanguage Processing, pages 832–841. ACL, August 2009.\n[15] Rafal Jozefowicz, Oriol Vinyals, Mike Schuster, Noam Shazeer, and Yonghui Wu. Exploring\nthe limits of language modeling. arXiv preprint arXiv:1602.02410, 2016.\n[16] Łukasz Kaiser and Samy Bengio. Can active memory replace attention? In Advances in Neural\nInformation Processing Systems, (NIPS), 2016.\n[17] Łukasz Kaiser and Ilya Sutskever. Neural GPUs learn algorithms. In International Conference\non Learning Representations (ICLR), 2016.\n[18] Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Ko-\nray Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099v2,\n2017.\n[19] Yoon Kim, Carl Denton, Luong Hoang, and Alexander M. Rush. Structured attention networks.\nIn International Conference on Learning Representations, 2017.\n[20] Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015.\n[21] Oleksii Kuchaiev and Boris Ginsburg. Factorization tricks for LSTM networks. arXiv preprint\narXiv:1703.10722, 2017.\n[22] Zhouhan Lin, Minwei Feng, Cicero Nogueira dos Santos, Mo Yu, Bing Xiang, Bowen\nZhou, and Yoshua Bengio. A structured self-attentive sentence embedding. arXiv preprint\narXiv:1703.03130, 2017.\n[23] Minh-Thang Luong, Quoc V. Le, Ilya Sutskever, Oriol Vinyals, and Lukasz Kaiser. Multi-task\nsequence to sequence learning. arXiv preprint arXiv:1511.06114, 2015.\n[24] Minh-Thang Luong, Hieu Pham, and Christopher D Manning. Effective approaches to attention-\nbased neural machine translation. arXiv preprint arXiv:1508.04025, 2015.\n11\n\n\n## PDF page 12\n\n[25] Mitchell P Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. Building a large annotated\ncorpus of english: The penn treebank. Computational linguistics, 19(2):313–330, 1993.\n[26] David McClosky, Eugene Charniak, and Mark Johnson. Effective self-training for parsing. In\nProceedings of the Human Language Technology Conference of the NAACL, Main Conference,\npages 152–159. ACL, June 2006.\n[27] Ankur Parikh, Oscar Täckström, Dipanjan Das, and Jakob Uszkoreit. A decomposable attention\nmodel. In Empirical Methods in Natural Language Processing, 2016.\n[28] Romain Paulus, Caiming Xiong, and Richard Socher. A deep reinforced model for abstractive\nsummarization. arXiv preprint arXiv:1705.04304, 2017.\n[29] Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. Learning accurate, compact,\nand interpretable tree annotation. In Proceedings of the 21st International Conference on\nComputational Linguistics and 44th Annual Meeting of the ACL, pages 433–440. ACL, July\n2006.\n[30] Ofir Press and Lior Wolf. Using the output embedding to improve language models. arXiv\npreprint arXiv:1608.05859, 2016.\n[31] Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words\nwith subword units. arXiv preprint arXiv:1508.07909, 2015.\n[32] Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Le, Geoffrey Hinton,\nand Jeff Dean. Outrageously large neural networks: The sparsely-gated mixture-of-experts\nlayer. arXiv preprint arXiv:1701.06538, 2017.\n[33] Nitish Srivastava, Geoffrey E Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdi-\nnov. Dropout: a simple way to prevent neural networks from overfitting. Journal of Machine\nLearning Research, 15(1):1929–1958, 2014.\n[34] Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, and Rob Fergus. End-to-end memory\nnetworks. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors,\nAdvances in Neural Information Processing Systems 28, pages 2440–2448. Curran Associates,\nInc., 2015.\n[35] Ilya Sutskever, Oriol Vinyals, and Quoc VV Le. Sequence to sequence learning with neural\nnetworks. In Advances in Neural Information Processing Systems, pages 3104–3112, 2014.\n[36] Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jonathon Shlens, and Zbigniew Wojna.\nRethinking the inception architecture for computer vision. CoRR, abs/1512.00567, 2015.\n[37] Vinyals & Kaiser, Koo, Petrov, Sutskever, and Hinton. Grammar as a foreign language. In\nAdvances in Neural Information Processing Systems, 2015.\n[38] Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang\nMacherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, et al. Google’s neural machine\ntranslation system: Bridging the gap between human and machine translation. arXiv preprint\narXiv:1609.08144, 2016.\n[39] Jie Zhou, Ying Cao, Xuguang Wang, Peng Li, and Wei Xu. Deep recurrent models with\nfast-forward connections for neural machine translation. CoRR, abs/1606.04199, 2016.\n[40] Muhua Zhu, Yue Zhang, Wenliang Chen, Min Zhang, and Jingbo Zhu. Fast and accurate\nshift-reduce constituent parsing. In Proceedings of the 51st Annual Meeting of the ACL (Volume\n1: Long Papers), pages 434–443. ACL, August 2013.\n12\n\n\n## PDF page 13\n\nAttention Visualizations\nIt\nis\nin\nthis\nspirit\nthat\na\nmajority\nof\nAmerican\ngovernments\nhave\npassed\nnew\nlaws\nsince\n2009\nmaking\nthe\nregistration\nor\nvoting\nprocess\nmore\ndifficult\n.\n<EOS>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\nIt\nis\nin\nthis\nspirit\nthat\na\nmajority\nof\nAmerican\ngovernments\nhave\npassed\nnew\nlaws\nsince\n2009\nmaking\nthe\nregistration\nor\nvoting\nprocess\nmore\ndifficult\n.\n<EOS>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\nFigure 3: An example of the attention mechanism following long-distance dependencies in the\nencoder self-attention in layer 5 of 6. Many of the attention heads attend to a distant dependency of\nthe verb ‘making’, completing the phrase ‘making...more difficult’. Attentions here shown only for\nthe word ‘making’. Different colors represent different heads. Best viewed in color.\n13\n\n\n## PDF page 14\n\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nFigure 4: Two attention heads, also in layer 5 of 6, apparently involved in anaphora resolution. Top:\nFull attentions for head 5. Bottom: Isolated attentions from just the word ‘its’ for attention heads 5\nand 6. Note that the attentions are very sharp for this word.\n14\n\n\n## PDF page 15\n\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nFigure 5: Many of the attention heads exhibit behaviour that seems related to the structure of the\nsentence. We give two such examples above, from two different heads from the encoder self-attention\nat layer 5 of 6. The heads clearly learned to perform different tasks.\n15\n\n\n可直接引用的图表文件（放在 Slidev public 目录，用 /文件名 引用）：\n- paper_figure_1_transformer.png：Figure 1 from PDF page 3: The Transformer model architecture.\n- paper_figure_3_long_distance.png：Figure 3 from PDF page 13: Encoder self-attention following long-distance dependencies.\n- paper_figure_4_anaphora.png：Figure 4 from PDF page 14: Attention heads involved in anaphora resolution.\n\n请生成一版 10-20 页的完整初稿。内容必须忠于论文，至少引用上面列出的三张原论文图，并覆盖问题、Transformer 架构、注意力机制、训练、主要实验、局限和结论。不要复制长段原文；每页保持听众可读的信息密度。生成完整的 slides.md。"
|
||
},
|
||
{
|
||
"role": "assistant",
|
||
"content": "```markdown\n---\ntheme: default\n---\n\n# Attention Is All You Need\n## A Revolutionary Architecture for Sequence Transduction\n\nAshish Vaswani et al. \nNIPS 2017\n\n---\n\n## Abstract\n\n- Proposes **Transformer** - first model based solely on attention mechanisms\n- Dispenses with recurrence and convolutions entirely\n- Superior quality while being more parallelizable and requiring less training time\n- Achieves 28.4 BLEU on WMT 2014 English-to-German (↑2 BLEU over previous best)\n- Achieves 41.8 BLEU on WMT 2014 English-to-French (new state-of-the-art)\n- Generalizes well to other tasks like English constituency parsing\n\n---\n\n## Background: The Problem with Existing Approaches\n\n### Recurrent Neural Networks (RNNs/LSTMs/GRUs)\n- Inherently sequential computation\n- Cannot parallelize within training examples\n- Difficult to learn long-range dependencies\n\n### Convolutional Approaches\n- ByteNet, ConvS2S use CNNs for parallelization\n- Number of operations grows with distance between positions\n- Linear (ConvS2S) or logarithmic (ByteNet) path lengths\n\n---\n\n## Key Insight: Attention is Sufficient\n\nAttention mechanisms allow modeling dependencies without regard to distance, but were previously used with RNNs.\n\n**Transformer**: First transduction model relying entirely on self-attention to compute representations without:\n- Sequence-aligned RNNs\n- Convolutions\n\n---\n\n## Transformer Architecture Overview\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-80 mx-auto\" />\n\n*Encoder-decoder structure with stacked self-attention and feed-forward layers*\n\n---\n\n## Encoder Structure\n\n- Stack of **6 identical layers**\n- Each layer has two sub-layers:\n 1. **Multi-head self-attention** mechanism\n 2. **Position-wise fully connected feed-forward network**\n- Residual connections around each sub-layer\n- Layer normalization after each sub-layer\n- All sub-layers produce outputs of dimension `d_model = 512`\n\n---\n\n## Decoder Structure\n\n- Stack of **6 identical layers**\n- Three sub-layers per layer:\n 1. Masked multi-head self-attention (prevents leftward information flow)\n 2. Multi-head attention over encoder output\n 3. Position-wise fully connected feed-forward network\n- Residual connections and layer normalization\n- Output embeddings offset by one position (auto-regressive property)\n\n---\n\n## Attention Mechanism\n\n### Scaled Dot-Product Attention\n$$\\text{Attention}(Q, K, V) = \\text{softmax}\\left(\\frac{QK^T}{\\sqrt{d_k}}\\right)V$$\n\n- $Q$ (queries), $K$ (keys), $V$ (values) are matrices\n- Scaling by $\\frac{1}{\\sqrt{d_k}}$ prevents gradients from becoming too small\n- Faster and more space-efficient than additive attention\n\n---\n\n## Multi-Head Attention\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-40 mx-auto\" />\n\n- Projects queries, keys, values $h$ times with different learned projections\n- Performs attention in parallel on projected versions\n- Concatenates results and projects again\n\n$$\\text{MultiHead}(Q, K, V) = \\text{Concat}(\\text{head}_1, ..., \\text{head}_h)W^O$$\nwhere $\\text{head}_i = \\text{Attention}(QW_i^Q, KW_i^K, VW_i^V)$\n\n---\n\n## Three Applications of Attention\n\n1. **Encoder-decoder attention**: Queries from decoder, keys/values from encoder\n2. **Encoder self-attention**: All keys, values, queries from previous encoder layer\n3. **Decoder self-attention**: All positions in decoder up to current position (masked)\n\n---\n\n## Positional Encoding\n\nSince model has no recurrence/convolution, we inject positional information:\n\n$$\\text{PE}_{(pos, 2i)} = \\sin\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n$$\\text{PE}_{(pos, 2i+1)} = \\cos\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n\n- Same dimension as embeddings ($d_{\\text{model}}$)\n- Allows model to learn relative position information\n- Performed nearly as well as learned positional embeddings\n\n---\n\n## Why Self-Attention?\n\n| Layer Type | Complexity | Sequential Operations | Max Path Length |\n|------------|------------|-----------------------|-----------------|\n| Self-Attention | $O(n^2 \\cdot d)$ | $O(1)$ | $O(1)$ |\n| Recurrent | $O(n \\cdot d^2)$ | $O(n)$ | $O(n)$ |\n| Convolutional | $O(k \\cdot n \\cdot d^2)$ | $O(1)$ | $O(\\log_k n)$ |\n\n- Constant path length between any positions\n- More parallelizable than RNNs\n- Better computational efficiency for typical sentence lengths\n\n---\n\n## Training Details\n\n### Data & Batching\n- WMT 2014 English-German (4.5M sentence pairs)\n- WMT 2014 English-French (36M sentence pairs)\n- Byte-pair encoding (37K shared vocab for EN-DE)\n- Batches with ~25000 source and target tokens\n\n### Hardware & Schedule\n- 8 NVIDIA P100 GPUs\n- Base model: 100,000 steps (12 hours)\n- Big model: 300,000 steps (3.5 days)\n\n---\n\n## Training Details (Cont.)\n\n### Optimizer\n- Adam with $\\beta_1 = 0.9$, $\\beta_2 = 0.98$, $\\epsilon = 10^{-9}$\n- Learning rate schedule:\n $$\\text{lrate} = d_{\\text{model}}^{-0.5} \\cdot \\min(\\text{step\\_num}^{-0.5}, \\text{step\\_num} \\cdot \\text{warmup\\_steps}^{-1.5})$$\n- Warmup steps = 4000\n\n### Regularization\n- Residual dropout (P_drop = 0.1)\n- Label smoothing ($\\epsilon_{ls} = 0.1$)\n\n---\n\n## Machine Translation Results\n\n| Model | EN-DE BLEU | EN-FR BLEU | Training Cost (FLOPs) |\n|-------|------------|------------|-----------------------|\n| GNMT + RL Ensemble | 26.30 | 41.16 | $1.8 \\cdot 10^{20}$ |\n| ConvS2S Ensemble | 26.36 | 41.29 | $7.7 \\cdot 10^{19}$ |\n| **Transformer (big)** | **28.4** | **41.8** | **$2.3 \\cdot 10^{19}$** |\n\n- Transformer outperforms all previous state-of-the-art models\n- Achieves better results with significantly lower training cost\n- 28.4 BLEU on EN-DE (↑2 BLEU over previous best)\n- 41.8 BLEU on EN-FR (new state-of-the-art)\n\n---\n\n## Model Variations Analysis\n\n| Variation | Dev PPL | Dev BLEU |\n|-----------|---------|----------|\n| Base model | 4.92 | 25.8 |\n| Single attention head | 5.29 | 24.9 |\n| No dropout | 5.77 | 24.6 |\n| Learned positional embeddings | 4.92 | 25.7 |\n| Big model | 4.33 | 26.4 |\n\n- Multiple attention heads improve performance\n- Dropout is crucial for avoiding overfitting\n- Sinusoidal and learned positional encodings perform similarly\n- Larger models (more dimensions, more heads) improve performance\n\n---\n\n## Generalization to Other Tasks: English Constituency Parsing\n\n| Parser | Training | WSJ 23 F1 |\n|--------|----------|-----------|\n| Petrov et al. (2006) | WSJ only | 90.4 |\n| Dyer et al. (2016) | WSJ only | 91.7 |\n| **Transformer (4 layers)** | **WSJ only** | **91.3** |\n| Vinyals & Kaiser et al. | Semi-supervised | 92.1 |\n| **Transformer (4 layers)** | **Semi-supervised** | **92.7** |\n\n- Transformer performs well despite no task-specific tuning\n- Outperforms previous models in semi-supervised setting\n- Shows generalization ability beyond machine translation\n\n---\n\n## Attention Visualization: Long-Distance Dependencies\n\n<img src=\"/paper_figure_3_long_distance.png\" class=\"h-70 mx-auto\" />\n\n*Encoder self-attention in layer 5 showing attention to distant dependency of the verb \"making\"*\n\n---\n\n## Attention Visualization: Anaphora Resolution\n\n<img src=\"/paper_figure_4_anaphora.png\" class=\"h-70 mx-auto\" />\n\n*Attention heads involved in resolving \"its\" reference to \"The Law\"*\n\n---\n\n## Limitations\n\n- Computational complexity grows quadratically with sequence length\n- Less effective for very long sequences (e.g., books, articles)\n- Still requires sequential generation in decoder\n- Limited ability to model hierarchical structure compared to some syntactic models\n\n---\n\n## Conclusion and Future Work\n\n### Key Contributions\n- Introduced Transformer architecture based solely on attention\n- Achieved new state-of-the-art results in machine translation\n- Demonstrated improved parallelization and reduced training time\n- Showed generalization to other tasks like constituency parsing\n\n### Future Directions\n- Apply to other modalities (images, audio, video)\n- Investigate local, restricted attention for large inputs\n- Make generation less sequential\n- Explore interpretability of attention mechanisms\n\n---\n\n## Thank You\n\nCode available at: https://github.com/tensorflow/tensor2tensor\n\narXiv:1706.03762v7 [cs.CL]\n```"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": "审核者（Reviewer）渲染了你上一版 slides.md 的每一页截图，给出如下结构化改进建议（JSON）：\n\n{\n \"overall_score\": 65,\n \"pass\": false,\n \"issues\": [\n {\n \"page\": 2,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将6个要点拆分为2页，每页不超过3-4个要点，或精简合并相似内容\"\n },\n {\n \"page\": 3,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将RNN和卷积方法分两页展示，或每个部分保留2个核心要点\"\n },\n {\n \"page\": 5,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"放大架构图至至少占页面60%空间，确保图中文字和模块清晰可见\"\n },\n {\n \"page\": 5,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，或单独用一页解释架构细节\"\n },\n {\n \"page\": 7,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将3个子要点拆分为独立要点，或移至下一页单独讲解decoder子层结构\"\n },\n {\n \"page\": 9,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"放大多头注意力机制图，确保每个头的结构和连接关系清晰可辨\"\n },\n {\n \"page\": 9,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，公式保持现有大小即可\"\n },\n {\n \"page\": 13,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将Data & Batching和Hardware & Schedule分两页展示，或各保留2个最关键要点\"\n },\n {\n \"page\": 15,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"表格保留核心对比数据，4个要点精简为2-3个核心结论\"\n },\n {\n \"page\": 18,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"单独一页放大展示注意力可视化图，确保能看清词语间的注意力连接关系\"\n },\n {\n \"page\": 18,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，用简洁标题概括可视化内容\"\n },\n {\n \"page\": 19,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"单独一页放大展示指代消解可视化图，确保紫色连接线和词语清晰可见\"\n },\n {\n \"page\": 19,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，直接在标题中说明可视化内容\"\n },\n {\n \"page\": 21,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将Key Contributions和Future Directions分两页展示，每部分保留3-4个要点\"\n }\n ]\n}\n\n请理解这些问题并修订 slides.md（可拆页、精简文字、调整图片尺寸等），重新输出完整的 slides.md。"
|
||
}
|
||
],
|
||
"temperature": 0.3
|
||
},
|
||
"response": {
|
||
"id": "0217853615970865c53bb980d0b91addac92a88f9eb9598e53af3",
|
||
"model": "doubao-seed-1-6-250615",
|
||
"finish_reason": "stop",
|
||
"content": "```markdown\n---\ntheme: default\n---\n\n# Attention Is All You Need\n## A Revolutionary Architecture for Sequence Transduction\n\nAshish Vaswani et al. \nNIPS 2017\n\n---\n\n## Abstract: Key Innovation\n\n- Proposes **Transformer** - first model based solely on attention mechanisms\n- Dispenses with recurrence and convolutions entirely\n- More parallelizable and requires significantly less training time\n\n---\n\n## Abstract: Performance Highlights\n\n- Achieves 28.4 BLEU on WMT 2014 English-to-German\n - Improves over existing best results by over 2 BLEU\n- Establishes new state-of-the-art 41.8 BLEU on WMT 2014 English-to-French\n- Generalizes well to other tasks like English constituency parsing\n\n---\n\n## Background: Limitations of RNNs\n\n### Recurrent Neural Networks (RNNs/LSTMs/GRUs)\n- Inherently sequential computation\n- Cannot parallelize within training examples\n- Difficult to learn long-range dependencies\n- Memory constraints limit batching for long sequences\n\n---\n\n## Background: Limitations of Convolutional Approaches\n\n### CNN-based Models (ByteNet, ConvS2S)\n- Use convolutions for parallelization\n- Number of operations grows with distance between positions\n - Linear growth for ConvS2S\n - Logarithmic growth for ByteNet\n- Longer path lengths between distant positions\n\n---\n\n## Key Insight: Attention is Sufficient\n\nAttention mechanisms allow modeling dependencies without regard to distance, but were previously used with RNNs.\n\n**Transformer**: First transduction model relying entirely on self-attention to compute representations without:\n- Sequence-aligned RNNs\n- Convolutions\n\n---\n\n## Transformer Architecture Overview\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-96 mx-auto\" />\n\n---\n\n## Encoder Structure\n\n- Stack of **6 identical layers**\n- Each layer contains two sub-layers:\n 1. Multi-head self-attention mechanism\n 2. Position-wise fully connected feed-forward network\n- Residual connections around each sub-layer\n- Layer normalization after each sub-layer\n\n---\n\n## Decoder Structure\n\n- Stack of **6 identical layers**\n- Three sub-layers per layer:\n 1. Masked multi-head self-attention\n 2. Multi-head attention over encoder output\n 3. Position-wise fully connected feed-forward network\n- Residual connections and layer normalization\n\n---\n\n## Decoder: Masking Mechanism\n\n- Prevents positions from attending to subsequent positions\n- Ensures predictions for position i depend only on:\n - Known outputs at positions < i\n - Output embeddings offset by one position\n- Preserves auto-regressive property\n\n---\n\n## Attention Mechanism\n\n### Scaled Dot-Product Attention\n$$\\text{Attention}(Q, K, V) = \\text{softmax}\\left(\\frac{QK^T}{\\sqrt{d_k}}\\right)V$$\n\n- $Q$ (queries), $K$ (keys), $V$ (values) are matrices\n- Scaling by $\\frac{1}{\\sqrt{d_k}}$ prevents gradients from becoming too small\n- Faster and more space-efficient than additive attention\n\n---\n\n## Multi-Head Attention\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-80 mx-auto\" />\n\n- Projects queries, keys, values $h$ times with different learned projections\n- Performs attention in parallel on projected versions\n- Concatenates results and projects again\n\n---\n\n## Three Applications of Attention\n\n1. **Encoder-decoder attention**: \n - Queries from decoder\n - Keys/values from encoder output\n\n2. **Encoder self-attention**:\n - All keys, values, queries from previous encoder layer\n - Each position attends to all positions\n\n3. **Decoder self-attention**:\n - All positions in decoder up to current position\n - Masked to prevent future information flow\n\n---\n\n## Positional Encoding\n\nSince model has no recurrence/convolution, we inject positional information:\n\n$$\\text{PE}_{(pos, 2i)} = \\sin\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n$$\\text{PE}_{(pos, 2i+1)} = \\cos\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n\n- Same dimension as embeddings ($d_{\\text{model}}$)\n- Allows model to learn relative position information\n- Performed nearly as well as learned positional embeddings\n\n---\n\n## Why Self-Attention?\n\n| Layer Type | Complexity | Sequential Operations | Max Path Length |\n|------------|------------|-----------------------|-----------------|\n| Self-Attention | $O(n^2 \\cdot d)$ | $O(1)$ | $O(1)$ |\n| Recurrent | $O(n \\cdot d^2)$ | $O(n)$ | $O(n)$ |\n| Convolutional | $O(k \\cdot n \\cdot d^2)$ | $O(1)$ | $O(\\log_k n)$ |\n\n---\n\n## Training: Data & Batching\n\n- WMT 2014 English-German (4.5M sentence pairs)\n- WMT 2014 English-French (36M sentence pairs)\n- Byte-pair encoding (37K shared vocab for EN-DE)\n- Batches with ~25000 source and target tokens\n\n---\n\n## Training: Hardware & Schedule\n\n- 8 NVIDIA P100 GPUs\n- Base model: 100,000 steps (12 hours)\n- Big model: 300,000 steps (3.5 days)\n- Adam optimizer with scheduled learning rate\n\n---\n\n## Machine Translation Results\n\n| Model | EN-DE BLEU | EN-FR BLEU | Training Cost (FLOPs) |\n|-------|------------|------------|-----------------------|\n| GNMT + RL Ensemble | 26.30 | 41.16 | $1.8 \\cdot 10^{20}$ |\n| ConvS2S Ensemble | 26.36 | 41.29 | $7.7 \\cdot 10^{19}$ |\n| **Transformer (big)** | **28.4** | **41.8** | **$2.3 \\cdot 10^{19}$** |\n\n---\n\n## Model Variations Analysis\n\n| Variation | Dev PPL | Dev BLEU |\n|-----------|---------|----------|\n| Base model | 4.92 | 25.8 |\n| Single attention head | 5.29 | 24.9 |\n| No dropout | 5.77 | 24.6 |\n| Learned positional embeddings | 4.92 | 25.7 |\n\n---\n\n## Generalization to Constituency Parsing\n\n| Parser | Training | WSJ 23 F1 |\n|--------|----------|-----------|\n| Previous state-of-the-art | WSJ only | 91.7 |\n| **Transformer (4 layers)** | **WSJ only** | **91.3** |\n| Previous state-of-the-art | Semi-supervised | 92.1 |\n| **Transformer (4 layers)** | **Semi-supervised** | **92.7** |\n\n---\n\n## Attention Visualization: Long-Distance Dependencies\n\n<img src=\"/paper_figure_3_long_distance.png\" class=\"h-96 mx-auto\" />\n\n*Encoder self-attention showing long-distance dependency for \"making\"*\n\n---\n\n## Attention Visualization: Anaphora Resolution\n\n<img src=\"/paper_figure_4_anaphora.png\" class=\"h-96 mx-auto\" />\n\n*Attention heads resolving \"its\" reference to \"The Law\"*\n\n---\n\n## Limitations\n\n- Computational complexity grows quadratically with sequence length\n- Less effective for very long sequences\n- Still requires sequential generation in decoder\n- Limited ability to model hierarchical structure\n\n---\n\n## Key Contributions\n\n- Introduced Transformer architecture based solely on attention\n- Achieved new state-of-the-art results in machine translation\n- Demonstrated improved parallelization and reduced training time\n- Showed generalization to other tasks like constituency parsing\n\n---\n\n## Future Work\n\n- Apply to other modalities (images, audio, video)\n- Investigate local, restricted attention for large inputs\n- Make generation less sequential\n- Explore interpretability of attention mechanisms\n\n---\n\n## Thank You\n\nCode available at: https://github.com/tensorflow/tensor2tensor\n\narXiv:1706.03762v7 [cs.CL]\n```"
|
||
},
|
||
"usage": {
|
||
"prompt_tokens": 14985,
|
||
"completion_tokens": 2395,
|
||
"total_tokens": 17380,
|
||
"cached_prompt_tokens": 0
|
||
}
|
||
},
|
||
{
|
||
"meter": "Reviewer(每轮只看最新截图)",
|
||
"called_at_utc": "2026-07-29T21:49:25.296078+00:00",
|
||
"latency_s": 98.99,
|
||
"request": {
|
||
"model": "doubao-seed-1-6-250615",
|
||
"messages": [
|
||
{
|
||
"role": "system",
|
||
"content": "你是一名严格的演示文稿质量审核员（Reviewer）。你会看到一份由 Slidev 渲染出的 PPT，\n每张图对应一页幻灯片（按顺序编号，从第 1 页开始）。请逐页检查以下问题：\n\n- text_overflow（文字溢出/被裁切超出页面边界）\n- overcrowded（内容过多/过于拥挤/留白不足）\n- image_size（图片过大顶出布局，或过小看不清）\n- readability（字号过小、对比度差、代码块难读）\n- layout（对齐混乱、标题与正文比例失衡、空页）\n\n请以**目标用户是听众**的严格标准审查——一页幻灯片若要点超过约 5 条、或正文文字块偏长、\n或图片挤压了文字空间，都应视为 overcrowded/image_size 问题。报告真实存在的问题，\n但不要放过\"塞得太满\"。对每个问题给出：page（页码，整数）、\nissue_type（上面之一）、severity（high/medium/low）、suggestion（具体、可执行的修改建议，中文）。\n\n同时给出：\n- overall_score：0-100 的整体质量分（越高越好）\n- pass：布尔值，仅当整份 PPT **既无 high 也无 medium 级问题**、排版干净可读时才为 true\n\n严格输出如下 JSON（不要输出任何多余文字）：\n{\n \"overall_score\": <int>,\n \"pass\": <bool>,\n \"issues\": [\n {\"page\": <int>, \"issue_type\": \"<type>\", \"severity\": \"<high|medium|low>\", \"suggestion\": \"<中文建议>\"}\n ]\n}"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": [
|
||
{
|
||
"type": "text",
|
||
"text": "这份 PPT 共 26 页，下面按页码顺序给出每一页的渲染截图。请审查。"
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 1 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "43e962b781454c3d5eac7723de28844f9fe12cee5370e89387f0273d1c119d0a",
|
||
"characters": 89538,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 2 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "b2a0e0ec4af087661538cb21aeaa925ce2649277fea60edf6e1909e7bc995f27",
|
||
"characters": 89158,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 3 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "19b9176369105b1ad2465089e86ff40cbfc818975d4423fa383d04d9593f919c",
|
||
"characters": 112834,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 4 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "e4f81ff0785c205c5317d8b547bcd89df9a11fd1f7d9b46085ed39758421b81b",
|
||
"characters": 114062,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 5 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "5a9843c5e0326a27cd89eaedb92dafb54a3b58609938c2c03d11f759e16d8192",
|
||
"characters": 137070,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 6 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "3aff1d8f78e992b811abfb7056b3f702a7f9b9e0252d87589169b320329ea9cd",
|
||
"characters": 115978,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 7 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "c073a0b84cbdb5350cc1d693c7f6319bb76f39c702574de638c34bb2d392bca3",
|
||
"characters": 147970,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 8 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "db5bcdbba334059522e1a9b7b01c8bab164f4a962bc22be30c9f9f855bfe2685",
|
||
"characters": 103602,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 9 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "63fe0413fa07027b2fe388429a162d4ce91f8ea69556ca65abd43a1e9684f79c",
|
||
"characters": 102022,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 10 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "27d65e4108ee52af5bcf0e51c6b13ad2c01934b66eb03f2e04daea7319813c42",
|
||
"characters": 105994,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 11 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "8559bdc49da07f01235da0fa53449148195874fd2f682c332cb4023b88b6ff02",
|
||
"characters": 119686,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 12 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "78cca32823e959f64dd6b7147d1524d140a910c0ca1c891d63da65338414dd55",
|
||
"characters": 168710,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 13 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "f7633042bb42600ed822ff4e3684a6c6a3db09a2499a530c50125459bc87f2d6",
|
||
"characters": 139330,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 14 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "dd95550e6ada1f29652e54f3c829782fc745de53586acfa85a90695cfac91793",
|
||
"characters": 137506,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 15 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "5fc4a95473691f535e128b95c41e85133708a749a2a87f9ddbe112a9ba2402ef",
|
||
"characters": 97342,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 16 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "2c7fb3227dcfd25e3042f31fc72a993828b6077c763eae29ddabc4f9c447100e",
|
||
"characters": 97650,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 17 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "c5b9f0de1522bfd3fd42727069f3f6d95ff4240198364b8c732b14b650de0dc7",
|
||
"characters": 83218,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 18 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "bb1768052f2a5579e1a26d7c32e67b0e481210c82f3081bf00103f2f515f518c",
|
||
"characters": 92922,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 19 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "4c1cdf9a1e5871e41887af17e0cf5b8f75431b35e459bfe90704ec72aae75a43",
|
||
"characters": 82314,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 20 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "7069e51ab552ba7114c950ff8c927d6571a74b15adf8faa9f944c4b9cc9e6837",
|
||
"characters": 106682,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 21 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "b42989a6127de6ef44f325113d5039ebbf3e78b4fdfb281cecddacaf73bdcabb",
|
||
"characters": 195762,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 22 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "14300812caec1610d2b2422535e3353de82473a88cb4c24be07d753359d9bbe7",
|
||
"characters": 205778,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 23 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "a2a46d6bbb77b2d069468a2813a6af415521c3d2b27f762bbd55019c44fcb9ff",
|
||
"characters": 84722,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 24 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "42ef0dc5c23a813c11147181dff3b9c5d61fd75ec5482e122e8faceb6c4cf62e",
|
||
"characters": 105366,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 25 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "f48dd24cfbffd6249e0d54a44b5feb543b2cf1c54e5b48ad119ba532c08e2a16",
|
||
"characters": 81506,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 26 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "664fadc511edb5003c94f280fbdebe1a87fa9af4deb179cef896c1499ea8db5c",
|
||
"characters": 51614,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
}
|
||
]
|
||
}
|
||
],
|
||
"temperature": 0.2
|
||
},
|
||
"response": {
|
||
"id": "021785361727184618be72f3907769bd1896ffa0351d575676ab4",
|
||
"model": "doubao-seed-1-6-250615",
|
||
"finish_reason": "stop",
|
||
"content": "{\n \"overall_score\": 65,\n \"pass\": false,\n \"issues\": [\n {\"page\": 7, \"issue_type\": \"image_size\", \"severity\": \"medium\", \"suggestion\": \"缩小架构图尺寸，确保下方说明文字有足够空间，避免图片挤压文字区域\"},\n {\"page\": 8, \"issue_type\": \"overcrowded\", \"severity\": \"medium\", \"suggestion\": \"将5个要点拆分为两页，建议将\\\"每个层包含两个子层\\\"及其子要点单独成页\"},\n {\"page\": 12, \"issue_type\": \"image_size\", \"severity\": \"medium\", \"suggestion\": \"调整多头注意力架构图大小，确保图片下方的文字说明完整可见且易于阅读\"},\n {\"page\": 13, \"issue_type\": \"overcrowded\", \"severity\": \"low\", \"suggestion\": \"将三个注意力应用拆分为单独页面，或简化每个应用的子要点描述\"},\n {\"page\": 21, \"issue_type\": \"image_size\", \"severity\": \"high\", \"suggestion\": \"大幅放大注意力可视化图，确保图中文字和颜色编码清晰可辨，必要时单独成页展示\"},\n {\"page\": 22, \"issue_type\": \"image_size\", \"severity\": \"high\", \"suggestion\": \"放大指代消解可视化图，增加图片分辨率，确保线条和文字清晰可读\"}\n ]\n}"
|
||
},
|
||
"usage": {
|
||
"prompt_tokens": 31266,
|
||
"completion_tokens": 1475,
|
||
"total_tokens": 32741,
|
||
"cached_prompt_tokens": 0
|
||
}
|
||
},
|
||
{
|
||
"meter": "Proposer(纯文本)",
|
||
"called_at_utc": "2026-07-29T21:50:16.603261+00:00",
|
||
"latency_s": 51.299,
|
||
"request": {
|
||
"model": "doubao-seed-1-6-250615",
|
||
"messages": [
|
||
{
|
||
"role": "system",
|
||
"content": "你是一名擅长把学术论文转化为演示文稿的 Proposer Agent。\n你用 Slidev 框架（Markdown + HTML）编写 PPT 源码 slides.md。\n\nSlidev 语法要点：\n- 文件开头是 YAML frontmatter（--- 包裹），设置 theme: default。\n- 用单独一行的 `---`（前后空行）分隔每一页幻灯片。\n- 首页通常放标题、作者、会议。\n- 引用图片用 markdown：，可用 HTML 控制尺寸，\n 例如 <img src=\"/speedup_bar.png\" class=\"h-60 mx-auto\" />。\n- 可用 Windi/Uno CSS 工具类控制排版（如 text-sm、grid grid-cols-2 gap-4）。\n\n要求：\n- 最终生成 10-20 页，覆盖论文的标题、背景/动机、方法、实验结果、局限与结论。\n- 至少在 3 页中使用提供的图表/表格，且图文匹配。\n- 每页信息量适中、不要塞太多字，宁可拆页也不要溢出。\n- 只输出 slides.md 的完整内容，用 ```markdown 代码块包裹，不要额外解释。"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": "以下是论文全文（Markdown）：\n\n# Attention Is All You Need\n\nAuthors: Ashish Vaswani et al.\n\n\n## PDF page 1\n\nProvided proper attribution is provided, Google hereby grants permission to\nreproduce the tables and figures in this paper solely for use in journalistic or\nscholarly works.\nAttention Is All You Need\nAshish Vaswani∗\nGoogle Brain\navaswani@google.com\nNoam Shazeer∗\nGoogle Brain\nnoam@google.com\nNiki Parmar∗\nGoogle Research\nnikip@google.com\nJakob Uszkoreit∗\nGoogle Research\nusz@google.com\nLlion Jones∗\nGoogle Research\nllion@google.com\nAidan N. Gomez∗†\nUniversity of Toronto\naidan@cs.toronto.edu\nŁukasz Kaiser∗\nGoogle Brain\nlukaszkaiser@google.com\nIllia Polosukhin∗‡\nillia.polosukhin@gmail.com\nAbstract\nThe dominant sequence transduction models are based on complex recurrent or\nconvolutional neural networks that include an encoder and a decoder. The best\nperforming models also connect the encoder and decoder through an attention\nmechanism. We propose a new simple network architecture, the Transformer,\nbased solely on attention mechanisms, dispensing with recurrence and convolutions\nentirely. Experiments on two machine translation tasks show these models to\nbe superior in quality while being more parallelizable and requiring significantly\nless time to train. Our model achieves 28.4 BLEU on the WMT 2014 English-\nto-German translation task, improving over the existing best results, including\nensembles, by over 2 BLEU. On the WMT 2014 English-to-French translation task,\nour model establishes a new single-model state-of-the-art BLEU score of 41.8 after\ntraining for 3.5 days on eight GPUs, a small fraction of the training costs of the\nbest models from the literature. We show that the Transformer generalizes well to\nother tasks by applying it successfully to English constituency parsing both with\nlarge and limited training data.\n∗Equal contribution. Listing order is random. Jakob proposed replacing RNNs with self-attention and started\nthe effort to evaluate this idea. Ashish, with Illia, designed and implemented the first Transformer models and\nhas been crucially involved in every aspect of this work. Noam proposed scaled dot-product attention, multi-head\nattention and the parameter-free position representation and became the other person involved in nearly every\ndetail. Niki designed, implemented, tuned and evaluated countless model variants in our original codebase and\ntensor2tensor. Llion also experimented with novel model variants, was responsible for our initial codebase, and\nefficient inference and visualizations. Lukasz and Aidan spent countless long days designing various parts of and\nimplementing tensor2tensor, replacing our earlier codebase, greatly improving results and massively accelerating\nour research.\n†Work performed while at Google Brain.\n‡Work performed while at Google Research.\n31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA.\narXiv:1706.03762v7 [cs.CL] 2 Aug 2023\n\n\n## PDF page 2\n\n1\nIntroduction\nRecurrent neural networks, long short-term memory [13] and gated recurrent [7] neural networks\nin particular, have been firmly established as state of the art approaches in sequence modeling and\ntransduction problems such as language modeling and machine translation [35, 2, 5]. Numerous\nefforts have since continued to push the boundaries of recurrent language models and encoder-decoder\narchitectures [38, 24, 15].\nRecurrent models typically factor computation along the symbol positions of the input and output\nsequences. Aligning the positions to steps in computation time, they generate a sequence of hidden\nstates ht, as a function of the previous hidden state ht−1 and the input for position t. This inherently\nsequential nature precludes parallelization within training examples, which becomes critical at longer\nsequence lengths, as memory constraints limit batching across examples. Recent work has achieved\nsignificant improvements in computational efficiency through factorization tricks [21] and conditional\ncomputation [32], while also improving model performance in case of the latter. The fundamental\nconstraint of sequential computation, however, remains.\nAttention mechanisms have become an integral part of compelling sequence modeling and transduc-\ntion models in various tasks, allowing modeling of dependencies without regard to their distance in\nthe input or output sequences [2, 19]. In all but a few cases [27], however, such attention mechanisms\nare used in conjunction with a recurrent network.\nIn this work we propose the Transformer, a model architecture eschewing recurrence and instead\nrelying entirely on an attention mechanism to draw global dependencies between input and output.\nThe Transformer allows for significantly more parallelization and can reach a new state of the art in\ntranslation quality after being trained for as little as twelve hours on eight P100 GPUs.\n2\nBackground\nThe goal of reducing sequential computation also forms the foundation of the Extended Neural GPU\n[16], ByteNet [18] and ConvS2S [9], all of which use convolutional neural networks as basic building\nblock, computing hidden representations in parallel for all input and output positions. In these models,\nthe number of operations required to relate signals from two arbitrary input or output positions grows\nin the distance between positions, linearly for ConvS2S and logarithmically for ByteNet. This makes\nit more difficult to learn dependencies between distant positions [12]. In the Transformer this is\nreduced to a constant number of operations, albeit at the cost of reduced effective resolution due\nto averaging attention-weighted positions, an effect we counteract with Multi-Head Attention as\ndescribed in section 3.2.\nSelf-attention, sometimes called intra-attention is an attention mechanism relating different positions\nof a single sequence in order to compute a representation of the sequence. Self-attention has been\nused successfully in a variety of tasks including reading comprehension, abstractive summarization,\ntextual entailment and learning task-independent sentence representations [4, 27, 28, 22].\nEnd-to-end memory networks are based on a recurrent attention mechanism instead of sequence-\naligned recurrence and have been shown to perform well on simple-language question answering and\nlanguage modeling tasks [34].\nTo the best of our knowledge, however, the Transformer is the first transduction model relying\nentirely on self-attention to compute representations of its input and output without using sequence-\naligned RNNs or convolution. In the following sections, we will describe the Transformer, motivate\nself-attention and discuss its advantages over models such as [17, 18] and [9].\n3\nModel Architecture\nMost competitive neural sequence transduction models have an encoder-decoder structure [5, 2, 35].\nHere, the encoder maps an input sequence of symbol representations (x1, ..., xn) to a sequence\nof continuous representations z = (z1, ..., zn). Given z, the decoder then generates an output\nsequence (y1, ..., ym) of symbols one element at a time. At each step the model is auto-regressive\n[10], consuming the previously generated symbols as additional input when generating the next.\n2\n\n\n## PDF page 3\n\nFigure 1: The Transformer - model architecture.\nThe Transformer follows this overall architecture using stacked self-attention and point-wise, fully\nconnected layers for both the encoder and decoder, shown in the left and right halves of Figure 1,\nrespectively.\n3.1\nEncoder and Decoder Stacks\nEncoder:\nThe encoder is composed of a stack of N = 6 identical layers. Each layer has two\nsub-layers. The first is a multi-head self-attention mechanism, and the second is a simple, position-\nwise fully connected feed-forward network. We employ a residual connection [11] around each of\nthe two sub-layers, followed by layer normalization [1]. That is, the output of each sub-layer is\nLayerNorm(x + Sublayer(x)), where Sublayer(x) is the function implemented by the sub-layer\nitself. To facilitate these residual connections, all sub-layers in the model, as well as the embedding\nlayers, produce outputs of dimension dmodel = 512.\nDecoder:\nThe decoder is also composed of a stack of N = 6 identical layers. In addition to the two\nsub-layers in each encoder layer, the decoder inserts a third sub-layer, which performs multi-head\nattention over the output of the encoder stack. Similar to the encoder, we employ residual connections\naround each of the sub-layers, followed by layer normalization. We also modify the self-attention\nsub-layer in the decoder stack to prevent positions from attending to subsequent positions. This\nmasking, combined with fact that the output embeddings are offset by one position, ensures that the\npredictions for position i can depend only on the known outputs at positions less than i.\n3.2\nAttention\nAn attention function can be described as mapping a query and a set of key-value pairs to an output,\nwhere the query, keys, values, and output are all vectors. The output is computed as a weighted sum\n3\n\n\n## PDF page 4\n\nScaled Dot-Product Attention\nMulti-Head Attention\nFigure 2: (left) Scaled Dot-Product Attention. (right) Multi-Head Attention consists of several\nattention layers running in parallel.\nof the values, where the weight assigned to each value is computed by a compatibility function of the\nquery with the corresponding key.\n3.2.1\nScaled Dot-Product Attention\nWe call our particular attention \"Scaled Dot-Product Attention\" (Figure 2). The input consists of\nqueries and keys of dimension dk, and values of dimension dv. We compute the dot products of the\nquery with all keys, divide each by √dk, and apply a softmax function to obtain the weights on the\nvalues.\nIn practice, we compute the attention function on a set of queries simultaneously, packed together\ninto a matrix Q. The keys and values are also packed together into matrices K and V . We compute\nthe matrix of outputs as:\nAttention(Q, K, V ) = softmax(QKT\n√dk\n)V\n(1)\nThe two most commonly used attention functions are additive attention [2], and dot-product (multi-\nplicative) attention. Dot-product attention is identical to our algorithm, except for the scaling factor\nof\n1\n√dk . Additive attention computes the compatibility function using a feed-forward network with\na single hidden layer. While the two are similar in theoretical complexity, dot-product attention is\nmuch faster and more space-efficient in practice, since it can be implemented using highly optimized\nmatrix multiplication code.\nWhile for small values of dk the two mechanisms perform similarly, additive attention outperforms\ndot product attention without scaling for larger values of dk [3]. We suspect that for large values of\ndk, the dot products grow large in magnitude, pushing the softmax function into regions where it has\nextremely small gradients 4. To counteract this effect, we scale the dot products by\n1\n√dk .\n3.2.2\nMulti-Head Attention\nInstead of performing a single attention function with dmodel-dimensional keys, values and queries,\nwe found it beneficial to linearly project the queries, keys and values h times with different, learned\nlinear projections to dk, dk and dv dimensions, respectively. On each of these projected versions of\nqueries, keys and values we then perform the attention function in parallel, yielding dv-dimensional\n4To illustrate why the dot products get large, assume that the components of q and k are independent random\nvariables with mean 0 and variance 1. Then their dot product, q · k = Pdk\ni=1 qiki, has mean 0 and variance dk.\n4\n\n\n## PDF page 5\n\noutput values. These are concatenated and once again projected, resulting in the final values, as\ndepicted in Figure 2.\nMulti-head attention allows the model to jointly attend to information from different representation\nsubspaces at different positions. With a single attention head, averaging inhibits this.\nMultiHead(Q, K, V ) = Concat(head1, ..., headh)W O\nwhere headi = Attention(QW Q\ni , KW K\ni , V W V\ni )\nWhere the projections are parameter matrices W Q\ni\n∈Rdmodel×dk, W K\ni\n∈Rdmodel×dk, W V\ni\n∈Rdmodel×dv\nand W O ∈Rhdv×dmodel.\nIn this work we employ h = 8 parallel attention layers, or heads. For each of these we use\ndk = dv = dmodel/h = 64. Due to the reduced dimension of each head, the total computational cost\nis similar to that of single-head attention with full dimensionality.\n3.2.3\nApplications of Attention in our Model\nThe Transformer uses multi-head attention in three different ways:\n• In \"encoder-decoder attention\" layers, the queries come from the previous decoder layer,\nand the memory keys and values come from the output of the encoder. This allows every\nposition in the decoder to attend over all positions in the input sequence. This mimics the\ntypical encoder-decoder attention mechanisms in sequence-to-sequence models such as\n[38, 2, 9].\n• The encoder contains self-attention layers. In a self-attention layer all of the keys, values\nand queries come from the same place, in this case, the output of the previous layer in the\nencoder. Each position in the encoder can attend to all positions in the previous layer of the\nencoder.\n• Similarly, self-attention layers in the decoder allow each position in the decoder to attend to\nall positions in the decoder up to and including that position. We need to prevent leftward\ninformation flow in the decoder to preserve the auto-regressive property. We implement this\ninside of scaled dot-product attention by masking out (setting to −∞) all values in the input\nof the softmax which correspond to illegal connections. See Figure 2.\n3.3\nPosition-wise Feed-Forward Networks\nIn addition to attention sub-layers, each of the layers in our encoder and decoder contains a fully\nconnected feed-forward network, which is applied to each position separately and identically. This\nconsists of two linear transformations with a ReLU activation in between.\nFFN(x) = max(0, xW1 + b1)W2 + b2\n(2)\nWhile the linear transformations are the same across different positions, they use different parameters\nfrom layer to layer. Another way of describing this is as two convolutions with kernel size 1.\nThe dimensionality of input and output is dmodel = 512, and the inner-layer has dimensionality\ndff = 2048.\n3.4\nEmbeddings and Softmax\nSimilarly to other sequence transduction models, we use learned embeddings to convert the input\ntokens and output tokens to vectors of dimension dmodel. We also use the usual learned linear transfor-\nmation and softmax function to convert the decoder output to predicted next-token probabilities. In\nour model, we share the same weight matrix between the two embedding layers and the pre-softmax\nlinear transformation, similar to [30]. In the embedding layers, we multiply those weights by √dmodel.\n5\n\n\n## PDF page 6\n\nTable 1: Maximum path lengths, per-layer complexity and minimum number of sequential operations\nfor different layer types. n is the sequence length, d is the representation dimension, k is the kernel\nsize of convolutions and r the size of the neighborhood in restricted self-attention.\nLayer Type\nComplexity per Layer\nSequential\nMaximum Path Length\nOperations\nSelf-Attention\nO(n2 · d)\nO(1)\nO(1)\nRecurrent\nO(n · d2)\nO(n)\nO(n)\nConvolutional\nO(k · n · d2)\nO(1)\nO(logk(n))\nSelf-Attention (restricted)\nO(r · n · d)\nO(1)\nO(n/r)\n3.5\nPositional Encoding\nSince our model contains no recurrence and no convolution, in order for the model to make use of the\norder of the sequence, we must inject some information about the relative or absolute position of the\ntokens in the sequence. To this end, we add \"positional encodings\" to the input embeddings at the\nbottoms of the encoder and decoder stacks. The positional encodings have the same dimension dmodel\nas the embeddings, so that the two can be summed. There are many choices of positional encodings,\nlearned and fixed [9].\nIn this work, we use sine and cosine functions of different frequencies:\nPE(pos,2i) = sin(pos/100002i/dmodel)\nPE(pos,2i+1) = cos(pos/100002i/dmodel)\nwhere pos is the position and i is the dimension. That is, each dimension of the positional encoding\ncorresponds to a sinusoid. The wavelengths form a geometric progression from 2π to 10000 · 2π. We\nchose this function because we hypothesized it would allow the model to easily learn to attend by\nrelative positions, since for any fixed offset k, PEpos+k can be represented as a linear function of\nPEpos.\nWe also experimented with using learned positional embeddings [9] instead, and found that the two\nversions produced nearly identical results (see Table 3 row (E)). We chose the sinusoidal version\nbecause it may allow the model to extrapolate to sequence lengths longer than the ones encountered\nduring training.\n4\nWhy Self-Attention\nIn this section we compare various aspects of self-attention layers to the recurrent and convolu-\ntional layers commonly used for mapping one variable-length sequence of symbol representations\n(x1, ..., xn) to another sequence of equal length (z1, ..., zn), with xi, zi ∈Rd, such as a hidden\nlayer in a typical sequence transduction encoder or decoder. Motivating our use of self-attention we\nconsider three desiderata.\nOne is the total computational complexity per layer. Another is the amount of computation that can\nbe parallelized, as measured by the minimum number of sequential operations required.\nThe third is the path length between long-range dependencies in the network. Learning long-range\ndependencies is a key challenge in many sequence transduction tasks. One key factor affecting the\nability to learn such dependencies is the length of the paths forward and backward signals have to\ntraverse in the network. The shorter these paths between any combination of positions in the input\nand output sequences, the easier it is to learn long-range dependencies [12]. Hence we also compare\nthe maximum path length between any two input and output positions in networks composed of the\ndifferent layer types.\nAs noted in Table 1, a self-attention layer connects all positions with a constant number of sequentially\nexecuted operations, whereas a recurrent layer requires O(n) sequential operations. In terms of\ncomputational complexity, self-attention layers are faster than recurrent layers when the sequence\n6\n\n\n## PDF page 7\n\nlength n is smaller than the representation dimensionality d, which is most often the case with\nsentence representations used by state-of-the-art models in machine translations, such as word-piece\n[38] and byte-pair [31] representations. To improve computational performance for tasks involving\nvery long sequences, self-attention could be restricted to considering only a neighborhood of size r in\nthe input sequence centered around the respective output position. This would increase the maximum\npath length to O(n/r). We plan to investigate this approach further in future work.\nA single convolutional layer with kernel width k < n does not connect all pairs of input and output\npositions. Doing so requires a stack of O(n/k) convolutional layers in the case of contiguous kernels,\nor O(logk(n)) in the case of dilated convolutions [18], increasing the length of the longest paths\nbetween any two positions in the network. Convolutional layers are generally more expensive than\nrecurrent layers, by a factor of k. Separable convolutions [6], however, decrease the complexity\nconsiderably, to O(k · n · d + n · d2). Even with k = n, however, the complexity of a separable\nconvolution is equal to the combination of a self-attention layer and a point-wise feed-forward layer,\nthe approach we take in our model.\nAs side benefit, self-attention could yield more interpretable models. We inspect attention distributions\nfrom our models and present and discuss examples in the appendix. Not only do individual attention\nheads clearly learn to perform different tasks, many appear to exhibit behavior related to the syntactic\nand semantic structure of the sentences.\n5\nTraining\nThis section describes the training regime for our models.\n5.1\nTraining Data and Batching\nWe trained on the standard WMT 2014 English-German dataset consisting of about 4.5 million\nsentence pairs. Sentences were encoded using byte-pair encoding [3], which has a shared source-\ntarget vocabulary of about 37000 tokens. For English-French, we used the significantly larger WMT\n2014 English-French dataset consisting of 36M sentences and split tokens into a 32000 word-piece\nvocabulary [38]. Sentence pairs were batched together by approximate sequence length. Each training\nbatch contained a set of sentence pairs containing approximately 25000 source tokens and 25000\ntarget tokens.\n5.2\nHardware and Schedule\nWe trained our models on one machine with 8 NVIDIA P100 GPUs. For our base models using\nthe hyperparameters described throughout the paper, each training step took about 0.4 seconds. We\ntrained the base models for a total of 100,000 steps or 12 hours. For our big models,(described on the\nbottom line of table 3), step time was 1.0 seconds. The big models were trained for 300,000 steps\n(3.5 days).\n5.3\nOptimizer\nWe used the Adam optimizer [20] with β1 = 0.9, β2 = 0.98 and ϵ = 10−9. We varied the learning\nrate over the course of training, according to the formula:\nlrate = d−0.5\nmodel · min(step_num−0.5, step_num · warmup_steps−1.5)\n(3)\nThis corresponds to increasing the learning rate linearly for the first warmup_steps training steps,\nand decreasing it thereafter proportionally to the inverse square root of the step number. We used\nwarmup_steps = 4000.\n5.4\nRegularization\nWe employ three types of regularization during training:\n7\n\n\n## PDF page 8\n\nTable 2: The Transformer achieves better BLEU scores than previous state-of-the-art models on the\nEnglish-to-German and English-to-French newstest2014 tests at a fraction of the training cost.\nModel\nBLEU\nTraining Cost (FLOPs)\nEN-DE\nEN-FR\nEN-DE\nEN-FR\nByteNet [18]\n23.75\nDeep-Att + PosUnk [39]\n39.2\n1.0 · 1020\nGNMT + RL [38]\n24.6\n39.92\n2.3 · 1019\n1.4 · 1020\nConvS2S [9]\n25.16\n40.46\n9.6 · 1018\n1.5 · 1020\nMoE [32]\n26.03\n40.56\n2.0 · 1019\n1.2 · 1020\nDeep-Att + PosUnk Ensemble [39]\n40.4\n8.0 · 1020\nGNMT + RL Ensemble [38]\n26.30\n41.16\n1.8 · 1020\n1.1 · 1021\nConvS2S Ensemble [9]\n26.36\n41.29\n7.7 · 1019\n1.2 · 1021\nTransformer (base model)\n27.3\n38.1\n3.3 · 1018\nTransformer (big)\n28.4\n41.8\n2.3 · 1019\nResidual Dropout\nWe apply dropout [33] to the output of each sub-layer, before it is added to the\nsub-layer input and normalized. In addition, we apply dropout to the sums of the embeddings and the\npositional encodings in both the encoder and decoder stacks. For the base model, we use a rate of\nPdrop = 0.1.\nLabel Smoothing\nDuring training, we employed label smoothing of value ϵls = 0.1 [36]. This\nhurts perplexity, as the model learns to be more unsure, but improves accuracy and BLEU score.\n6\nResults\n6.1\nMachine Translation\nOn the WMT 2014 English-to-German translation task, the big transformer model (Transformer (big)\nin Table 2) outperforms the best previously reported models (including ensembles) by more than 2.0\nBLEU, establishing a new state-of-the-art BLEU score of 28.4. The configuration of this model is\nlisted in the bottom line of Table 3. Training took 3.5 days on 8 P100 GPUs. Even our base model\nsurpasses all previously published models and ensembles, at a fraction of the training cost of any of\nthe competitive models.\nOn the WMT 2014 English-to-French translation task, our big model achieves a BLEU score of 41.0,\noutperforming all of the previously published single models, at less than 1/4 the training cost of the\nprevious state-of-the-art model. The Transformer (big) model trained for English-to-French used\ndropout rate Pdrop = 0.1, instead of 0.3.\nFor the base models, we used a single model obtained by averaging the last 5 checkpoints, which\nwere written at 10-minute intervals. For the big models, we averaged the last 20 checkpoints. We\nused beam search with a beam size of 4 and length penalty α = 0.6 [38]. These hyperparameters\nwere chosen after experimentation on the development set. We set the maximum output length during\ninference to input length + 50, but terminate early when possible [38].\nTable 2 summarizes our results and compares our translation quality and training costs to other model\narchitectures from the literature. We estimate the number of floating point operations used to train a\nmodel by multiplying the training time, the number of GPUs used, and an estimate of the sustained\nsingle-precision floating-point capacity of each GPU 5.\n6.2\nModel Variations\nTo evaluate the importance of different components of the Transformer, we varied our base model\nin different ways, measuring the change in performance on English-to-German translation on the\n5We used values of 2.8, 3.7, 6.0 and 9.5 TFLOPS for K80, K40, M40 and P100, respectively.\n8\n\n\n## PDF page 9\n\nTable 3: Variations on the Transformer architecture. Unlisted values are identical to those of the base\nmodel. All metrics are on the English-to-German translation development set, newstest2013. Listed\nperplexities are per-wordpiece, according to our byte-pair encoding, and should not be compared to\nper-word perplexities.\nN\ndmodel\ndff\nh\ndk\ndv\nPdrop\nϵls\ntrain\nPPL\nBLEU\nparams\nsteps\n(dev)\n(dev)\n×106\nbase\n6\n512\n2048\n8\n64\n64\n0.1\n0.1\n100K\n4.92\n25.8\n65\n(A)\n1\n512\n512\n5.29\n24.9\n4\n128\n128\n5.00\n25.5\n16\n32\n32\n4.91\n25.8\n32\n16\n16\n5.01\n25.4\n(B)\n16\n5.16\n25.1\n58\n32\n5.01\n25.4\n60\n(C)\n2\n6.11\n23.7\n36\n4\n5.19\n25.3\n50\n8\n4.88\n25.5\n80\n256\n32\n32\n5.75\n24.5\n28\n1024\n128\n128\n4.66\n26.0\n168\n1024\n5.12\n25.4\n53\n4096\n4.75\n26.2\n90\n(D)\n0.0\n5.77\n24.6\n0.2\n4.95\n25.5\n0.0\n4.67\n25.3\n0.2\n5.47\n25.7\n(E)\npositional embedding instead of sinusoids\n4.92\n25.7\nbig\n6\n1024\n4096\n16\n0.3\n300K\n4.33\n26.4\n213\ndevelopment set, newstest2013. We used beam search as described in the previous section, but no\ncheckpoint averaging. We present these results in Table 3.\nIn Table 3 rows (A), we vary the number of attention heads and the attention key and value dimensions,\nkeeping the amount of computation constant, as described in Section 3.2.2. While single-head\nattention is 0.9 BLEU worse than the best setting, quality also drops off with too many heads.\nIn Table 3 rows (B), we observe that reducing the attention key size dk hurts model quality. This\nsuggests that determining compatibility is not easy and that a more sophisticated compatibility\nfunction than dot product may be beneficial. We further observe in rows (C) and (D) that, as expected,\nbigger models are better, and dropout is very helpful in avoiding over-fitting. In row (E) we replace our\nsinusoidal positional encoding with learned positional embeddings [9], and observe nearly identical\nresults to the base model.\n6.3\nEnglish Constituency Parsing\nTo evaluate if the Transformer can generalize to other tasks we performed experiments on English\nconstituency parsing. This task presents specific challenges: the output is subject to strong structural\nconstraints and is significantly longer than the input. Furthermore, RNN sequence-to-sequence\nmodels have not been able to attain state-of-the-art results in small-data regimes [37].\nWe trained a 4-layer transformer with dmodel = 1024 on the Wall Street Journal (WSJ) portion of the\nPenn Treebank [25], about 40K training sentences. We also trained it in a semi-supervised setting,\nusing the larger high-confidence and BerkleyParser corpora from with approximately 17M sentences\n[37]. We used a vocabulary of 16K tokens for the WSJ only setting and a vocabulary of 32K tokens\nfor the semi-supervised setting.\nWe performed only a small number of experiments to select the dropout, both attention and residual\n(section 5.4), learning rates and beam size on the Section 22 development set, all other parameters\nremained unchanged from the English-to-German base translation model. During inference, we\n9\n\n\n## PDF page 10\n\nTable 4: The Transformer generalizes well to English constituency parsing (Results are on Section 23\nof WSJ)\nParser\nTraining\nWSJ 23 F1\nVinyals & Kaiser el al. (2014) [37]\nWSJ only, discriminative\n88.3\nPetrov et al. (2006) [29]\nWSJ only, discriminative\n90.4\nZhu et al. (2013) [40]\nWSJ only, discriminative\n90.4\nDyer et al. (2016) [8]\nWSJ only, discriminative\n91.7\nTransformer (4 layers)\nWSJ only, discriminative\n91.3\nZhu et al. (2013) [40]\nsemi-supervised\n91.3\nHuang & Harper (2009) [14]\nsemi-supervised\n91.3\nMcClosky et al. (2006) [26]\nsemi-supervised\n92.1\nVinyals & Kaiser el al. (2014) [37]\nsemi-supervised\n92.1\nTransformer (4 layers)\nsemi-supervised\n92.7\nLuong et al. (2015) [23]\nmulti-task\n93.0\nDyer et al. (2016) [8]\ngenerative\n93.3\nincreased the maximum output length to input length + 300. We used a beam size of 21 and α = 0.3\nfor both WSJ only and the semi-supervised setting.\nOur results in Table 4 show that despite the lack of task-specific tuning our model performs sur-\nprisingly well, yielding better results than all previously reported models with the exception of the\nRecurrent Neural Network Grammar [8].\nIn contrast to RNN sequence-to-sequence models [37], the Transformer outperforms the Berkeley-\nParser [29] even when training only on the WSJ training set of 40K sentences.\n7\nConclusion\nIn this work, we presented the Transformer, the first sequence transduction model based entirely on\nattention, replacing the recurrent layers most commonly used in encoder-decoder architectures with\nmulti-headed self-attention.\nFor translation tasks, the Transformer can be trained significantly faster than architectures based\non recurrent or convolutional layers. On both WMT 2014 English-to-German and WMT 2014\nEnglish-to-French translation tasks, we achieve a new state of the art. In the former task our best\nmodel outperforms even all previously reported ensembles.\nWe are excited about the future of attention-based models and plan to apply them to other tasks. We\nplan to extend the Transformer to problems involving input and output modalities other than text and\nto investigate local, restricted attention mechanisms to efficiently handle large inputs and outputs\nsuch as images, audio and video. Making generation less sequential is another research goals of ours.\nThe code we used to train and evaluate our models is available at https://github.com/\ntensorflow/tensor2tensor.\nAcknowledgements\nWe are grateful to Nal Kalchbrenner and Stephan Gouws for their fruitful\ncomments, corrections and inspiration.\nReferences\n[1] Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint\narXiv:1607.06450, 2016.\n[2] Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine translation by jointly\nlearning to align and translate. CoRR, abs/1409.0473, 2014.\n[3] Denny Britz, Anna Goldie, Minh-Thang Luong, and Quoc V. Le. Massive exploration of neural\nmachine translation architectures. CoRR, abs/1703.03906, 2017.\n[4] Jianpeng Cheng, Li Dong, and Mirella Lapata. Long short-term memory-networks for machine\nreading. arXiv preprint arXiv:1601.06733, 2016.\n10\n\n\n## PDF page 11\n\n[5] Kyunghyun Cho, Bart van Merrienboer, Caglar Gulcehre, Fethi Bougares, Holger Schwenk,\nand Yoshua Bengio. Learning phrase representations using rnn encoder-decoder for statistical\nmachine translation. CoRR, abs/1406.1078, 2014.\n[6] Francois Chollet. Xception: Deep learning with depthwise separable convolutions. arXiv\npreprint arXiv:1610.02357, 2016.\n[7] Junyoung Chung, Çaglar Gülçehre, Kyunghyun Cho, and Yoshua Bengio. Empirical evaluation\nof gated recurrent neural networks on sequence modeling. CoRR, abs/1412.3555, 2014.\n[8] Chris Dyer, Adhiguna Kuncoro, Miguel Ballesteros, and Noah A. Smith. Recurrent neural\nnetwork grammars. In Proc. of NAACL, 2016.\n[9] Jonas Gehring, Michael Auli, David Grangier, Denis Yarats, and Yann N. Dauphin. Convolu-\ntional sequence to sequence learning. arXiv preprint arXiv:1705.03122v2, 2017.\n[10] Alex Graves.\nGenerating sequences with recurrent neural networks.\narXiv preprint\narXiv:1308.0850, 2013.\n[11] Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for im-\nage recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern\nRecognition, pages 770–778, 2016.\n[12] Sepp Hochreiter, Yoshua Bengio, Paolo Frasconi, and Jürgen Schmidhuber. Gradient flow in\nrecurrent nets: the difficulty of learning long-term dependencies, 2001.\n[13] Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory. Neural computation,\n9(8):1735–1780, 1997.\n[14] Zhongqiang Huang and Mary Harper. Self-training PCFG grammars with latent annotations\nacross languages. In Proceedings of the 2009 Conference on Empirical Methods in Natural\nLanguage Processing, pages 832–841. ACL, August 2009.\n[15] Rafal Jozefowicz, Oriol Vinyals, Mike Schuster, Noam Shazeer, and Yonghui Wu. Exploring\nthe limits of language modeling. arXiv preprint arXiv:1602.02410, 2016.\n[16] Łukasz Kaiser and Samy Bengio. Can active memory replace attention? In Advances in Neural\nInformation Processing Systems, (NIPS), 2016.\n[17] Łukasz Kaiser and Ilya Sutskever. Neural GPUs learn algorithms. In International Conference\non Learning Representations (ICLR), 2016.\n[18] Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Ko-\nray Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099v2,\n2017.\n[19] Yoon Kim, Carl Denton, Luong Hoang, and Alexander M. Rush. Structured attention networks.\nIn International Conference on Learning Representations, 2017.\n[20] Diederik Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015.\n[21] Oleksii Kuchaiev and Boris Ginsburg. Factorization tricks for LSTM networks. arXiv preprint\narXiv:1703.10722, 2017.\n[22] Zhouhan Lin, Minwei Feng, Cicero Nogueira dos Santos, Mo Yu, Bing Xiang, Bowen\nZhou, and Yoshua Bengio. A structured self-attentive sentence embedding. arXiv preprint\narXiv:1703.03130, 2017.\n[23] Minh-Thang Luong, Quoc V. Le, Ilya Sutskever, Oriol Vinyals, and Lukasz Kaiser. Multi-task\nsequence to sequence learning. arXiv preprint arXiv:1511.06114, 2015.\n[24] Minh-Thang Luong, Hieu Pham, and Christopher D Manning. Effective approaches to attention-\nbased neural machine translation. arXiv preprint arXiv:1508.04025, 2015.\n11\n\n\n## PDF page 12\n\n[25] Mitchell P Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. Building a large annotated\ncorpus of english: The penn treebank. Computational linguistics, 19(2):313–330, 1993.\n[26] David McClosky, Eugene Charniak, and Mark Johnson. Effective self-training for parsing. In\nProceedings of the Human Language Technology Conference of the NAACL, Main Conference,\npages 152–159. ACL, June 2006.\n[27] Ankur Parikh, Oscar Täckström, Dipanjan Das, and Jakob Uszkoreit. A decomposable attention\nmodel. In Empirical Methods in Natural Language Processing, 2016.\n[28] Romain Paulus, Caiming Xiong, and Richard Socher. A deep reinforced model for abstractive\nsummarization. arXiv preprint arXiv:1705.04304, 2017.\n[29] Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. Learning accurate, compact,\nand interpretable tree annotation. In Proceedings of the 21st International Conference on\nComputational Linguistics and 44th Annual Meeting of the ACL, pages 433–440. ACL, July\n2006.\n[30] Ofir Press and Lior Wolf. Using the output embedding to improve language models. arXiv\npreprint arXiv:1608.05859, 2016.\n[31] Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words\nwith subword units. arXiv preprint arXiv:1508.07909, 2015.\n[32] Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Le, Geoffrey Hinton,\nand Jeff Dean. Outrageously large neural networks: The sparsely-gated mixture-of-experts\nlayer. arXiv preprint arXiv:1701.06538, 2017.\n[33] Nitish Srivastava, Geoffrey E Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdi-\nnov. Dropout: a simple way to prevent neural networks from overfitting. Journal of Machine\nLearning Research, 15(1):1929–1958, 2014.\n[34] Sainbayar Sukhbaatar, Arthur Szlam, Jason Weston, and Rob Fergus. End-to-end memory\nnetworks. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors,\nAdvances in Neural Information Processing Systems 28, pages 2440–2448. Curran Associates,\nInc., 2015.\n[35] Ilya Sutskever, Oriol Vinyals, and Quoc VV Le. Sequence to sequence learning with neural\nnetworks. In Advances in Neural Information Processing Systems, pages 3104–3112, 2014.\n[36] Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jonathon Shlens, and Zbigniew Wojna.\nRethinking the inception architecture for computer vision. CoRR, abs/1512.00567, 2015.\n[37] Vinyals & Kaiser, Koo, Petrov, Sutskever, and Hinton. Grammar as a foreign language. In\nAdvances in Neural Information Processing Systems, 2015.\n[38] Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang\nMacherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, et al. Google’s neural machine\ntranslation system: Bridging the gap between human and machine translation. arXiv preprint\narXiv:1609.08144, 2016.\n[39] Jie Zhou, Ying Cao, Xuguang Wang, Peng Li, and Wei Xu. Deep recurrent models with\nfast-forward connections for neural machine translation. CoRR, abs/1606.04199, 2016.\n[40] Muhua Zhu, Yue Zhang, Wenliang Chen, Min Zhang, and Jingbo Zhu. Fast and accurate\nshift-reduce constituent parsing. In Proceedings of the 51st Annual Meeting of the ACL (Volume\n1: Long Papers), pages 434–443. ACL, August 2013.\n12\n\n\n## PDF page 13\n\nAttention Visualizations\nIt\nis\nin\nthis\nspirit\nthat\na\nmajority\nof\nAmerican\ngovernments\nhave\npassed\nnew\nlaws\nsince\n2009\nmaking\nthe\nregistration\nor\nvoting\nprocess\nmore\ndifficult\n.\n<EOS>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\nIt\nis\nin\nthis\nspirit\nthat\na\nmajority\nof\nAmerican\ngovernments\nhave\npassed\nnew\nlaws\nsince\n2009\nmaking\nthe\nregistration\nor\nvoting\nprocess\nmore\ndifficult\n.\n<EOS>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\n<pad>\nFigure 3: An example of the attention mechanism following long-distance dependencies in the\nencoder self-attention in layer 5 of 6. Many of the attention heads attend to a distant dependency of\nthe verb ‘making’, completing the phrase ‘making...more difficult’. Attentions here shown only for\nthe word ‘making’. Different colors represent different heads. Best viewed in color.\n13\n\n\n## PDF page 14\n\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nFigure 4: Two attention heads, also in layer 5 of 6, apparently involved in anaphora resolution. Top:\nFull attentions for head 5. Bottom: Isolated attentions from just the word ‘its’ for attention heads 5\nand 6. Note that the attentions are very sharp for this word.\n14\n\n\n## PDF page 15\n\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nThe\nLaw\nwill\nnever\nbe\nperfect\n,\nbut\nits\napplication\nshould\nbe\njust\n-\nthis\nis\nwhat\nwe\nare\nmissing\n,\nin\nmy\nopinion\n.\n<EOS>\n<pad>\nFigure 5: Many of the attention heads exhibit behaviour that seems related to the structure of the\nsentence. We give two such examples above, from two different heads from the encoder self-attention\nat layer 5 of 6. The heads clearly learned to perform different tasks.\n15\n\n\n可直接引用的图表文件（放在 Slidev public 目录，用 /文件名 引用）：\n- paper_figure_1_transformer.png：Figure 1 from PDF page 3: The Transformer model architecture.\n- paper_figure_3_long_distance.png：Figure 3 from PDF page 13: Encoder self-attention following long-distance dependencies.\n- paper_figure_4_anaphora.png：Figure 4 from PDF page 14: Attention heads involved in anaphora resolution.\n\n请生成一版 10-20 页的完整初稿。内容必须忠于论文，至少引用上面列出的三张原论文图，并覆盖问题、Transformer 架构、注意力机制、训练、主要实验、局限和结论。不要复制长段原文；每页保持听众可读的信息密度。生成完整的 slides.md。"
|
||
},
|
||
{
|
||
"role": "assistant",
|
||
"content": "```markdown\n---\ntheme: default\n---\n\n# Attention Is All You Need\n## A Revolutionary Architecture for Sequence Transduction\n\nAshish Vaswani et al. \nNIPS 2017\n\n---\n\n## Abstract\n\n- Proposes **Transformer** - first model based solely on attention mechanisms\n- Dispenses with recurrence and convolutions entirely\n- Superior quality while being more parallelizable and requiring less training time\n- Achieves 28.4 BLEU on WMT 2014 English-to-German (↑2 BLEU over previous best)\n- Achieves 41.8 BLEU on WMT 2014 English-to-French (new state-of-the-art)\n- Generalizes well to other tasks like English constituency parsing\n\n---\n\n## Background: The Problem with Existing Approaches\n\n### Recurrent Neural Networks (RNNs/LSTMs/GRUs)\n- Inherently sequential computation\n- Cannot parallelize within training examples\n- Difficult to learn long-range dependencies\n\n### Convolutional Approaches\n- ByteNet, ConvS2S use CNNs for parallelization\n- Number of operations grows with distance between positions\n- Linear (ConvS2S) or logarithmic (ByteNet) path lengths\n\n---\n\n## Key Insight: Attention is Sufficient\n\nAttention mechanisms allow modeling dependencies without regard to distance, but were previously used with RNNs.\n\n**Transformer**: First transduction model relying entirely on self-attention to compute representations without:\n- Sequence-aligned RNNs\n- Convolutions\n\n---\n\n## Transformer Architecture Overview\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-80 mx-auto\" />\n\n*Encoder-decoder structure with stacked self-attention and feed-forward layers*\n\n---\n\n## Encoder Structure\n\n- Stack of **6 identical layers**\n- Each layer has two sub-layers:\n 1. **Multi-head self-attention** mechanism\n 2. **Position-wise fully connected feed-forward network**\n- Residual connections around each sub-layer\n- Layer normalization after each sub-layer\n- All sub-layers produce outputs of dimension `d_model = 512`\n\n---\n\n## Decoder Structure\n\n- Stack of **6 identical layers**\n- Three sub-layers per layer:\n 1. Masked multi-head self-attention (prevents leftward information flow)\n 2. Multi-head attention over encoder output\n 3. Position-wise fully connected feed-forward network\n- Residual connections and layer normalization\n- Output embeddings offset by one position (auto-regressive property)\n\n---\n\n## Attention Mechanism\n\n### Scaled Dot-Product Attention\n$$\\text{Attention}(Q, K, V) = \\text{softmax}\\left(\\frac{QK^T}{\\sqrt{d_k}}\\right)V$$\n\n- $Q$ (queries), $K$ (keys), $V$ (values) are matrices\n- Scaling by $\\frac{1}{\\sqrt{d_k}}$ prevents gradients from becoming too small\n- Faster and more space-efficient than additive attention\n\n---\n\n## Multi-Head Attention\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-40 mx-auto\" />\n\n- Projects queries, keys, values $h$ times with different learned projections\n- Performs attention in parallel on projected versions\n- Concatenates results and projects again\n\n$$\\text{MultiHead}(Q, K, V) = \\text{Concat}(\\text{head}_1, ..., \\text{head}_h)W^O$$\nwhere $\\text{head}_i = \\text{Attention}(QW_i^Q, KW_i^K, VW_i^V)$\n\n---\n\n## Three Applications of Attention\n\n1. **Encoder-decoder attention**: Queries from decoder, keys/values from encoder\n2. **Encoder self-attention**: All keys, values, queries from previous encoder layer\n3. **Decoder self-attention**: All positions in decoder up to current position (masked)\n\n---\n\n## Positional Encoding\n\nSince model has no recurrence/convolution, we inject positional information:\n\n$$\\text{PE}_{(pos, 2i)} = \\sin\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n$$\\text{PE}_{(pos, 2i+1)} = \\cos\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n\n- Same dimension as embeddings ($d_{\\text{model}}$)\n- Allows model to learn relative position information\n- Performed nearly as well as learned positional embeddings\n\n---\n\n## Why Self-Attention?\n\n| Layer Type | Complexity | Sequential Operations | Max Path Length |\n|------------|------------|-----------------------|-----------------|\n| Self-Attention | $O(n^2 \\cdot d)$ | $O(1)$ | $O(1)$ |\n| Recurrent | $O(n \\cdot d^2)$ | $O(n)$ | $O(n)$ |\n| Convolutional | $O(k \\cdot n \\cdot d^2)$ | $O(1)$ | $O(\\log_k n)$ |\n\n- Constant path length between any positions\n- More parallelizable than RNNs\n- Better computational efficiency for typical sentence lengths\n\n---\n\n## Training Details\n\n### Data & Batching\n- WMT 2014 English-German (4.5M sentence pairs)\n- WMT 2014 English-French (36M sentence pairs)\n- Byte-pair encoding (37K shared vocab for EN-DE)\n- Batches with ~25000 source and target tokens\n\n### Hardware & Schedule\n- 8 NVIDIA P100 GPUs\n- Base model: 100,000 steps (12 hours)\n- Big model: 300,000 steps (3.5 days)\n\n---\n\n## Training Details (Cont.)\n\n### Optimizer\n- Adam with $\\beta_1 = 0.9$, $\\beta_2 = 0.98$, $\\epsilon = 10^{-9}$\n- Learning rate schedule:\n $$\\text{lrate} = d_{\\text{model}}^{-0.5} \\cdot \\min(\\text{step\\_num}^{-0.5}, \\text{step\\_num} \\cdot \\text{warmup\\_steps}^{-1.5})$$\n- Warmup steps = 4000\n\n### Regularization\n- Residual dropout (P_drop = 0.1)\n- Label smoothing ($\\epsilon_{ls} = 0.1$)\n\n---\n\n## Machine Translation Results\n\n| Model | EN-DE BLEU | EN-FR BLEU | Training Cost (FLOPs) |\n|-------|------------|------------|-----------------------|\n| GNMT + RL Ensemble | 26.30 | 41.16 | $1.8 \\cdot 10^{20}$ |\n| ConvS2S Ensemble | 26.36 | 41.29 | $7.7 \\cdot 10^{19}$ |\n| **Transformer (big)** | **28.4** | **41.8** | **$2.3 \\cdot 10^{19}$** |\n\n- Transformer outperforms all previous state-of-the-art models\n- Achieves better results with significantly lower training cost\n- 28.4 BLEU on EN-DE (↑2 BLEU over previous best)\n- 41.8 BLEU on EN-FR (new state-of-the-art)\n\n---\n\n## Model Variations Analysis\n\n| Variation | Dev PPL | Dev BLEU |\n|-----------|---------|----------|\n| Base model | 4.92 | 25.8 |\n| Single attention head | 5.29 | 24.9 |\n| No dropout | 5.77 | 24.6 |\n| Learned positional embeddings | 4.92 | 25.7 |\n| Big model | 4.33 | 26.4 |\n\n- Multiple attention heads improve performance\n- Dropout is crucial for avoiding overfitting\n- Sinusoidal and learned positional encodings perform similarly\n- Larger models (more dimensions, more heads) improve performance\n\n---\n\n## Generalization to Other Tasks: English Constituency Parsing\n\n| Parser | Training | WSJ 23 F1 |\n|--------|----------|-----------|\n| Petrov et al. (2006) | WSJ only | 90.4 |\n| Dyer et al. (2016) | WSJ only | 91.7 |\n| **Transformer (4 layers)** | **WSJ only** | **91.3** |\n| Vinyals & Kaiser et al. | Semi-supervised | 92.1 |\n| **Transformer (4 layers)** | **Semi-supervised** | **92.7** |\n\n- Transformer performs well despite no task-specific tuning\n- Outperforms previous models in semi-supervised setting\n- Shows generalization ability beyond machine translation\n\n---\n\n## Attention Visualization: Long-Distance Dependencies\n\n<img src=\"/paper_figure_3_long_distance.png\" class=\"h-70 mx-auto\" />\n\n*Encoder self-attention in layer 5 showing attention to distant dependency of the verb \"making\"*\n\n---\n\n## Attention Visualization: Anaphora Resolution\n\n<img src=\"/paper_figure_4_anaphora.png\" class=\"h-70 mx-auto\" />\n\n*Attention heads involved in resolving \"its\" reference to \"The Law\"*\n\n---\n\n## Limitations\n\n- Computational complexity grows quadratically with sequence length\n- Less effective for very long sequences (e.g., books, articles)\n- Still requires sequential generation in decoder\n- Limited ability to model hierarchical structure compared to some syntactic models\n\n---\n\n## Conclusion and Future Work\n\n### Key Contributions\n- Introduced Transformer architecture based solely on attention\n- Achieved new state-of-the-art results in machine translation\n- Demonstrated improved parallelization and reduced training time\n- Showed generalization to other tasks like constituency parsing\n\n### Future Directions\n- Apply to other modalities (images, audio, video)\n- Investigate local, restricted attention for large inputs\n- Make generation less sequential\n- Explore interpretability of attention mechanisms\n\n---\n\n## Thank You\n\nCode available at: https://github.com/tensorflow/tensor2tensor\n\narXiv:1706.03762v7 [cs.CL]\n```"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": "审核者（Reviewer）渲染了你上一版 slides.md 的每一页截图，给出如下结构化改进建议（JSON）：\n\n{\n \"overall_score\": 65,\n \"pass\": false,\n \"issues\": [\n {\n \"page\": 2,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将6个要点拆分为2页，每页不超过3-4个要点，或精简合并相似内容\"\n },\n {\n \"page\": 3,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将RNN和卷积方法分两页展示，或每个部分保留2个核心要点\"\n },\n {\n \"page\": 5,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"放大架构图至至少占页面60%空间，确保图中文字和模块清晰可见\"\n },\n {\n \"page\": 5,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，或单独用一页解释架构细节\"\n },\n {\n \"page\": 7,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将3个子要点拆分为独立要点，或移至下一页单独讲解decoder子层结构\"\n },\n {\n \"page\": 9,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"放大多头注意力机制图，确保每个头的结构和连接关系清晰可辨\"\n },\n {\n \"page\": 9,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，公式保持现有大小即可\"\n },\n {\n \"page\": 13,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将Data & Batching和Hardware & Schedule分两页展示，或各保留2个最关键要点\"\n },\n {\n \"page\": 15,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"表格保留核心对比数据，4个要点精简为2-3个核心结论\"\n },\n {\n \"page\": 18,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"单独一页放大展示注意力可视化图，确保能看清词语间的注意力连接关系\"\n },\n {\n \"page\": 18,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，用简洁标题概括可视化内容\"\n },\n {\n \"page\": 19,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"单独一页放大展示指代消解可视化图，确保紫色连接线和词语清晰可见\"\n },\n {\n \"page\": 19,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"删除图片下方的小字体说明文字，直接在标题中说明可视化内容\"\n },\n {\n \"page\": 21,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将Key Contributions和Future Directions分两页展示，每部分保留3-4个要点\"\n }\n ]\n}\n\n请理解这些问题并修订 slides.md（可拆页、精简文字、调整图片尺寸等），重新输出完整的 slides.md。"
|
||
},
|
||
{
|
||
"role": "assistant",
|
||
"content": "```markdown\n---\ntheme: default\n---\n\n# Attention Is All You Need\n## A Revolutionary Architecture for Sequence Transduction\n\nAshish Vaswani et al. \nNIPS 2017\n\n---\n\n## Abstract: Key Innovation\n\n- Proposes **Transformer** - first model based solely on attention mechanisms\n- Dispenses with recurrence and convolutions entirely\n- More parallelizable and requires significantly less training time\n\n---\n\n## Abstract: Performance Highlights\n\n- Achieves 28.4 BLEU on WMT 2014 English-to-German\n - Improves over existing best results by over 2 BLEU\n- Establishes new state-of-the-art 41.8 BLEU on WMT 2014 English-to-French\n- Generalizes well to other tasks like English constituency parsing\n\n---\n\n## Background: Limitations of RNNs\n\n### Recurrent Neural Networks (RNNs/LSTMs/GRUs)\n- Inherently sequential computation\n- Cannot parallelize within training examples\n- Difficult to learn long-range dependencies\n- Memory constraints limit batching for long sequences\n\n---\n\n## Background: Limitations of Convolutional Approaches\n\n### CNN-based Models (ByteNet, ConvS2S)\n- Use convolutions for parallelization\n- Number of operations grows with distance between positions\n - Linear growth for ConvS2S\n - Logarithmic growth for ByteNet\n- Longer path lengths between distant positions\n\n---\n\n## Key Insight: Attention is Sufficient\n\nAttention mechanisms allow modeling dependencies without regard to distance, but were previously used with RNNs.\n\n**Transformer**: First transduction model relying entirely on self-attention to compute representations without:\n- Sequence-aligned RNNs\n- Convolutions\n\n---\n\n## Transformer Architecture Overview\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-96 mx-auto\" />\n\n---\n\n## Encoder Structure\n\n- Stack of **6 identical layers**\n- Each layer contains two sub-layers:\n 1. Multi-head self-attention mechanism\n 2. Position-wise fully connected feed-forward network\n- Residual connections around each sub-layer\n- Layer normalization after each sub-layer\n\n---\n\n## Decoder Structure\n\n- Stack of **6 identical layers**\n- Three sub-layers per layer:\n 1. Masked multi-head self-attention\n 2. Multi-head attention over encoder output\n 3. Position-wise fully connected feed-forward network\n- Residual connections and layer normalization\n\n---\n\n## Decoder: Masking Mechanism\n\n- Prevents positions from attending to subsequent positions\n- Ensures predictions for position i depend only on:\n - Known outputs at positions < i\n - Output embeddings offset by one position\n- Preserves auto-regressive property\n\n---\n\n## Attention Mechanism\n\n### Scaled Dot-Product Attention\n$$\\text{Attention}(Q, K, V) = \\text{softmax}\\left(\\frac{QK^T}{\\sqrt{d_k}}\\right)V$$\n\n- $Q$ (queries), $K$ (keys), $V$ (values) are matrices\n- Scaling by $\\frac{1}{\\sqrt{d_k}}$ prevents gradients from becoming too small\n- Faster and more space-efficient than additive attention\n\n---\n\n## Multi-Head Attention\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-80 mx-auto\" />\n\n- Projects queries, keys, values $h$ times with different learned projections\n- Performs attention in parallel on projected versions\n- Concatenates results and projects again\n\n---\n\n## Three Applications of Attention\n\n1. **Encoder-decoder attention**: \n - Queries from decoder\n - Keys/values from encoder output\n\n2. **Encoder self-attention**:\n - All keys, values, queries from previous encoder layer\n - Each position attends to all positions\n\n3. **Decoder self-attention**:\n - All positions in decoder up to current position\n - Masked to prevent future information flow\n\n---\n\n## Positional Encoding\n\nSince model has no recurrence/convolution, we inject positional information:\n\n$$\\text{PE}_{(pos, 2i)} = \\sin\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n$$\\text{PE}_{(pos, 2i+1)} = \\cos\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n\n- Same dimension as embeddings ($d_{\\text{model}}$)\n- Allows model to learn relative position information\n- Performed nearly as well as learned positional embeddings\n\n---\n\n## Why Self-Attention?\n\n| Layer Type | Complexity | Sequential Operations | Max Path Length |\n|------------|------------|-----------------------|-----------------|\n| Self-Attention | $O(n^2 \\cdot d)$ | $O(1)$ | $O(1)$ |\n| Recurrent | $O(n \\cdot d^2)$ | $O(n)$ | $O(n)$ |\n| Convolutional | $O(k \\cdot n \\cdot d^2)$ | $O(1)$ | $O(\\log_k n)$ |\n\n---\n\n## Training: Data & Batching\n\n- WMT 2014 English-German (4.5M sentence pairs)\n- WMT 2014 English-French (36M sentence pairs)\n- Byte-pair encoding (37K shared vocab for EN-DE)\n- Batches with ~25000 source and target tokens\n\n---\n\n## Training: Hardware & Schedule\n\n- 8 NVIDIA P100 GPUs\n- Base model: 100,000 steps (12 hours)\n- Big model: 300,000 steps (3.5 days)\n- Adam optimizer with scheduled learning rate\n\n---\n\n## Machine Translation Results\n\n| Model | EN-DE BLEU | EN-FR BLEU | Training Cost (FLOPs) |\n|-------|------------|------------|-----------------------|\n| GNMT + RL Ensemble | 26.30 | 41.16 | $1.8 \\cdot 10^{20}$ |\n| ConvS2S Ensemble | 26.36 | 41.29 | $7.7 \\cdot 10^{19}$ |\n| **Transformer (big)** | **28.4** | **41.8** | **$2.3 \\cdot 10^{19}$** |\n\n---\n\n## Model Variations Analysis\n\n| Variation | Dev PPL | Dev BLEU |\n|-----------|---------|----------|\n| Base model | 4.92 | 25.8 |\n| Single attention head | 5.29 | 24.9 |\n| No dropout | 5.77 | 24.6 |\n| Learned positional embeddings | 4.92 | 25.7 |\n\n---\n\n## Generalization to Constituency Parsing\n\n| Parser | Training | WSJ 23 F1 |\n|--------|----------|-----------|\n| Previous state-of-the-art | WSJ only | 91.7 |\n| **Transformer (4 layers)** | **WSJ only** | **91.3** |\n| Previous state-of-the-art | Semi-supervised | 92.1 |\n| **Transformer (4 layers)** | **Semi-supervised** | **92.7** |\n\n---\n\n## Attention Visualization: Long-Distance Dependencies\n\n<img src=\"/paper_figure_3_long_distance.png\" class=\"h-96 mx-auto\" />\n\n*Encoder self-attention showing long-distance dependency for \"making\"*\n\n---\n\n## Attention Visualization: Anaphora Resolution\n\n<img src=\"/paper_figure_4_anaphora.png\" class=\"h-96 mx-auto\" />\n\n*Attention heads resolving \"its\" reference to \"The Law\"*\n\n---\n\n## Limitations\n\n- Computational complexity grows quadratically with sequence length\n- Less effective for very long sequences\n- Still requires sequential generation in decoder\n- Limited ability to model hierarchical structure\n\n---\n\n## Key Contributions\n\n- Introduced Transformer architecture based solely on attention\n- Achieved new state-of-the-art results in machine translation\n- Demonstrated improved parallelization and reduced training time\n- Showed generalization to other tasks like constituency parsing\n\n---\n\n## Future Work\n\n- Apply to other modalities (images, audio, video)\n- Investigate local, restricted attention for large inputs\n- Make generation less sequential\n- Explore interpretability of attention mechanisms\n\n---\n\n## Thank You\n\nCode available at: https://github.com/tensorflow/tensor2tensor\n\narXiv:1706.03762v7 [cs.CL]\n```"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": "审核者（Reviewer）渲染了你上一版 slides.md 的每一页截图，给出如下结构化改进建议（JSON）：\n\n{\n \"overall_score\": 65,\n \"pass\": false,\n \"issues\": [\n {\n \"page\": 7,\n \"issue_type\": \"image_size\",\n \"severity\": \"medium\",\n \"suggestion\": \"缩小架构图尺寸，确保下方说明文字有足够空间，避免图片挤压文字区域\"\n },\n {\n \"page\": 8,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"medium\",\n \"suggestion\": \"将5个要点拆分为两页，建议将\\\"每个层包含两个子层\\\"及其子要点单独成页\"\n },\n {\n \"page\": 12,\n \"issue_type\": \"image_size\",\n \"severity\": \"medium\",\n \"suggestion\": \"调整多头注意力架构图大小，确保图片下方的文字说明完整可见且易于阅读\"\n },\n {\n \"page\": 13,\n \"issue_type\": \"overcrowded\",\n \"severity\": \"low\",\n \"suggestion\": \"将三个注意力应用拆分为单独页面，或简化每个应用的子要点描述\"\n },\n {\n \"page\": 21,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"大幅放大注意力可视化图，确保图中文字和颜色编码清晰可辨，必要时单独成页展示\"\n },\n {\n \"page\": 22,\n \"issue_type\": \"image_size\",\n \"severity\": \"high\",\n \"suggestion\": \"放大指代消解可视化图，增加图片分辨率，确保线条和文字清晰可读\"\n }\n ]\n}\n\n请理解这些问题并修订 slides.md（可拆页、精简文字、调整图片尺寸等），重新输出完整的 slides.md。"
|
||
}
|
||
],
|
||
"temperature": 0.3
|
||
},
|
||
"response": {
|
||
"id": "0217853617655343183e54b3cfcef38bb594a5367204480a5e210",
|
||
"model": "doubao-seed-1-6-250615",
|
||
"finish_reason": "stop",
|
||
"content": "```markdown\n---\ntheme: default\n---\n\n# Attention Is All You Need\n## A Revolutionary Architecture for Sequence Transduction\n\nAshish Vaswani et al. \nNIPS 2017\n\n---\n\n## Abstract: Key Innovation\n\n- Proposes **Transformer** - first model based solely on attention mechanisms\n- Dispenses with recurrence and convolutions entirely\n- More parallelizable and requires significantly less training time\n\n---\n\n## Abstract: Performance Highlights\n\n- Achieves 28.4 BLEU on WMT 2014 English-to-German\n - Improves over existing best results by over 2 BLEU\n- Establishes new state-of-the-art 41.8 BLEU on WMT 2014 English-to-French\n- Generalizes well to other tasks like English constituency parsing\n\n---\n\n## Background: Limitations of RNNs\n\n### Recurrent Neural Networks (RNNs/LSTMs/GRUs)\n- Inherently sequential computation\n- Cannot parallelize within training examples\n- Difficult to learn long-range dependencies\n- Memory constraints limit batching for long sequences\n\n---\n\n## Background: Limitations of Convolutional Approaches\n\n### CNN-based Models (ByteNet, ConvS2S)\n- Use convolutions for parallelization\n- Number of operations grows with distance between positions\n - Linear growth for ConvS2S\n - Logarithmic growth for ByteNet\n- Longer path lengths between distant positions\n\n---\n\n## Key Insight: Attention is Sufficient\n\nAttention mechanisms allow modeling dependencies without regard to distance, but were previously used with RNNs.\n\n**Transformer**: First transduction model relying entirely on self-attention to compute representations without:\n- Sequence-aligned RNNs\n- Convolutions\n\n---\n\n## Transformer Architecture Overview\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-80 mx-auto\" />\n\n*Encoder-decoder structure with stacked self-attention and feed-forward layers*\n\n---\n\n## Encoder Structure\n\n- Stack of **6 identical layers**\n- Residual connections around each sub-layer\n- Layer normalization after each sub-layer\n- All sub-layers produce outputs of dimension `d_model = 512`\n\n---\n\n## Encoder: Sub-layer Details\n\nEach encoder layer contains two sub-layers:\n\n1. **Multi-head self-attention** mechanism\n - All positions attend to all positions in previous layer\n - Enables modeling of dependencies throughout sequence\n\n2. **Position-wise fully connected feed-forward network**\n - Applied to each position separately and identically\n - Two linear transformations with ReLU activation\n\n---\n\n## Decoder Structure\n\n- Stack of **6 identical layers**\n- Residual connections and layer normalization\n- Output embeddings offset by one position (auto-regressive property)\n\n---\n\n## Decoder: Sub-layer Details\n\nEach decoder layer contains three sub-layers:\n\n1. **Masked multi-head self-attention**\n - Prevents positions from attending to subsequent positions\n\n2. **Multi-head attention over encoder output**\n - Queries from decoder, keys/values from encoder\n\n3. **Position-wise fully connected feed-forward network**\n - Same structure as encoder's feed-forward network\n\n---\n\n## Attention Mechanism\n\n### Scaled Dot-Product Attention\n$$\\text{Attention}(Q, K, V) = \\text{softmax}\\left(\\frac{QK^T}{\\sqrt{d_k}}\\right)V$$\n\n- $Q$ (queries), $K$ (keys), $V$ (values) are matrices\n- Scaling by $\\frac{1}{\\sqrt{d_k}}$ prevents gradients from becoming too small\n- Faster and more space-efficient than additive attention\n\n---\n\n## Multi-Head Attention\n\n<img src=\"/paper_figure_1_transformer.png\" class=\"h-60 mx-auto\" />\n\n- Projects queries, keys, values $h$ times with different learned projections\n- Performs attention in parallel on projected versions\n- Concatenates results and projects again\n\n$$\\text{MultiHead}(Q, K, V) = \\text{Concat}(\\text{head}_1, ..., \\text{head}_h)W^O$$\n\n---\n\n## Attention Application: Encoder-Decoder\n\n**Encoder-decoder attention**:\n- Queries come from previous decoder layer\n- Memory keys and values come from encoder output\n- Allows every position in decoder to attend over all positions in input sequence\n- Mimics typical encoder-decoder attention mechanisms\n\n---\n\n## Attention Application: Encoder Self-Attention\n\n**Encoder self-attention**:\n- Keys, values and queries all come from previous encoder layer\n- Each position attends to all positions in previous encoder layer\n- Enables modeling of relationships between all words in input sequence\n- No regard to distance between positions\n\n---\n\n## Attention Application: Decoder Self-Attention\n\n**Decoder self-attention**:\n- Keys, values and queries come from previous decoder layer\n- Each position attends to all positions up to and including itself\n- Masking prevents attending to subsequent positions\n- Preserves auto-regressive property (predictions depend only on known outputs)\n\n---\n\n## Positional Encoding\n\nSince model has no recurrence/convolution, we inject positional information:\n\n$$\\text{PE}_{(pos, 2i)} = \\sin\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n$$\\text{PE}_{(pos, 2i+1)} = \\cos\\left(pos / 10000^{2i/d_{\\text{model}}}\\right)$$\n\n- Same dimension as embeddings ($d_{\\text{model}}$)\n- Allows model to learn relative position information\n- Performed nearly as well as learned positional embeddings\n\n---\n\n## Why Self-Attention?\n\n| Layer Type | Complexity | Sequential Operations | Max Path Length |\n|------------|------------|-----------------------|-----------------|\n| Self-Attention | $O(n^2 \\cdot d)$ | $O(1)$ | $O(1)$ |\n| Recurrent | $O(n \\cdot d^2)$ | $O(n)$ | $O(n)$ |\n| Convolutional | $O(k \\cdot n \\cdot d^2)$ | $O(1)$ | $O(\\log_k n)$ |\n\n---\n\n## Training: Data & Batching\n\n- WMT 2014 English-German (4.5M sentence pairs)\n- WMT 2014 English-French (36M sentence pairs)\n- Byte-pair encoding (37K shared vocab for EN-DE)\n- Batches with ~25000 source and target tokens\n\n---\n\n## Training: Hardware & Schedule\n\n- 8 NVIDIA P100 GPUs\n- Base model: 100,000 steps (12 hours)\n- Big model: 300,000 steps (3.5 days)\n- Adam optimizer with scheduled learning rate\n\n---\n\n## Machine Translation Results\n\n| Model | EN-DE BLEU | EN-FR BLEU | Training Cost (FLOPs) |\n|-------|------------|------------|-----------------------|\n| GNMT + RL Ensemble | 26.30 | 41.16 | $1.8 \\cdot 10^{20}$ |\n| ConvS2S Ensemble | 26.36 | 41.29 | $7.7 \\cdot 10^{19}$ |\n| **Transformer (big)** | **28.4** | **41.8** | **$2.3 \\cdot 10^{19}$** |\n\n---\n\n## Generalization to Constituency Parsing\n\n| Parser | Training | WSJ 23 F1 |\n|--------|----------|-----------|\n| Previous state-of-the-art | WSJ only | 91.7 |\n| **Transformer (4 layers)** | **WSJ only** | **91.3** |\n| Previous state-of-the-art | Semi-supervised | 92.1 |\n| **Transformer (4 layers)** | **Semi-supervised** | **92.7** |\n\n---\n\n## Attention Visualization: Long-Distance Dependencies\n\n<img src=\"/paper_figure_3_long_distance.png\" class=\"h-full w-full object-contain\" />\n\n---\n\n## Attention Visualization: Anaphora Resolution\n\n<img src=\"/paper_figure_4_anaphora.png\" class=\"h-full w-full object-contain\" />\n\n---\n\n## Limitations\n\n- Computational complexity grows quadratically with sequence length\n- Less effective for very long sequences\n- Still requires sequential generation in decoder\n- Limited ability to model hierarchical structure\n\n---\n\n## Key Contributions\n\n- Introduced Transformer architecture based solely on attention\n- Achieved new state-of-the-art results in machine translation\n- Demonstrated improved parallelization and reduced training time\n- Showed generalization to other tasks like constituency parsing\n\n---\n\n## Future Work\n\n- Apply to other modalities (images, audio, video)\n- Investigate local, restricted attention for large inputs\n- Make generation less sequential\n- Explore interpretability of attention mechanisms\n\n---\n\n## Thank You\n\nCode available at: https://github.com/tensorflow/tensor2tensor\n\narXiv:1706.03762v7 [cs.CL]\n```"
|
||
},
|
||
"usage": {
|
||
"prompt_tokens": 17385,
|
||
"completion_tokens": 2233,
|
||
"total_tokens": 19618,
|
||
"cached_prompt_tokens": 0
|
||
}
|
||
},
|
||
{
|
||
"meter": "Reviewer(每轮只看最新截图)",
|
||
"called_at_utc": "2026-07-29T21:54:18.878269+00:00",
|
||
"latency_s": 227.697,
|
||
"request": {
|
||
"model": "doubao-seed-1-6-250615",
|
||
"messages": [
|
||
{
|
||
"role": "system",
|
||
"content": "你是一名严格的演示文稿质量审核员（Reviewer）。你会看到一份由 Slidev 渲染出的 PPT，\n每张图对应一页幻灯片（按顺序编号，从第 1 页开始）。请逐页检查以下问题：\n\n- text_overflow（文字溢出/被裁切超出页面边界）\n- overcrowded（内容过多/过于拥挤/留白不足）\n- image_size（图片过大顶出布局，或过小看不清）\n- readability（字号过小、对比度差、代码块难读）\n- layout（对齐混乱、标题与正文比例失衡、空页）\n\n请以**目标用户是听众**的严格标准审查——一页幻灯片若要点超过约 5 条、或正文文字块偏长、\n或图片挤压了文字空间，都应视为 overcrowded/image_size 问题。报告真实存在的问题，\n但不要放过\"塞得太满\"。对每个问题给出：page（页码，整数）、\nissue_type（上面之一）、severity（high/medium/low）、suggestion（具体、可执行的修改建议，中文）。\n\n同时给出：\n- overall_score：0-100 的整体质量分（越高越好）\n- pass：布尔值，仅当整份 PPT **既无 high 也无 medium 级问题**、排版干净可读时才为 true\n\n严格输出如下 JSON（不要输出任何多余文字）：\n{\n \"overall_score\": <int>,\n \"pass\": <bool>,\n \"issues\": [\n {\"page\": <int>, \"issue_type\": \"<type>\", \"severity\": \"<high|medium|low>\", \"suggestion\": \"<中文建议>\"}\n ]\n}"
|
||
},
|
||
{
|
||
"role": "user",
|
||
"content": [
|
||
{
|
||
"type": "text",
|
||
"text": "这份 PPT 共 28 页，下面按页码顺序给出每一页的渲染截图。请审查。"
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 1 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "43e962b781454c3d5eac7723de28844f9fe12cee5370e89387f0273d1c119d0a",
|
||
"characters": 89538,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 2 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "b2a0e0ec4af087661538cb21aeaa925ce2649277fea60edf6e1909e7bc995f27",
|
||
"characters": 89158,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 3 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "19b9176369105b1ad2465089e86ff40cbfc818975d4423fa383d04d9593f919c",
|
||
"characters": 112834,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 4 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "e4f81ff0785c205c5317d8b547bcd89df9a11fd1f7d9b46085ed39758421b81b",
|
||
"characters": 114062,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 5 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "5a9843c5e0326a27cd89eaedb92dafb54a3b58609938c2c03d11f759e16d8192",
|
||
"characters": 137070,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 6 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "3aff1d8f78e992b811abfb7056b3f702a7f9b9e0252d87589169b320329ea9cd",
|
||
"characters": 115978,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 7 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "d1b08f63033f50a0099bfaf290d2c78488497ce90502f0418a22fc85d858ab24",
|
||
"characters": 148726,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 8 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "d10cfb97e003f2394e829257d34b87d9dc8605fc0d76f7ba8463a5f270d66d77",
|
||
"characters": 80906,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 9 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "651a8084170516ebc2ea5f5a770ea1c911f385a76853a5d139fd0940846b08d6",
|
||
"characters": 146178,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 10 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "22fa04d257296d3b997e236d01c62e1a71a6de56ce91f3688822b5f837af1e72",
|
||
"characters": 70822,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 11 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "31ec1c61675d73fc8ae27a058b36a8bfe5d83312edb85254c172372c19ff0537",
|
||
"characters": 145434,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 12 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "8559bdc49da07f01235da0fa53449148195874fd2f682c332cb4023b88b6ff02",
|
||
"characters": 119686,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 13 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "ae72114c0c8f563093d4320ba8bb399b6cd572383be4bf837569929cc06bacb2",
|
||
"characters": 158286,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 14 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "733014799be2f96ee706abc7292fc24643fd57cecb112ca9f4d83bee58f99123",
|
||
"characters": 116662,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 15 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "013e1318ad26b0bc2befea59f8958cd7082365f01eff03b421c3d30d7cecfee5",
|
||
"characters": 124650,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 16 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "d1b7bbef8913128b6acfab7c6fed2b02e9f24d8956da583a66932ab793e2734b",
|
||
"characters": 133026,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 17 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "dd95550e6ada1f29652e54f3c829782fc745de53586acfa85a90695cfac91793",
|
||
"characters": 137506,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 18 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "5fc4a95473691f535e128b95c41e85133708a749a2a87f9ddbe112a9ba2402ef",
|
||
"characters": 97342,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 19 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "2c7fb3227dcfd25e3042f31fc72a993828b6077c763eae29ddabc4f9c447100e",
|
||
"characters": 97650,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 20 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "c5b9f0de1522bfd3fd42727069f3f6d95ff4240198364b8c732b14b650de0dc7",
|
||
"characters": 83218,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 21 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "bb1768052f2a5579e1a26d7c32e67b0e481210c82f3081bf00103f2f515f518c",
|
||
"characters": 92922,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 22 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "7069e51ab552ba7114c950ff8c927d6571a74b15adf8faa9f944c4b9cc9e6837",
|
||
"characters": 106682,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 23 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "bedfd537e35157b90b5c0250e39cf1f15d7ab6f8de10e4580f952fb0e6fbc8ad",
|
||
"characters": 208786,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 24 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "181bea947571afeba34b2d1aa32292ab3b31e0f05c6e849fb84d9eb9c76de498",
|
||
"characters": 233282,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 25 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "a2a46d6bbb77b2d069468a2813a6af415521c3d2b27f762bbd55019c44fcb9ff",
|
||
"characters": 84722,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 26 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "42ef0dc5c23a813c11147181dff3b9c5d61fd75ec5482e122e8faceb6c4cf62e",
|
||
"characters": 105366,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 27 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "f48dd24cfbffd6249e0d54a44b5feb543b2cf1c54e5b48ad119ba532c08e2a16",
|
||
"characters": 81506,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
},
|
||
{
|
||
"type": "text",
|
||
"text": "第 28 页："
|
||
},
|
||
{
|
||
"type": "image_url",
|
||
"image_url": {
|
||
"url": {
|
||
"data_url_sha256": "664fadc511edb5003c94f280fbdebe1a87fa9af4deb179cef896c1499ea8db5c",
|
||
"characters": 51614,
|
||
"media_type": "image/png"
|
||
},
|
||
"detail": "high"
|
||
}
|
||
}
|
||
]
|
||
}
|
||
],
|
||
"temperature": 0.2
|
||
},
|
||
"response": {
|
||
"id": "0217853620148877b2c08adb457386e4dc9fc8de61d86c7dc9c0b",
|
||
"model": "doubao-seed-1-6-250615",
|
||
"finish_reason": "stop",
|
||
"content": "{\n \"overall_score\": 85,\n \"pass\": false,\n \"issues\": [\n {\n \"page\": 23,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"原图彩色注意力可视化转为黑白后对比度差，不同注意力头难以区分。建议添加灰度区分或图案填充来标识不同注意力头，或增加图例说明关键颜色对应的含义。\"\n },\n {\n \"page\": 24,\n \"issue_type\": \"readability\",\n \"severity\": \"medium\",\n \"suggestion\": \"原图彩色注意力可视化转为黑白后线条区分度低。建议使用不同线型（实线/虚线/点线）或线宽来区分不同注意力头，确保黑白打印下仍能清晰识别关键依赖关系。\"\n }\n ]\n}"
|
||
},
|
||
"usage": {
|
||
"prompt_tokens": 33634,
|
||
"completion_tokens": 1802,
|
||
"total_tokens": 35436,
|
||
"cached_prompt_tokens": 0
|
||
}
|
||
}
|
||
] |