Learn Before
Deconstructing a Memory Update
A system's memory component is updated according to the rule: Updated_Memory = Update_Function(New_Data, Previous_Memory). The memory has a fixed capacity of 4 items. Initially, the Previous_Memory state is [item_1, item_2, item_3, item_4], ordered from oldest to newest. After one update step, the Updated_Memory state is [item_3, item_4, item_5, item_6]. Based on this outcome, what was the New_Data that was processed, and what specific actions did the Update_Function perform to arrive at the final state?
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
Analysis 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.