Viktor Mazanov
Author directory2026
Bayesian Control for Coding Agents
Theodore Papamarkou | Vladislav Smirnov | Viktor Mazanov | Artem Vazhentsev | Preslav Nakov | Timothy Baldwin | Artem Shelmanov
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Theodore Papamarkou | Vladislav Smirnov | Viktor Mazanov | Artem Vazhentsev | Preslav Nakov | Timothy Baldwin | Artem Shelmanov
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Modern coding agents pair LLM generators with various tools, including cheap diagnostics and expensive verifiers. The tool-use decisions are typically governed by orchestrators that often use fixed rules and ignore uncertainty. We formulate orchestration as cost-sensitive sequential hypothesis testing: a Bayesian controller maintains a belief over candidate correctness and dynamically decides whether to gather more evidence, refine the candidate, verify it, or stop. Across six generators and nine coding benchmarks, Bayesian control proves to be most valuable when verification is costly and critics are informative but imperfect. Beyond control, the belief state yields an interpretable correctness score that outperforms token-probability and raw tool-success baselines for uncertainty quantification.
ThinkBooster: A Unified Framework for Seamless Test-Time Scaling of LLM Reasoning
Vladislav Smirnov | Quang-Chieu Nguyen | Sergey Senichev | Minh Ngoc Ta | Ekaterina Fadeeva | Artem Vazhentsev | Daria Galimzianova | Nikolai Rozanov | Viktor Mazanov | Jingwei Ni | Tianyi Wu | Igor Kiselev | Mrinmaya Sachan | Iryna Gurevych | Preslav Nakov | Timothy Baldwin | Artem Shelmanov
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)
Vladislav Smirnov | Quang-Chieu Nguyen | Sergey Senichev | Minh Ngoc Ta | Ekaterina Fadeeva | Artem Vazhentsev | Daria Galimzianova | Nikolai Rozanov | Viktor Mazanov | Jingwei Ni | Tianyi Wu | Igor Kiselev | Mrinmaya Sachan | Iryna Gurevych | Preslav Nakov | Timothy Baldwin | Artem Shelmanov
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)
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.g., via multi-sample generation and verifier-based reranking. Existing TTC scaling strategies and reasoning scorers remain fragmented, evaluated under inconsistent protocols, and are rarely analyzed through the lens of quality-cost trade-offs. We introduce ThinkBooster, a unified framework for seamless test-time compute scaling of LLM reasoning, which consists of (i) a modular Python library implementing state-of-the-art TTC scaling strategy and scorer families, (ii) a benchmark that jointly evaluates performance and computational efficiency, and (iii) a deployable OpenAI-compatible proxy service that enables drop-in integration of adaptive reasoning into real-world applications. We further provide a demo visual debugger for inspecting the reasoning trajectories, intermediate selection decisions, and alternative reasoning paths. Empirical results on mathematical and coding tasks reveal the performance-compute trade-offs of TTC scaling strategies and scoring methods and demonstrate that ThinkBooster provides practical gains in real-world tasks. The code is available online under an MIT license.