s1: Simple test-time scaling
Muennighoff et al., 2025, s1 (Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing)
Subscriber deck — free during early access
1 cards in “Limitations” · whole deck
Limitations
- What limits further scaling with budget forcing?It eventually flattens out, and sequential thinking is bounded by the context window; the authors suggest combining it with parallel methods such as majority voting or reward-guided tree search (REBASE). Like other test-time methods, it was tested only on problems with checkable answers, not on open-ended tasks like creative writing.
- Muennighoff et al., 2025, s1 (Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing), Limitations, p. 20284
Source
- Niklas Muennighoff, Zitong Yang, Weijia Shi, Xiang Lisa Li, Li Fei-Fei, Hannaneh Hajishirzi, Luke Zettlemoyer, Percy Liang, Emmanuel Candès and Tatsunori Hashimoto. 2025. s1: Simple test-time scaling. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing, pp. 20275–20321. License: CC BY 4.0. Flashcards adapted from this work. doi:10.18653/v1/2025.emnlp-main.1025 https://aclanthology.org/2025.emnlp-main.1025/