Skip to content
#

matched-controls

Here are 4 public repositories matching this topic...

Language: All
Filter by language

Three matched-control gates localize long-context retrieval failure in sparse attention to a single locus- delivery. Attention redirection acts as transport, while stored-state correction is not reusable. Delivery works reliably, is content-addressable (no positional decay), and achieves a 27-byte attribute→code binding. Mechanism: RAG micro-hints.

  • Updated Jun 3, 2026
  • Python

We optimize a compact latent state (frozen weights) to force failed multi-hop chains to output the missing answer D. 5 pre-registered controls show it simply injects D: carries it without the code-fact, leaves intermediates invisible, inert to hop corruption, and doesn’t transfer. No latent composition at 3B (Llama-3.2-3B, Qwen2.5-3B).

  • Updated Jun 4, 2026
  • Python

Synthesis should break the “everything is transport” hypothesis: D must be assembled from absent facts. Cross-model tests (Llama-3.2-3B, Qwen2.5-3B) show it doesn’t. Implicit multi-hop reduces to retrieval + elimination. True composition appears only as externalized CoT. At 3B scale there is no internal computation of absent facts.

  • Updated Jun 4, 2026
  • Python

Improve this page

Add a description, image, and links to the matched-controls topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the matched-controls topic, visit your repo's landing page and select "manage topics."

Learn more