Self-attention layers' first approach

Transformers in contextual generation and summarization

Huggingface Model Summary

A Survey of Transformers (Lin et. al, 2021)

Overview of a Transformer

Model Usage of Transformers

Attention in vanilla Transformers

Transformer Variants (X-formers)

The Pre-training and Fine-tuning Paradigm

Architectural Categories of Pre-trained Transformers

Computational Cost of Self-Attention in Transformers

Quadratic Complexity's Impact on Transformer Inference Speed

Pre-Norm Architecture in Transformers

Critique of the Transformer Architecture's Core Limitation

A research team is building a model to summarize extremely long scientific papers. They are comparing two distinct architectural approaches:

• Approach 1: Processes the input text sequentially, token by token, updating an internal state that is passed from one step to the next.
• Approach 2: Processes all input tokens simultaneously, using a mechanism that directly relates every token to every other token in the input to determine context.

Which of the following statements best analyzes the primary trade-off between these two approaches for this specific task?

Architectural Design Choice for Machine Translation

Enablers of Universal Language Capabilities

Model Depth in Transformers

Generalization of the Language Modeling Concept

Transformer Block Sub-Layers

Standard Optimization Objective for Transformer Language Models

Architectural Adaptation of LLMs for Long Sequences

Quadratic Complexity's Impact on Transformer Inference Speed

Computational Infeasibility of Standard Transformers for Long Sequences

Shared Weight and Shared Activation Methods

Key-Value (KV) Cache in Transformer Inference

Analyzing Model Processing Time

A key component in a modern neural network architecture for processing text has a computational cost that grows quadratically with the length of the input sequence. If processing a sequence of 512 tokens takes 2 seconds on a specific hardware setup, approximately how long would it take to process a sequence of 2048 tokens, assuming all other factors are constant?

Analyzing Computational Scaling