logo
How it worksCoursesResearch CommunitiesBenefitsAbout Us
Schedule Demo
Learn Before
  • Formula for FIFO Memory Update in Compressive Transformer

Matching

A sequence processing model uses the formula Mem_new = FIFO(S_new, Mem_old) to update its fixed-size memory. Match each component of the formula to its correct description.

0

1

Updated 2025-10-04

Contributors are:

Gemini AI
Gemini AI
🏆 2

Who are from:

Google
Google
🏆 2

Tags

Ch.2 Generative Models - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences

Analysis in Bloom's Taxonomy

Cognitive Psychology

Psychology

Social Science

Empirical Science

Science

Related
  • A memory component in a sequence processing model is updated using a First-In, First-Out (FIFO) rule. The memory has a fixed capacity of 3 segments. The current state of the memory, ordered from oldest to newest, is [Segment_A, Segment_B, Segment_C]. A new segment, Segment_D, is processed. According to the FIFO update rule, what will be the new state of the memory after the update?

  • A sequence processing model uses the formula Mem_new = FIFO(S_new, Mem_old) to update its fixed-size memory. Match each component of the formula to its correct description.

  • The formula Mem = FIFO(S_kv^k, Mem_pre) describes an update to a fixed-size memory buffer in a sequence processing model. Arrange the operations below into the correct chronological order that this formula represents.

logo 1cademy1Cademy

Optimize Scalable Learning and Teaching

How it worksCoursesResearch CommunitiesBenefitsAbout Us
TermsPrivacyCookieGDPR

Contact Us

iman@honor.education

Follow Us




© 1Cademy 2026

We're committed to OpenSource on

Github