Late Entry in Looped Language Models
Looped language models deepen reasoning at a compact parameter count by iterating a shared layer stack T times per token, turning recurrence depth directly into sequential decoding latency. Convention
- Upvotes3
Looped language models deepen reasoning at a compact parameter count by iterating a shared layer stack T times per token, turning recurrence depth directly into sequential decoding latency. Convention
Looped language models deepen reasoning at a compact parameter count by iterating a shared layer stack T times per token, turning recurrence depth directly into sequential decoding latency. Conventional early-exit decoding halts after initial passes without cache completion, truncating cached key-value states of past tokens to shallow depth. We study the opposite strategy, late entry, where new tokens skip initial passes and enter directly into the final K T alongside subsequent steps at zero extra serial calls. Projecting these finished T-pass wake states inside the existing output GEMM (Wake verification, governed by logit-margin tolerance tau in [0, inf]) unifies greedy-exact T-pass…
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.
Late Entry in Looped Language Models was first seen on Hugging Face · Daily papers on Nov 19, 2026. Since then it has appeared in 12 checks on 2 different days. Its best position was #13 of 30, reached on Nov 20, 05:29 UTC. It dropped off the list after Nov 20, 05:29 UTC.
Position on Hugging Face · Daily papers at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Hugging Face.
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Nov 20, 05:29 UTC, after 2 days of trending.
#13 on Hugging Face · Daily papers, on Nov 20, 05:29 UTC. Trendoday checks this list every 120 minutes.
It was first seen on Nov 19, 2026 and has been on the list on 2 days (12 checks) since.