BEACON: Bayesian Optimal Stopping for Efficient LLM Sampling
Not on the map. Why?
Abstract (arXiv)
Sampling multiple responses is a common way to improve LLM output quality, but it comes at the cost of additional computation. The key challenge is deciding when to stop generating new samples to balance accuracy gains against efficiency. To address this, we introduce BEACON (Bayesian Efficient Adaptive Criterion for Optimal N-stopping), a principled adaptive sampling framework grounded in Sequential Search with Bayesian Learning. BEACON sequentially generates responses from the policy LLM, updates posterior belief over reward distributions in real time without further training, and determines when to stop by weighing expected gains against computational cost. Sampling terminates once the marginal utility of further exploration no longer justifies the expense. We establish both theoretical optimality guarantees and practical tractability, and show empirically that BEACON reduces average sampling by up to 80% while maintaining response quality. We further demonstrate BEACON's utility for cost-efficient preference data generation and outline practical extensions, offering actionable insights for future researchers.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Oct 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026Optimal Bayesian Stopping for Efficient Inference of Consistent LLM Answerscited by 8
- 2026Test-Time Compute Gamescited by 4
- 2026ATLAS: Agentic Test-time Learning-to-Allocate Scalingcited by 4
- 2026Adaptive Generate-Rank-Verify: Inference-Time Search with Costly Verificationcited by 2
- 2026Knowing When to Stop: Bayesian Optimal Stopping for LLM Evaluationscited by 2
- 2026Strategic Self-Consistencycited by 0
- 2026Tail Competition Explains Scaling in Best-of-N Sampling for Verifiable Problemscited by 0
- 2026Tail Competition Explains Scaling in Best-of-N Sampling for Verifiable Problems14 Oct 2026
- 2026Strategic Self-Consistency24 Sep 2026
- 2026Knowing When to Stop: Bayesian Optimal Stopping for LLM Evaluations14 Aug 2026
- 2026ATLAS: Agentic Test-time Learning-to-Allocate Scaling1 Jun 2026
- 2026Adaptive Generate-Rank-Verify: Inference-Time Search with Costly Verification17 May 2026
- 2026Optimal Bayesian Stopping for Efficient Inference of Consistent LLM Answers5 Feb 2026
- 2026Test-Time Compute Games29 Jan 2026