mlsanityData to 14 Oct 2026

When More Sampling Hurts: The Modal Ceiling and Correlation Ceiling of Test-Time Scaling

arXiv 2606.28661 ↗First posted 27 Jun 2026cs.LG cs.AI cs.CLcited by 6

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

Abstract (arXiv)

People overthink; language models over-sample, and the extra effort can talk both into a worse answer. Reasoning systems answer a hard question by sampling it many times (test-time scaling), and the more they draw, the more often a correct answer turns up somewhere, so coverage, the fraction of problems with at least one correct try, climbs and appears to be progress. But a deployed system must return one answer, and choosing it, not knowing which try is right, is selection; selection is capped, and past a point extra samples only make the model surer of a confident mistake, even as every draw adds cost. The gap between climbing coverage and stalled selection, the identifiability gap, is the answer a model can produce but not pick. So the real question is not whether to sample but how far, and the answer is: not far. For picking an answer, the vote has already settled within a few dozen draws, the modal ceiling; for scoring a benchmark, sooner still, the correlation ceiling. Beyond that, extra draws cost compute and add nothing, and can even make the answer worse. This paper turns the cutoff into a single number, the effective number of samples, that any sampling run already reveals. The bottleneck is recognizing a right answer, not generating one.

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

Builds on

25 of 32 references.

Closest ancestors · 6

Same direction, newest first

  1. 2026Model Capability Dominates: Inference-Time Optimization Lessons from AIMO 329 Mar
  2. 2025A Survey on Test-Time Scaling in Large Language Models: What, How, Where, and How Well?31 Mar
  3. 2025Can 1B LLM Surpass 405B LLM? Rethinking Compute-Optimal Test-Time Scaling10 Feb
  4. 2025s1: Simple test-time scaling31 Jan
  5. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
  6. 2024Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models1 Aug

Other references · 19

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  3. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  4. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  5. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  6. 2019The Curious Case of Neural Text Degenerationcited by 2,916
  7. 2024OpenAI o1 System Cardcited by 1,244
  8. 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
  9. 2023Understanding the Effects of RLHF on LLM Generalisation and Diversitycited by 396
  10. 2025Great Models Think Alike and this Undermines AI Oversightcited by 58
  11. 2025How Do Large Language Monkeys Get Their Power (Laws)?cited by 43
  12. 2024A Simple Model of Inference Scaling Lawscited by 36
7 more
  1. 2026Nine Judges, Two Effective Votes: Correlated Errors Undermine LLM Evaluation Panelscited by 26
  2. 2024Are More LLM Calls All You Need? Towards Scaling Laws of Compound Inference Systemscited by 25
  3. 2025On the Effect of Sampling Diversity in Scaling LLM Inferencecited by 18
  4. 2025Efficient Prediction of Pass@k Scaling in Large Language Modelscited by 16
  5. 2024Machine Learning vs Deep Learning: The Generalization Problemcited by 6
  6. 2026Solve for the Hyperparameter, Skip the Search: Kolmogorov-Optimal Scaling Laws for Spline Regressioncited by 2
  7. 2026No 3D Matrices: A Unified Tensor-Product View of Matrix-Free Cartesian PDE Solverscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 6.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Mitigating Strategy-Selection Bias in Reasoning for More Effective Test-Time Scaling
  2. 2026Test-Time Scaling in Reasoning LLMs: Inference Regimes, Evaluation, and Reproducibility
  3. 2026Tail Competition Explains Scaling in Best-of-N Sampling for Verifiable Problems
  4. 2024Keep Guessing? When Considering Inference Scaling, Mind the Baselines
  5. 2025Sample, Scrutinize and Scale: Effective Inference-Time Search by Scaling Verification
  6. 2025Does Thinking More always Help? Mirage of Test-Time Scaling in Reasoning Models
  7. 2026Budget Boundary Effects in Test-Time Mathematical Reasoning
  8. 2026Interaction Scaling: Grounding the Third Axis of Test-Time Compute