mlsanityData to 7 Oct 2026

CarBoN: Calibrated Best-of-N Sampling Improves Test-time Reasoning

arXiv 2510.15674 ↗First posted 17 Oct 2025cs.LG cs.AIcited by 2

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Allocating more computation during inference time (test-time scaling) improves language model performance, especially for reasoning tasks. However, popular methods like Best-of-N sampling often show diminishing returns as N increases. To address this inefficiency, we introduce a general test-time calibration framework that adaptively modifies the model toward high-reward reasoning paths, with theoretical guarantees of improving the lower bound of expected reward under finite sampling, all without large language model (LLM) retraining. Within this framework, we propose CarBoN (Calibrated Best-of-N), a two-phase method that first explores the solution space and then learns a calibration of the logits via an input-specific temperature T and additive shift vector δ, guiding generation toward more reliable reasoning. Experiments on MATH-500 and AIME-2024 show that CarBoN improves efficiency, with up to 4× fewer rollouts to reach the same accuracy, while often achieving higher accuracy under fixed budgets. We also analyze the complementary roles of T and δ in balancing output diversity and correctness, and demonstrate that the framework also generalizes to step-level sampling strategies such as beam search. For more information, please refer to our project page at huggingface.co/spaces/TrustSafeAI/Test-Time-Calibration.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 14 of its 30 references that are in the map. First posted on arXiv 17 Oct 2025.

Builds on

14 of 30 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025Scaling Test-Time Compute Without Verification or RL is Suboptimal17 Feb
  2. 2025Can 1B LLM Surpass 405B LLM? Rethinking Compute-Optimal Test-Time Scaling10 Feb
  3. 2025Rollout Roulette: A Probabilistic Inference Approach to Inference-Time Scaling of LLMs using Particle-Based Monte Carlo Methods3 Feb
  4. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug

Other references · 10

  1. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  2. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  4. 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,397
  5. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
  6. 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 946
  7. 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 895
  8. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
  9. 2023MAmmoTH: Building Math Generalist Models through Hybrid Instruction Tuningcited by 483
  10. 2025The Lessons of Developing Process Reward Models in Mathematical Reasoningcited by 402

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025On the Role of Temperature Sampling in Test-Time Scaling
  2. 2026Refining Over Resampling: Test-Time Self-Correction for LLM Reasoning
  3. 2025On the Limits of Test-Time Compute: Sequential Reward Filtering for Better Inference
  4. 2025Adaptive Test-Time Reasoning via Reward-Guided Dual-Phase Search
  5. 2025A Theoretical Study on Bridging Internal Probability and Self-Consistency for LLM Reasoning
  6. 2025Reward Model Generalization for Compute-Aware Test-Time Reasoning
  7. 2026Adaptive Test-Time Compute Allocation via Learned Heuristics over Categorical Structure
  8. 2025The Art of Scaling Test-Time Compute for Large Language Models