Looped Transformers apply the same layers several times per token, adding compute to improve quality without more parameters. Each recursion, however, writes its own key-value cache, so memory still grows with compute. Inference-time techniques can shrink this cache at a cost in quality. We pretrain looped language mod...
Giovanni Monea, Keshav Ramji, Yousef El-Kurdi et al.· 0 citations
This paper takes state--prediction separation to its limit with a free pause token: a prediction stream that writes no keys or values at all and so rides the sequence's existing positions, and reduces the raw flops required at inference time.
John Langford, Nathan Godey, Giovanni Monea et al.· 2 citations
This paper improves both training and inference efficiency by stacking sub-models of increasing size into a single nested architecture trained end-to-end in a Matryoshka training framework that reduces the total parameter count, enables low-cost distillation from the largest to all smaller sub-models at every training...
This work proposes continuous-query LMLM (CO-LMLM), where the KB pairs continuous keys with textual knowledge values, a significant departure from prior reliance on relational KB and queries, which outperforms prior LMLMs and vanilla LLMs in both perplexity and factual precision.
Yair Feldman, Lin-Xi Zhao, Nathan Godey et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.