Learn Before
A model's memory component has a fixed capacity of 4 slots and is updated using a First-In, First-Out (FIFO) queue mechanism. The current state of the memory, ordered from oldest to newest, is [M1, M2, M3, M4]. If a new set of 2 items, [N1, N2], is to be added, what will be the final state of the memory after the update?
0
1
Tags
Ch.2 Generative Models - Foundations of Large Language Models
Foundations of Large Language Models
Computing Sciences
Foundations of Large Language Models Course
Application in Bloom's Taxonomy
Cognitive Psychology
Psychology
Social Science
Empirical Science
Science
Related
A model's memory component has a fixed capacity of 4 slots and is updated using a First-In, First-Out (FIFO) queue mechanism. The current state of the memory, ordered from oldest to newest, is
[M1, M2, M3, M4]. If a new set of 2 items,[N1, N2], is to be added, what will be the final state of the memory after the update?Deconstructing a Memory Update
The formula
CMem = FIFO(C_kv^k, CMem_pre)describes the update process for a fixed-size memory queue. Arrange the following events into the correct chronological order that this formula represents.