Conditional Memory (Scalable Lookup)

Active Frontier
Sign in to track mastery·Sign in·Practice anyway
architecturesparsitymemoryscaling-lawsmixture-of-experts

Conditional Memory (Scalable Lookup)

Conditional memory is an architectural proposal that gives large language models a second axis of sparsity, orthogonal to Mixture-of-Experts (MoE). The distinction is clean:

  • MoE = conditional computation — selectively activate a subset of neurons/experts per token.
  • Conditional memory = conditional retrieval — selectively look up stored knowledge from a static table per token.

The mechanism is Engram (Cheng et al., DeepSeek/PKU, Jan 2026): a modernized n-gram embedding that provides constant-time (O(1)) lookup. Instead of forcing the model to simulate retrieval through expensive forward-pass computation — something Transformers do only implicitly and inefficiently — Engram hands the model a dedicated, scalable memory primitive.

Why It Matters: A New Scaling Axis

The load-bearing result is the Sparsity Allocation problem: given a fixed capacity budget, how much should go to neural computation (MoE) versus static memory (Engram)? The answer is a U-shaped scaling curve with an optimal interior allocation — neither all-compute nor all-memory is best. This reframes "knowledge stored in weights" as something that can be deliberately budgeted as a distinct resource, and the paper scales Engram to 27B parameters of conditional memory on this basis.

Key Claims

  • Conditional memory is a sparsity axis distinct from and complementary to MoE — compute-sparsity (MoE) and memory-sparsity (Engram) can be combined. Evidence: strong (paper with ablations) (Engram)
  • A U-shaped scaling law governs the compute-vs-memory allocation — optimal capacity split is interior, not at either extreme; scaled to 27B params. Evidence: strong (Engram)
  • Lookup helps reasoning more than raw recall — largest gains are on reasoning/code/math, not just knowledge benchmarks. Evidence: strong (Engram)

Results

BenchmarkΔ from adding Engram
MMLU+3.4
CMMLU+4.0
BBH (Big Bench Hard)+5.0
ARC-Challenge+3.7
HumanEval+3.0
MATH+2.4
Multi-Query NIAH (long-context)84.2 → 97.0

Open Questions

  • Does the U-shaped allocation hold at frontier (trillion-parameter) scale, and does it interact with hybrid attention?
  • How does conditional memory compose with agent memory architectures (external retrieval stores) — substitute, or stack?
  • Is the static-lookup table a new attack surface (knowledge poisoning) the way agent memory stores are?

Related Concepts

Changelog

  • 2026-06-24 — Initial compilation from Engram paper (arXiv 2601.07372). New page: conditional memory as a sparsity axis orthogonal to MoE.
Conditional Memory (Scalable Lookup) | KB | MenFem