Moving Average of Keys and Values for Memory Component
A straightforward method for creating summary vectors for the memory component () is to compute the moving average of past keys and values. For instance, can be constructed from the unweighted moving average of the last key and value vectors, providing a simple yet effective way to summarize history.
0
1
Tags
Ch.2 Generative Models - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Related
Moving Average of Keys and Values for Memory Component
Weighted Moving Average for Memory Component
Cumulative Average of Keys and Values for Memory Component
An engineer is designing a language model that must process very long sequences while keeping the computational cost of attention constant at each step. They are considering two approaches for the model's memory component:
- Approach 1: The memory stores the raw key-value pairs from the 256 most recent positions in the sequence.
- Approach 2: The memory is a pair of fixed-size 'summary' vectors, which are calculated by mathematically combining all preceding key-value pairs into a single, condensed representation.
Which statement best analyzes the primary trade-off between these two approaches?
Memory Representation in Attention Mechanisms
Recurrent Update for Memory Caching
Optimizing Memory for Long-Sequence Processing
Moving Average of Keys and Values for Memory Component
Learn After
Formula for Memory as a Moving Average of Keys and Values
Example of a Moving Average-based Cache
Cumulative Average of Keys and Values for Memory Component
Calculating a Memory Component Summary
When using a moving average of the last
nkey-value pairs to create a single summary vector for a memory component, what is the primary effect of significantly increasing the window sizen?Weighted Moving Average for Memory Component
A memory component in a transformer-based model is designed to create a summary by computing the simple, unweighted average of the last 10 key-value pairs. Which statement accurately describes a fundamental property of this specific summarization method?