Loading the interactive visualization…

07 · Reference notes

← All visual guides

Kimi Delta Attention Explained

Kimi Delta Attention uses a fixed recurrent memory with fine-grained per-channel gates to control how information is written and forgotten.

01 · Definition

What is Kimi Delta Attention?

It builds on delta-rule recurrence but makes the memory control more granular. Instead of one broad decision for an update, different dimensions of the state can keep, replace, or forget different amounts of information.

02 · Mechanism

Why fine-grained gates matter

Sequence information is not equally useful across every memory channel. A single scalar gate treats a whole update as one decision. Per-channel gates let the architecture preserve one feature while rapidly overwriting another.

03 · Mechanism

A controlled recurrent state

Like other linear recurrent mechanisms, Kimi Delta Attention carries a fixed-size state instead of a KV cache that grows token by token. The current token reads from that state and proposes an update; learned gates decide how that update enters memory.

04 · Mechanism

What it trades

The architecture reduces the memory growth associated with standard attention and can process long streams efficiently. In exchange, relevant history must remain encoded in the state, so the update and forget controls become a key part of model quality.

05 · Mechanism

When to use this pattern

Fine-grained recurrent memory is useful when the model needs both long-running state and selective forgetting. It is a different approach from sparse retrieval: the mechanism manages a compressed memory rather than selecting a subset of stored tokens.

Source · Original paper