Computer programmers chain together the same reusable computational primitives, for example, conditional statements or loops, but in different orders to implement different algorithms. In contrast, ex
Library of Layers dynamically orders transformer blocks during inference to adapt computation to tasks, enabling parameter reuse, sparsity, and interpretable routing across reasoning, multilingual, and safety settings.
Computer programmers chain together the same reusable computational primitives, for example, conditional statements or loops, but in different orders to implement different algorithms. In contrast, existing language model architectures always execute their layers in the same order. We introduce Library of Layers (LoL), an architecture that dynamically orders its layers during inference to solve the problem at hand. LoL has a single hyperparameter, the size of its global library of transformer blocks, that allows it to transition seamlessly between parameter reuse and sparsity, generalizing the parameter-efficiency and FLOPs-efficiency tradeoffs of dense, depth-recurrent, and mixture of…
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.
Library of Layers (LoL): Adaptively Ordering Transformer Layers at Runtime was first seen on Hugging Face · Daily papers on Nov 3, 2026. Since then it has appeared in 4 checks on 2 different days. Its best position was #25 of 30, reached on Nov 4, 01:28 UTC. It dropped off the list after Nov 4, 03:28 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 4, 03:28 UTC, after 2 days of trending.
#25 on Hugging Face · Daily papers, on Nov 4, 01:28 UTC. Trendoday checks this list every 120 minutes.
It was first seen on Nov 3, 2026 and has been on the list on 2 days (4 checks) since.