Instructions to use songdj/Lev-3B with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- PEFT
How to use songdj/Lev-3B with PEFT:
from peft import PeftModel from transformers import AutoModel base_model = AutoModel.from_pretrained("Nanbeige/Nanbeige4.2-3B-Base") model = PeftModel.from_pretrained(base_model, "songdj/Lev-3B") - Notebooks
- Google Colab
- Kaggle
Cite the arXiv paper (2610.20951)
Browse files
README.md
CHANGED
|
@@ -20,10 +20,10 @@ tags:
|
|
| 20 |
[](https://openlair.github.io/lev/)
|
| 21 |

|
| 22 |
[](LICENSE)
|
| 23 |
-
[](https://github.com/OpenLAIR/lev)
|
| 25 |
|
| 26 |
-
**[Project](https://openlair.github.io/lev/) · [Paper on
|
| 27 |
|
| 28 |
**One checkpoint. Multiple depths. A probability for every option.**
|
| 29 |
Lev gives text decisions an adjustable compute budget: reuse the same recurrent weights, then read the shared decision head at the chosen depth. It returns typed option probabilities without decoding a chain of reasoning.
|
|
@@ -123,14 +123,16 @@ The base card at the pinned revision is the provenance for these statements; no
|
|
| 123 |
|
| 124 |
**Lev: Thinking Fast and Deep with Looped Decision Models** — Dingjie Song, Zhiling Yan, Yuxuan Zhang, and Lichao Sun.
|
| 125 |
|
| 126 |
-
Read the paper on [
|
| 127 |
|
| 128 |
```bibtex
|
| 129 |
-
@misc{
|
| 130 |
-
|
| 131 |
-
|
| 132 |
-
|
| 133 |
-
|
| 134 |
-
|
|
|
|
|
|
|
| 135 |
}
|
| 136 |
```
|
|
|
|
| 20 |
[](https://openlair.github.io/lev/)
|
| 21 |

|
| 22 |
[](LICENSE)
|
| 23 |
+
[](https://arxiv.org/abs/2610.20951)
|
| 24 |
[](https://github.com/OpenLAIR/lev)
|
| 25 |
|
| 26 |
+
**[Project](https://openlair.github.io/lev/) · [Paper on arXiv](https://arxiv.org/abs/2610.20951) · [PDF](https://arxiv.org/pdf/2610.20951) · [GitHub](https://github.com/OpenLAIR/lev) · [Models & data](https://huggingface.co/collections/songdj/lev)**
|
| 27 |
|
| 28 |
**One checkpoint. Multiple depths. A probability for every option.**
|
| 29 |
Lev gives text decisions an adjustable compute budget: reuse the same recurrent weights, then read the shared decision head at the chosen depth. It returns typed option probabilities without decoding a chain of reasoning.
|
|
|
|
| 123 |
|
| 124 |
**Lev: Thinking Fast and Deep with Looped Decision Models** — Dingjie Song, Zhiling Yan, Yuxuan Zhang, and Lichao Sun.
|
| 125 |
|
| 126 |
+
Read the paper on [arXiv](https://arxiv.org/abs/2610.20951) ([PDF](https://arxiv.org/pdf/2610.20951)) or discuss it on [alphaXiv](https://www.alphaxiv.org/abs/2610.20951). Code is on [GitHub](https://github.com/OpenLAIR/lev) and the research overview is on the [project page](https://openlair.github.io/lev/).
|
| 127 |
|
| 128 |
```bibtex
|
| 129 |
+
@misc{song2026levthinkingfastdeep,
|
| 130 |
+
title={LEV: Thinking Fast and Deep with Looped Decision Models},
|
| 131 |
+
author={Dingjie Song and Zhiling Yan and Yuxuan Zhang and Lichao Sun},
|
| 132 |
+
year={2026},
|
| 133 |
+
eprint={2610.20951},
|
| 134 |
+
archivePrefix={arXiv},
|
| 135 |
+
primaryClass={cs.AI},
|
| 136 |
+
url={https://arxiv.org/abs/2610.20951},
|
| 137 |
}
|
| 138 |
```
|