Chopthin-Consensus Power Sampling: A Diversity-Preserving Approach to LLM Decoding
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Inference-time power sampling via Sequential Monte Carlo (SMC) can substantially improve large language model (LLM) reasoning without requiring post-training. However, many existing SMC approaches rely on equal-weight resampling, which can aggressively prune low-weight trajectories, discarding potentially correct reasoning paths and degrading the genealogical diversity of the search space. To address this, we introduce Chopthin-Consensus Power Sampling (CCPS). Our method applies the Chopthin resampler to LLM decoding: rather than equalizing weights and forcing unnecessary particle duplication, it enforces an upper bound on the ratio between the largest and smallest weights and carries the unequal weights forward. This targeted intervention preserves a richer set of distinct reasoning paths, keeps the weighted SMC approximation unchanged in conditional expectation, and guarantees a lower bound on the post-resampling effective sample size (ESS). To fully exploit this enriched population, we employ a semantic-majority selection mechanism that merges token-identical final trajectories, clusters semantically equivalent answers, and returns the answer supported by the largest number of distinct trajectories. Evaluating across three open-weight models and five reasoning benchmarks, we show that Chopthin increases oracle coverage in 13 of 15 settings. Combined with semantic-majority selection, CCPS matches or exceeds the final-answer accuracy of the Power-SMC baseline in 14 of 15 settings, delivering absolute gains of up to 10.6 percentage points. These findings demonstrate that diversity-preserving resampling and diversity-aware selection are complementary mechanisms for training-free LLM reasoning. Code is available at github.com/MinooAhmadii/chopthin-consensus-power-sampling.
Key facts. No citing papers in the map yet (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 38 references that are in the map. First posted on arXiv 10 Sep 2026.
Builds on
25 of 38 references.
Closest ancestors · 6
Same direction, newest first
- 2026Intrinsic Selection and Particle Resampling for Inference-Time Scaling Beyond Domain Verifiability7 Jun
- 2026Self-Consistency via Marginal Sharpening27 May
- 2026Beyond the Frontier: Stochastic Backtracking for Efficient Test-Time Scaling24 May
- 2026Power-SMC: Low-Latency Sequence-Level Power Sampling for Training-Free LLM Reasoning10 Feb
- 2025Mitigating Premature Exploitation in Particle-based Monte Carlo for Inference-Time Scaling7 Oct
- 2023Universal Self-Consistency for Large Language Model Generation29 Nov
Other references · 19
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2023Let's Verify Step by Stepcited by 3,789
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2022Competition-Level Code Generation with AlphaCodecited by 1,462
- 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,392
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,090
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
- 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 982
- 2023Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation in Natural Language Generationcited by 819
7 more
- 2022CodeT: Code Generation with Generated Testscited by 384
- 2024Probabilistic Inference in Language Models via Twisted Sequential Monte Carlocited by 90
- 2025Reasoning with Sampling: Your Base Model is Smarter Than You Thinkcited by 89
- 2023Sequential Monte Carlo Steering of Large Language Models using Probabilistic Programscited by 80
- 2025Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlocited by 46
- 2026Scalable Power Sampling: Unlocking Efficient, Training-Free Reasoning for LLMs via Distribution Sharpeningcited by 31
- 2026Sampling for Quality: Training-Free Reward-Guided LLM Decoding via Sequential Monte Carlocited by 5
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025p-less Sampling: A Robust Hyperparameter-Free Approach for LLM Decoding
- 2026Adaptive Power Sampling for LLM Reasoning
- 2026Think Twice Before You Write -- an Entropy-based Decoding Strategy to Enhance LLM Reasoning
- 2025Sample Smart, Not Hard: Correctness-First Decoding for Better Reasoning in LLMs
- 2026Faster LLM Inference via Sequential Monte Carlo
- 2026ReSight-SMC: Two-Stage Power Sampling via Island SMC with Visual Scouts
- 2026PreSTO: Predictive Subtree Prefetching for Fast LLM Power Sampling
- 2026Learning Adaptive LLM Decoding