Overview

Best-of-N sampling spends inference-time compute to generate several answers, then chooses one, aiming to find stronger outputs without retraining the model. Selection methods include reward-model or verifier scores, majority voting and consensus, confidence-based ranking, learned scorers, and regularized or noise-based variants. The approach is used for language-model reasoning and alignment, with evaluations on tasks such as MATH, GSM8K, coding, and instruction following, as well as speech and medical report generation. More samples can improve the chance of finding a good answer, but unreliable judges, reward hacking, tail effects, and rising costs can erase gains or make selections worse; how to evaluate and control these risks remains a central challenge.

Latest papers

CardsList

33 papers5 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.

  1. Decoding as Optimisation on the Probability Simplex: From Top-K to Top-P (Nucleus) to Best-of-K Samplers

    Feb 20, 2026Xiaotong Ji, Rasul Tutunov, Matthieu Zimmer +1Language Model DecodingBest-of-N Sampling

  2. Do not be greedy, Think Twice: Sampling and Selection for Document-level Information Extraction

    Jan 26, 2026Mikel Zubillaga, Oscar Sainz, Oier Lopez de Lacalle +1Self-Consistency DecodingDocument Information Extraction

  3. PiCSAR: Probabilistic Confidence Selection And Ranking for Reasoning Chains

    Aug 29, 2025Joshua Ong Jun Leang, Zheng Zhao, Aryo Pradipta Gema +7Confidence Estimation in Language ModelsBest-of-N Sampling