Question 6
In the standard Transformer architecture (e.g., GPT or BERT), which component exhibits a computational complexity that scales quadratically ( ) with respect to the input sequence length ?
The initial token and positional embedding lookup.
The element-wise addition in the Residual (Skip) connections.
The computation of the attention score matrix ( ).
The linear projections in the Position-wise Feed-Forward Network (FFN).