LatentPort: Beyond KV Cache - Cross-Model Transfer of Recurrent Memory in Hybrid Language Models: A 4B-to-9B Hybrid-State Handoff Without Target Prefix Replay

Simon P. Villani

Published September 7, 2026 · on the feed September 23, 2026 · ▲ 15 · arXiv 2609.25053

Model architectureEfficiency & inference Full code arXiv ↗Hugging Face ↗

The abstract

Can one language model hand its live memory to another without the receiver rereading the context? We demonstrate useful persistent hybrid-state transfer across one architecture-matched Qwen3.5 4B-to-9B sibling pair. To our knowledge, this is the first demonstrated cross-model handoff of persistent recurrent inference state between differently sized hybrid language models without target prefix replay. Translated attention KV alone leaves a large gap; adding the Gated DeltaNet (GDN) persistent-state package lowers teacher-forced negative log-likelihood (NLL), the average next-token log-loss, by 0.747 nats/token (95% paired document bootstrap CI [0.6921, 0.8047]), improving all 64 PG19 documents. Direct recurrent and convolution reuse outperforms the tested learned GDN maps, consistent with partial functional compatibility of persistent-state coordinates. A fresh component factorial selects translated KV with direct recurrent and convolution state. An additional 434,176-parameter correction improves that base on 64 fresh web documents: continuation loss is 0.076 nats/token above native 9B (excess NLL), Jensen-Shannon (JS) divergence is 0.022, and native context recovery (NCR) is 0.918. Corrected 9B significantly beats continued 4B inference while processing zero historical prefix tokens. Evidence covers one direction, one geometry-matched Base-model pair, and 4K teacher-forced continuation; the near-native gate failed, the 16K branch was not run, and free-generation equivalence and a general state interface remain unproven.

The Brief

2:40

A short podcast summary of the paper. Written and voiced by AI.

Transcript

LatentPort. Beyond KV Cache - Cross-Model Transfer of Recurrent Memory in Hybrid Language Models: A 4B-to-9B Hybrid-State Handoff Without Target Prefix Replay. By Simon P. Villani. Published on the seventh of September. Its code repository is worked out: about ninety source files, with a readme and a licence.

Can one language model hand its live memory to another, without the receiver rereading the context? The author shows that it can, for one specific pair: an architecture-matched Qwen3.5 sibling pair, from four billion parameters to nine billion. To the author's knowledge, this is the first demonstrated cross-model handoff of persistent recurrent inference state between differently sized hybrid language models without target prefix replay. The larger model picks up where the smaller one left off, without processing the history itself. The title's phrase for this is a hybrid-state handoff: what is passed across is not only the attention cache, but the persistent recurrent state that hybrid models also keep.

Translating the attention KV cache alone leaves a large gap. Adding the persistent-state package from Gated DeltaNet, or GDN, lowers teacher-forced negative log-likelihood, the average next-token log-loss, by zero point seven four seven nats per token. The ninety-five percent paired bootstrap interval runs from zero point six nine two one to zero point eight zero four seven, and every one of the sixty-four PG19 documents improves.

Reusing the recurrent and convolution state directly works better than the learned GDN maps tested, which is consistent with the persistent-state coordinates being partly compatible between the two models. A fresh component factorial selects translated KV together with direct recurrent and convolution state.

A further correction with four hundred and thirty-four thousand one hundred and seventy-six parameters improves on that base, measured on sixty-four fresh web documents. Continuation loss sits zero point zero seven six nats per token above native nine billion. Jensen-Shannon divergence is zero point zero two two. Native context recovery is zero point nine one eight. And the corrected nine billion model significantly beats simply continuing inference on the four billion model, while processing zero historical prefix tokens.

The author sets the limits carefully. The evidence covers one direction, one geometry-matched Base-model pair, and continuation up to four thousand tokens under teacher forcing. The near-native gate failed. The sixteen thousand token branch was not run. Equivalence under free generation, and a general interface for state, both remain unproven.

Within those limits, the handoff works: live memory crossed from a smaller model to a larger one, and the larger model was better off with it than without it.

Paper Quest · 7 chapters · about 39 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Every quest starts with a wall. Here it is a big model that must reread everything a small one already read.

You have run a small 4B language model over a long document, and now want its larger 9B sibling to carry on. Normally the 9B model must reread the whole history to rebuild its memory.

The road ahead

  1. 1 · The problem ~6 min Handing a long document from a small model to its larger sibling normally means the larger one rereads everything, and moving only attention memory is not enough.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~8 min Hand over the recurrent memory along with the keys and values, copy it directly, then add a small trained correction so the 9B model reads no history.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min The 4B model reads the context, its memory is translated or copied, a small correction is applied, and the 9B model continues without rereading.
  6. 6 · The experiment ~6 min You’ll guess: Reading zero history tokens, did the corrected 9B model continue documents better than simply carrying on with the 4B model?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.