arXiv:2605. 25143v2 Announce Type: replace Abstract: Test-time scaling improves language model reasoning by spending additional compute to explore multiple solution trajectories.
By Dao Tran, Duc Anh Le, Ngoc Luu, Quan Pham, Tung Pham, Hung Bui
arXiv:2511. 08577v3 Announce Type: replace-cross Abstract: Improving the reasoning abilities of Large Language Models (LLMs), especially under parameter constraints, is crucial for real-world applications.
By Tianyu Fu, Yichen You, Zekai Chen, Guohao Dai, Huazhong Yang, Yu Wang
arXiv:2607. 21453v1 Announce Type: new Abstract: Scaling inference-time computation has emerged as a reliable method to improve the performance of large language models on complex reasoning and programming tasks.
By Rajiv Shailesh Chitale, Rahul Madhavan, Taneesh Gupta, Deepanway Ghosal, Aravindan Raghuveer
arXiv:2606. 06915v1 Announce Type: cross Abstract: Test-time compute (TTC) scaling has emerged as a powerful paradigm for improving large language model (LLM) reasoning by allocating additional compute during inference, e.
By Vladislav Smirnov (MBZUAI), Chieu Nguyen (MBZUAI), Sergey Senichev (Independent Researcher), Minh Ngoc Ta (MBZUAI), Ekaterina Fadeeva (ETH Z\"urich), Artem Vazhentsev (MBZUAI), Daria Galimzianova (MBZUAI), Nikolai Rozanov (MBZUAI, Imperial College London), Viktor Mazanov (Innopolis University), Jingwei Ni (ETH Z\"urich), Tianyi Wu (NUS), Igor Kiselev (Accenture), Mrinmaya Sachan (ETH Z\"urich), Iryna Gurevych (MBZUAI), Preslav Nakov (MBZUAI), Timothy Baldwin (MBZUAI), Artem Shelmanov (MBZUAI)
Parason is a new framework that discovers and exploits both subtask and trial parallelism in large language model (LLM) reasoning. By converting sequential reasoning traces into structured parallel trajectories and training with Parallelism-Aware Group Relative Policy Optimization, it balances accuracy, latency, and parallelism. Experiments on mathematical reasoning benchmarks such as AIME24 and AIME25 show that Parason achieves an average acceleration of about 1.7× while maintaining competitive accuracy.
By Zhengyang Zhang, Zijian Zhang, Jiaxuan Gao, Shusheng Xu, Yi Wu, Song Han, Ligeng Zhu
arXiv:2511.08577v4 Announce Type: replace-cross
Abstract: Improving the reasoning abilities of Large Language Models (LLMs), especially under parameter constraints, is crucial for real-world applicat...
By Tianyu Fu, Yichen You, Zekai Chen, Guohao Dai, Huazhong Yang, Yu Wang
arXiv:2510. 13940v4 Announce Type: replace-cross Abstract: Recent progress in large language models (LLMs) has focused on test-time scaling to improve reasoning via increased inference computation, but often at the cost of efficiency.
By Zhen Yang, Mingyang Zhang, Feng Chen, Ganggui Ding, Liang Hou, Xin Tao, Ying-Cong Chen
arXiv:2506.17251v3 Announce Type: replace-cross
Abstract: Although large language models (LLMs) have achieved remarkable performance, the inherent stochasticity of their reasoning processes and varyi...
By Dongseok Lee, Jimyung Hong, Dongyoung Kim, Jaehyung Kim
arXiv:2608. 05643v1 Announce Type: new Abstract: Test-time scaling improves LLM reasoning by using additional inference compute, but wider sampling alone can suffer from diminishing returns: new rollouts often repeat existing answer patterns instead of adding useful reasoning diversity.
By Ahsan Bilal, Muhammad Ahmed Mohsin, Muhammad Umer, Lena Trigg, Ali Subhan, Muhammad Ali, Dean F. Hougen
arXiv:2608. 03961v1 Announce Type: new Abstract: Test-time scaling improves LLM reasoning by generating and aggregating multiple candidate answers, yet many pipelines use fixed per-query budgets that spend the same compute on easy and difficult prompts.
By Mobina Kashaniyan, Ali Jannesari
arXiv:2609.39632v1 Announce Type: new
Abstract: Test-time scaling improves language model reasoning by spending additional compute at inference. However, both classes of existing methods often fail t...
By Joseph Rance, Fabio Pizzati, Juil Sock, Woody Bayliss, Marc G\'orriz Blanch, Philip Torr, Adel Bibi
Scaling inference-time computation has emerged as a reliable method to improve the performance of large language models on complex reasoning and programming tasks. However, standard approaches such as independent sampling and sequential multi-turn refinement operate without token-level credit assignment, resulting in computational inefficiency, since valid reasoning prefixes are frequently discarded.